Extensions of the k Nearest Neighbour methods for classification problems

Authors:
Zacharias Voulgaris;George D. Magoulas
Affiliations:
University of London, United Kingdom;University of London, United Kingdom
Venue:
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
Year:
2008

Citing 5
Cited 0

A modification of the LAESA algorithm for approximated k-NN classification

Pattern Recognition Letters
k-nearest Neighbor Classification on Spatial Data Streams Using P-trees

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
SMART-TV: a fast and scalable nearest neighbor based classifier for data mining

Proceedings of the 2006 ACM symposium on Applied computing
Approximate Nearest Neighbor Search using a Single Space-filling Curve and Multiple Representations of the Data Points

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
Modeling interestingness of streaming classification rules as a classification problem

TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k Nearest Neighbour (kNN) method is a widely used technique which has found several applications in clustering and classification. In this paper, we focus on classification problems and we propose modifications of the nearest neighbour method that exploit information from the structure of a dataset. The results of our experiments using datasets from the UCI repository demonstrate that the classifiers produced perform generally better than the classic kNN and are more reliable, without being significantly slower.