Efficient k-nearest neighbors search in graph space

•The k-nearest neighbors (kNN) classifier is time consuming when the size of the database is large.•We propose a fast k-nearest neighbor algorithm in graph space.•The algorithm extends a Depth-First algorithm dedicated to solving the graph matching problem.•The search spaces whose purpose is to clas...

Ausführliche Beschreibung