Skip to search formSkip to main contentSkip to account menu

IDistance

Known as: The iDistance Indexing Technique, The iDistance Technique 
In pattern recognition, the iDistance is an indexing and query processing technique for k-nearest neighbor queries on point data in multi-dimensional… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
B+ treeCluster analysisCurse of dimensionalityPattern recognition

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Sparse Coding for Event Tracking and Image Retrieval
Comparing regions of images is a fundamental task in both similarity based object tracking as well as retrieval of images from… 
2017
2017
Effective optimizations of cluster-based nearest neighbor search in high-dimensional space
Nearest neighbor (NN) search in high-dimensional space plays a fundamental role in large-scale image retrieval. It seeks… 
2016
2016
PFO: A ParallelFriendly High Performance System for Online Query and Update of Nearest Neighbors
Nearest Neighbor(s) search is the fundamental computational primitive to tackle massive dataset. Locality Sensitive Hashing (LSH… 
2015
2015
A New Perspective on Quality Characteristics Determining Supply Chain Management of Coffee Production
This paper explores the differences in the quality perception of coffee among different participants in the supply chain… 
2014
2014
Document clustering algorithms, representations and evaluation for information retrieval
This thesis presents new methods for classification and thematic grouping of billions of web pages, at scales previously not… 
2013
2013
A Comprehensive Study of iDistance Partitioning Strategies for kNN Queries and High-Dimensional Data Indexing
Efficient database indexing and information retrieval tasks such as k-nearest neighbor (kNN) search still remain difficult… 
2013
2013
A Mapping Based Approach for Multidimensional Data Indexing
The most common approach to improve performance for databases is through indexing. Mapping based approach is an easy to implement… 
2009
2009
RANKING OF BANKS IN SERBIA1
It is often very difficult to rank entities characterized by more than one indicator. In the case of banking sector, especially… 
2005
2005
Generalized multidimensional data mapping and query processing
Multidimensional data points can be mapped to one-dimensional space to exploit single dimensional indexing structures such as the… 
Highly Cited
2004
Highly Cited
2004
Making the pyramid technique robust to query types and workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)