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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Pattern recognition letters Ročník 134; s. 77 - 86
Hlavní autoři: Abu-Aisheh, Zeina, Raveaux, Romain, Ramel, Jean-Yves
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.06.2020
Elsevier Science Ltd
Elsevier
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•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 classify a graph G are grouped in one global search tree.•This method outperformed the state-of-the-art algorithms especially when the number of graphs is large. The k-nearest neighbors classifier has been widely used to classify graphs in pattern recognition. An unknown graph is classified by comparing it to all the graphs in the training set and then assigning it the class to which the majority of the nearest neighbors belong. When the size of the database is large, the search of k-nearest neighbors can be very time consuming. On this basis, researchers proposed optimization techniques to speed up the search for the nearest neighbors. However, to the best of our knowledge, all the existing works compared the unknown graph to each train graph separately and thus none of them considered finding the k nearest graphs from a query as a single problem. In this paper, we define a new problem called multi graph edit distance to which k-nearest neighbor belongs. As a first algorithm to solve this problem, we take advantage of a recent exact branch-and-bound graph edit distance approach in order to speed up the classification stage. We extend this algorithm by considering all the search spaces needed for the dissimilarity computation between the unknown and the training graphs as a single search space. Results showed that this approach drastically outperformed the original approach under limited time constraints. Moreover, the proposed approach outperformed fast graph edit distance algorithms in terms of average execution time especially when the number of graphs is tremendous.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0167-8655
1872-7344
DOI:10.1016/j.patrec.2018.05.001