Computational geometry: an introduction
Computational geometry: an introduction
Bumptrees for efficient function, constraint, and classification learning
NIPS-3 Proceedings of the 1990 conference on Advances in neural information processing systems 3
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Discriminant Adaptive Nearest Neighbor Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A Fast Algorithm for the Nearest-Neighbor Classifier
IEEE Transactions on Pattern Analysis and Machine Intelligence
Combination of Multiple Classifiers Using Local Accuracy Estimates
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality
IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
The canonical distortion measure in feature space and 1-NN classification
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Accelerating exact k-means algorithms with geometric reasoning
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Image Databases and Multimedia Search
Image Databases and Multimedia Search
On approximate nearest neighbors under I norm
Journal of Computer and System Sciences
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Data Mining and Knowledge Discovery
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Bootstrap Technique for Nearest Neighbor Classifier Design
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improving Minority Class Prediction Using Case-Specific Feature Weights
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
The Labeled Cell Classifier: A Fast Approximation to k Nearest Neighbors
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Anomaly detection of web-based attacks
Proceedings of the 10th ACM conference on Computer and communications security
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Supervised classification for video shot segmentation
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1
Multiresolution instance-based learning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Addressing the problems of data-centric physiology-affect relations modeling
Proceedings of the 15th international conference on Intelligent user interfaces
Fast exact k nearest neighbors search using an orthogonal search tree
Pattern Recognition
Query by document via a decomposition-based two-level retrieval approach
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A new framework for dissimilarity and similarity learning
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Hi-index | 0.00 |
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if we want exact answers to nonparametric queries, we usually do not need to explicitly find the data points close to the query, but merely need to answer questions about the properties of that set of data points. This offers a small amount of computational leeway, and we investigate how much that leeway can be exploited. This is applicable to many algorithms in nonparametric statistics, memory-based learning and kernel-based learning. But for clarity, this paper concentrates on pure k-NN classification. We introduce new ball-tree algorithms that on real-world data sets give accelerations from 2-fold to 100-fold compared against highly optimized traditional ball-tree-based k-NN. These results include data sets with up to 106 dimensions and 105 records, and demonstrate non-trivial speed-ups while giving exact answers.