Name
Title | ||
|---|---|---|
Associative Graph Data Structures Used For Acceleration Of K Nearest Neighbor Classifiers |
Abstract | ||
|---|---|---|
This paper introduces a new associative approach for significant acceleration of k Nearest Neighbor classifiers (kNN). The kNN classifier is a lazy method, i.e. it does not create a computational model, so it is inefficient during classification using big training data sets because it requires going through all training patterns when classifying each sample. In this paper, we propose to use Associative Graph Data Structures (AGDS) as an efficient model for storing training patterns and their relations, allowing for fast access to nearest neighbors during classification made by kNNs. Hence, the AGDS significantly accelerates the classification made by kNNs, especially for large and huge training datasets. In this paper, we introduce an Associative Acceleration Algorithm and demonstrate how it works on this associative structure substantially reducing the number of checked patterns and quickly selecting k nearest neighbors for kNNs. The presented approach was compared to classic kNN approaches successfully. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-01418-6_64 | ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2018, PT I |
Keywords | Field | DocType |
Classification, K nearest neighbors, Associative acceleration, Brain-inspired associative approach, Associative Graph Data Structures | k-nearest neighbors algorithm,Data structure,Graph,Associative property,Pattern recognition,Computer science,Acceleration,Artificial intelligence,Classifier (linguistics),Training data sets | Conference |
Volume | ISSN | Citations |
11139 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adrian Horzyk | 1 | 53 | 12.76 |
| Krzysztof Goldon | 2 | 0 | 0.34 |