Interactive graph-matching using active query strategies

DOI10.1016/j.patcog.2014.10.033zbMath1374.68476OpenAlexW1970125297MaRDI QIDQ1678689

Xavier Cortés, Francesc Serratosa

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)

Related Items (1)

On the Influence of Node Centralities on Graph Edit Distance for Graph Classification

Cites Work

• A Mathematical Theory of Communication
• Active learning for image retrieval with Co-SVM
• Multimodal interactive transcription of text images
• Interactive localized content based image retrieval with multiple-instance active learning
• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• Multiple-view multiple-learner active learning
• Queries and concept learning
• SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search
• Active learning with adaptive regularization
• Active Learning
• Multimodal Interactive Pattern Recognition and Applications
• Intrinsically Motivated Exploration for Developmental and Active Sensorimotor Learning
• Handbook of Fingerprint Recognition
• A distance measure between attributed relational graphs for pattern recognition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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