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
Using the Real Dimension of the Data
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Probabilistic Proximity Searching Algorithms Based on Compact Partitions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Center-Based Indexing for Nearest Neighbors Search
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
Some approaches to improve tree-based nearest neighbour search algorithms
Pattern Recognition
Efficient online top-K retrieval with arbitrary similarity measures
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
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
Parallel query processing on distributed clustering indexes
Journal of Discrete Algorithms
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
Exploiting distance coherence to speed up range queries in metric indexes
Information Processing Letters
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
Clustering-based similarity search in metric spaces with sparse spatial centers
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fully dynamic metric access methods based on hyperplane partitioning
Information Systems
A GPU-Based Implementation for Range Queries on Spaghettis Data Structure
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
Impact of the initialization in tree-based fast similarity search techniques
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Accelerating video identification by skipping queries with a compact metric cache
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
MIS'05 Proceedings of the 11th international conference on Advances in Multimedia Information Systems
Analogy-based reasoning in classifier construction
Transactions on Rough Sets IV
Indexing dense nested metric spaces for efficient similarity search
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters
Reduction of distance computations in selection of pivot elements for balanced GHT structure
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Efficient similarity search in metric spaces with cluster reduction
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Center-Based Indexing in Vector and Metric Spaces
Fundamenta Informaticae
| Hi-index | 0.01 |
In this paper we present a tree structure for storing points from a normed space whose norm is effectively computable. We then give an algorithm for finding the nearest point from the tree to a given query point. Our algorithm searches the tree and uses the triangle inequality to eliminate searching of the entirety of some branches of the tree whenever a certain predicate is satisfied. Our data structure uses 0(n) for storage. Empirical data which we have gathered suggest that the expected complexity for preprocessing and the search time are, respectively, 0(nlogn) and 0(logn).