An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
SIAM Journal on Computing
Cover trees for nearest neighbor
ICML '06 Proceedings of the 23rd international conference on Machine learning
Cover trees for nearest neighbor
ICML '06 Proceedings of the 23rd international conference on Machine learning
Efficient filtering with sketches in the ferret toolkit
MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
Sizing sketches: a rank-based analysis for similarity search
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Learning for efficient retrieval of structured data with noisy queries
Proceedings of the 24th international conference on Machine learning
Distributed Nearest Neighbor-Based Condensation of Very Large Data Sets
IEEE Transactions on Knowledge and Data Engineering
Multi-probe LSH: efficient indexing for high-dimensional similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Disorder inequality: a combinatorial approach to nearest neighbor search
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Random projection trees and low dimensional manifolds
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast nearest neighbor retrieval for bregman divergences
Proceedings of the 25th international conference on Machine learning
An Empirical Comparison of Exact Nearest Neighbour Algorithms
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Estimating Sales Opportunity Using Similarity-Based Methods
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
A posteriori multi-probe locality sensitive hashing
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
PROMISE '09 Proceedings of the 5th International Conference on Predictor Models in Software Engineering
Using the doubling dimension to analyze the generalization of learning algorithms
Journal of Computer and System Sciences
SimpleNPKL: simple non-parametric kernel learning
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
DataLens: making a good first impression
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A Scalable Noise Reduction Technique for Large Case-Based Systems
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Fast Local Support Vector Machines for Large Datasets
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Graph-Based Discrete Differential Geometry for Critical Instance Filtering
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Compositional Models for Reinforcement Learning
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
A fast data collection and augmentation procedure for object recognition
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Unsupervised methods for determining object and relation synonyms on the web
Journal of Artificial Intelligence Research
Near-duplicate detection for images and videos
LS-MMRM '09 Proceedings of the First ACM workshop on Large-scale multimedia retrieval and mining
Combinatorial Framework for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Similarity search on Bregman divergence: towards non-metric indexing
Proceedings of the VLDB Endowment
Using trees to depict a forest
Proceedings of the VLDB Endowment
Autonomous indoor helicopter flight using a single onboard camera
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Scaling up semi-supervised learning: an efficient and effective LLGC variant
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
How to complete a doubling metric
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Similarity search and locality sensitive hashing using ternary content addressable memories
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Semi-supervised distance metric learning for collaborative image retrieval and clustering
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Noise reduction for instance-based learning with a local maximal margin approach
Journal of Intelligent Information Systems
Fast and Scalable Local Kernel Machines
The Journal of Machine Learning Research
Efficient incremental near duplicate detection based on locality sensitive hashing
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Proximity algorithms for nearly-doubling spaces
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Semi-supervised metric learning for image classification
PCM'10 Proceedings of the Advances in multimedia information processing, and 11th Pacific Rim conference on Multimedia: Part II
Autonomous Helicopter Aerobatics through Apprenticeship Learning
International Journal of Robotics Research
Efficient k-nearest neighbor graph construction for generic similarity measures
Proceedings of the 20th international conference on World wide web
Fast palmprint identification with multiple templates per subject
Pattern Recognition Letters
Incremental manifold learning by spectral embedding methods
Pattern Recognition Letters
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A Family of Simple Non-Parametric Kernel Learning Algorithms
The Journal of Machine Learning Research
Diversification and refinement in collaborative filtering recommender
Proceedings of the 20th ACM international conference on Information and knowledge management
Data-driven trajectory smoothing
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part I
Adaptive weighted fusion of local kernel classifiers for effective pattern classification
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Profiling instances in noise reduction
Knowledge-Based Systems
Dynamic diversification of continuous data
Proceedings of the 15th International Conference on Extending Database Technology
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Proceedings of the twenty-eighth annual symposium on Computational geometry
Interactive buildup of animation sequences with captured motion data
Computer Animation and Virtual Worlds
Distributed KNN-graph approximation via hashing
Proceedings of the 2nd ACM International Conference on Multimedia Retrieval
Maximum inner-product search using cone trees
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Storytelling in entity networks to support intelligence analysts
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A generic framework for efficient and effective subsequence retrieval
Proceedings of the VLDB Endowment
A hybrid computer-aided linkage design system for tracing open and closed planar curves
Computer-Aided Design
Computational topology in text mining
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Semi-supervised spectral hashing for fast similarity search
Neurocomputing
Efficient distributed locality sensitive hashing
Proceedings of the 21st ACM international conference on Information and knowledge management
Unsupervised non-parametric kernel learning algorithm
Knowledge-Based Systems
Least square regularized spectral hashing for similarity search
Signal Processing
Human-virtual human interaction by upper body gesture understanding
Proceedings of the 19th ACM Symposium on Virtual Reality Software and Technology
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient regression in metric spaces via approximate lipschitz extension
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Retrieval and clustering for supporting business process adjustment and analysis
Information Systems
Tapkee: an efficient dimension reduction library
The Journal of Machine Learning Research
| Hi-index | 0.00 |
We present a tree data structure for fast nearest neighbor operations in general n-point metric spaces (where the data set consists of n points). The data structure requires O(n) space regardless of the metric's structure yet maintains all performance properties of a navigating net (Krauthgamer & Lee, 2004b). If the point set has a bounded expansion constant c, which is a measure of the intrinsic dimensionality, as defined in (Karger & Ruhl, 2002), the cover tree data structure can be constructed in O (c6n log n) time. Furthermore, nearest neighbor queries require time only logarithmic in n, in particular O (c12 log n) time. Our experimental results show speedups over the brute force search varying between one and several orders of magnitude on natural machine learning datasets.