Active-learning query strategies applied to select a graph node given a graph labelling

DOI10.1007/978-3-642-38221-5_7MaRDI QIDQ4922147zbMATH OpenOpenAlexFDO

Authors Xavier Cortés, F. Serratosa

Publication date 28 May 2013

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38221-5_7

zbMATH Keywords

machine learningmaximum entropyactive and interactive graph matchingexpected model changeleast confident

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Interactive graph-matching using active query strategies
• The graph matching problem
• Two faces of active learning
• Active learning
• Matching graphs by pivoting

Cited in

(2)

• Improving bipartite graph edit distance approximation using various search strategies
• Interactive graph-matching using active query strategies

This page was built for publication: Active-learning query strategies applied to select a graph node given a graph labelling

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