Interactive graph-matching using active query strategies

DOI10.1016/J.PATCOG.2014.10.033MaRDI QIDQ1678689zbMATH OpenOpenAlexFDO

Authors F. Serratosa, Xavier Cortés

Publication date 20 November 2017

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2014.10.033

zbMATH Keywords

edit distanceactive query strategieserror-tolerant graph matchinginteractive node labelling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Distance in graphs (05C12)

Recommendations

• Active-learning query strategies applied to select a graph node given a graph labelling
• Automatic learning of edit costs based on interactive and adaptive graph recognition
• The graph matching problem
• Matching graphs by pivoting
• Structural Matching with Active Triangulations

Cites work

• scientific article; zbMATH DE number 1149423 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 2080645 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A Mathematical Theory of Communication
• A distance measure between attributed relational graphs for pattern recognition
• Active learning
• Active learning for image retrieval with Co-SVM
• Active learning with adaptive regularization
• Graph edit distance -- optimal and suboptimal algorithms with applications
• Handbook of Fingerprint Recognition
• Interactive localized content based image retrieval with multiple-instance active learning
• Intrinsically motivated exploration for developmental and active sensorimotor learning
• Multimodal Interactive Pattern Recognition and Applications
• Multimodal interactive transcription of text images
• Multiple-view multiple-learner active learning
• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• Queries and concept learning
• SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search
• Supervised machine learning: a review of classification techniques

Cited in

(3)

• On the influence of node centralities on graph edit distance for graph classification
• Automatic learning of edit costs based on interactive and adaptive graph recognition
• Active-learning query strategies applied to select a graph node given a graph labelling

This page was built for publication: Interactive graph-matching using active query strategies

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