Journal of the ACM (JACM)
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Grouping Character Shapes by Means of Genetic Programming
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Using the Dual of Proximity Graphs for Binary Decision Tree Design
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
A Data-Clustering Algorithm on Distributed Memory Multiprocessors
Revised Papers from Large-Scale Parallel Data Mining, Workshop on Large-Scale Parallel KDD Systems, SIGKDD
On Filtering the Training Prototypes in Nearest Neighbour Classification
CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
Image Retrieval Using a Hierarchy of Clusters
ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition
Center-Based Indexing for Nearest Neighbors Search
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Document Clustering Using Locality Preserving Indexing
IEEE Transactions on Knowledge and Data Engineering
Cell algorithms with data inflation for non-parametric classification
Pattern Recognition Letters
Some approaches to improve tree-based nearest neighbour search algorithms
Pattern Recognition
A case-based reasoning system for PCB principal process parameter identification
Expert Systems with Applications: An International Journal
Self-generating prototypes for pattern classification
Pattern Recognition
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set
Information Processing Letters
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
A Graph-Theoretic Approach to Nonparametric Cluster Analysis
IEEE Transactions on Computers
A Branch and Bound Algorithm for Feature Subset Selection
IEEE Transactions on Computers
Expert Systems with Applications: An International Journal
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A survey of browsing models for content based image retrieval
Multimedia Tools and Applications
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Fast Most Similar Neighbor Classifier for Mixed Data
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A New Variant of the Optimum-Path Forest Classifier
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Universal Estimation of Information Measures for Analog Sources
Foundations and Trends in Communications and Information Theory
New prune rules for similarity search
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
Divergence estimation for multidimensional densities via k-nearest-neighbor distances
IEEE Transactions on Information Theory
AdaIndex: An Adaptive Index Structure for Fast Similarity Search in Metric Spaces
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Probably correct k-nearest neighbor search in high dimensions
Pattern Recognition
Designing eigenspace manifolds: with application to object identification and pose estimation
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Paper: Nearest neighbor classification on two types of SIMD machines
Parallel Computing
Fast exact k nearest neighbors search using an orthogonal search tree
Pattern Recognition
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Fast k most similar neighbor classifier for mixed data based on a tree structure
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Fast k most similar neighbor classifier for mixed data based on approximating and eliminating
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
An improved growing LVQ for text classification
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
Interactively browsing large image collections
ACM SIGGRAPH 2010 Talks
Combining elimination rules in tree-based nearest neighbor search algorithms
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
An exact fast nearest neighbor identification technique
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: image and multidimensional signal processing - Volume V
Knowledge source confidence measure applied to a rule-based recognition system
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
WSEAS TRANSACTIONS on SYSTEMS
An initial study on progressive filtering based on dynamic programming for query-by-singing/humming
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Clustering-Based image retrieval using fast exhaustive multi-resolution search algorithm
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Analogy-based reasoning in classifier construction
Transactions on Rough Sets IV
Detecting novel network attacks with a data field
WISI'06 Proceedings of the 2006 international conference on Intelligence and Security Informatics
The nearest neighbor problem in an abstract metric space
Pattern Recognition Letters
An improved branch and bound algorithm for computing k-nearest neighbors
Pattern Recognition Letters
Analysis of k-nearest neighbor branch and bound rules
Pattern Recognition Letters
Approximative fast nearest-neighbour recognition
Pattern Recognition Letters
Center-Based Indexing in Vector and Metric Spaces
Fundamenta Informaticae
Thick boundaries in binary space and their influence on nearest-neighbor search
Pattern Recognition Letters
Combining classifiers under probabilistic models: experimental comparative analysis of methods
Expert Systems: The Journal of Knowledge Engineering
| Hi-index | 15.06 |
Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances. Experimental results demonstrate the efficiency of the algorithm. Typically, an average of only 61 distance computations were made to find the nearest neighbor of a test sample among 1000 design samples.