Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy

DOI10.1007/978-3-319-58961-9_18zbMath1489.68178OpenAlexW2613895180MaRDI QIDQ5082156

Jean-Yves Ramel, Zeina abu-Aisheh, Romain Raveaux

Publication date: 15 June 2022

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-319-58961-9_18

zbMATH Keywords

optimizationbranch and boundgraph edit distancegraph classificationk-nearest neighbors

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Fast similarity search for graphs by edit distance

Cites Work

• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• A long trip in the charming world of graphs for pattern recognition
• Finding Prototypes For Nearest Neighbor Classifiers
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• Nearest neighbor pattern classification

This page was built for publication: Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy