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...

Full description

Saved in:

Bibliographic Details
Published in:	Pattern recognition letters Vol. 134; pp. 77 - 86
Main Authors:	Abu-Aisheh, Zeina, Raveaux, Romain, Ramel, Jean-Yves
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.06.2020 Elsevier Science Ltd Elsevier
Subjects:	Algorithms Branch-and-Bound Computer Science Computer Vision and Pattern Recognition Graph classification Graph Edit Distance Graphs Image Processing K-Nearest Neighbors Optimization Optimization techniques Pattern recognition Searching Training K-Nearest Neighbors Branch-and-Bound 41A10 65D05 65D17 Graph classification 41A05 Optimization Graph Edit Distance
ISSN:	0167-8655, 1872-7344
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!