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… 
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… 
2011
2011
Construction-and-extraction Based Index for Images Retrieval
The past recent years have witnessed more and more applications on image retrieval. As searching a large image database is often… 
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… 
2008
2008
Cluster Splitting Based High Dimensional Metric Space Index B~+-Tree
In order to improve the query efficiency,K-means cluster approach is often used to estimate the data distribution in the context… 
2008
2008
Cluster Splitting Based High Dimensional Metric Space Index B + -Tree: Cluster Splitting Based High Dimensional Metric Space Index B + -Tree
In order to improve the query efficiency, K-means cluster approach is often used to estimate the data distribution in the context… 
2008
2008
BC-iDistance： an optimized high-dimensional index for KNN processing
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… 
2005
2005
Indexing the Distance Using Chord: A Distributed SimilaritySearch Structure
The need of search mechanisms based on data content rather then attributes values has recently lead to formation of the metric… 
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)