Graph matching: Fast candidate elimination using machine learning techniques

DOI10.1007/3-540-44522-6_25MaRDI QIDQ4536495zbMATH OpenFDO

Authors Mihai Lazarescu, Svetha Venkatesh, Horst Bunke

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44522-6_25

zbMATH Keywords

C4.5database indexingdatabase retrievalgraph isomorphismgraph matchingmachine learningstructural pattern recognition

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2222791
• scientific article; zbMATH DE number 2086428
• Structural, Syntactic, and Statistical Pattern Recognition
• scientific article; zbMATH DE number 2043360
• Graph-Based Representations in Pattern Recognition

Cited in

(4)

• Kronecker product graph matching.
• Graph-Based Representations in Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• scientific article; zbMATH DE number 2222791 (Why is no real title available?)

Describes a project that uses

Uses Software

• C4.5

This page was built for publication: Graph matching: Fast candidate elimination using machine learning techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536495)