An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
A Fast Algorithm for the Nearest-Neighbor Classifier
IEEE Transactions on Pattern Analysis and Machine Intelligence
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
IEEE Transactions on Knowledge and Data Engineering
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Extension to C-means Algorithm for the Use of Similarity Functions
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
PCA-based branch and bound search algorithms for computing K nearest neighbors
Pattern Recognition Letters
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Operators for Expensive Functions in Continuous Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
The Dissimilarity Representation for Pattern Recognition: Foundations And Applications (Machine Perception and Artificial Intelligence)
On the information and representation of non-Euclidean pairwise data
Pattern Recognition
Fast multiscale clustering and manifold identification
Pattern Recognition
Some approaches to improve tree-based nearest neighbour search algorithms
Pattern Recognition
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
An Algorithm for Finding Nearest Neighbors
IEEE Transactions on Computers
A Data Structure and an Algorithm for the Nearest Point Problem
IEEE Transactions on Software Engineering
Improved heterogeneous distance functions
Journal of Artificial Intelligence Research
Search space reductions for nearest-neighbor queries
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the least cost for proximity searching in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Nearest neighbor pattern classification
IEEE Transactions on Information Theory
IEEE Transactions on Image Processing
A nonparametric classification method based on K-associated graphs
Information Sciences: an International Journal
Parallel k-most similar neighbor classifier for mixed data
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Hi-index | 0.01 |
The k nearest neighbor (k-NN) classifier has been a widely used nonparametric technique in Pattern Recognition, because of its simplicity and good performance. In order to decide the class of a new prototype, the k-NN classifier performs an exhaustive comparison between the prototype to classify and the prototypes in the training set T. However, when T is large, the exhaustive comparison is expensive. For this reason, many fast k-NN classifiers have been developed, some of them are based on a tree structure, which is created during a preprocessing phase using the prototypes in T. Then, in a search phase, the tree is traversed to find the nearest neighbor. The speed up is obtained, while the exploration of some parts of the tree is avoided using pruning rules which are usually based on the triangle inequality. However, in soft sciences as Medicine, Geology, Sociology, etc., the prototypes are usually described by numerical and categorical attributes (mixed data), and sometimes the comparison function for computing the similarity between prototypes does not satisfy metric properties. Therefore, in this work an approximate fast k most similar neighbor classifier, for mixed data and similarity functions that do not satisfy metric properties, based on a tree structure (Tree k-MSN) is proposed. Some experiments with synthetic and real data are presented.