IDistance
In pattern recognition, the iDistance is an indexing and query processing technique for k-nearest neighbor queries on point data in multi-dimensional metric spaces. The kNN query is one of the hardest problems on multi-dimensional data, especially when the dimensionality of the data is high. The iDistance is designed to process kNN queries in high-dimensional spaces efficiently and it is especially good for skewed data distributions, which usually occur in real-life data sets.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
IDistance
In pattern recognition, the iDistance is an indexing and query processing technique for k-nearest neighbor queries on point data in multi-dimensional metric spaces. The kNN query is one of the hardest problems on multi-dimensional data, especially when the dimensionality of the data is high. The iDistance is designed to process kNN queries in high-dimensional spaces efficiently and it is especially good for skewed data distributions, which usually occur in real-life data sets.
has abstract
In pattern recognition, the iD ...... occur in real-life data sets.
@en
Link from a Wikipage to an external page
Wikipage page ID
18,990,485
page length (characters) of wiki page
Wikipage revision ID
879,632,966
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
In pattern recognition, the iD ...... occur in real-life data sets.
@en
label
IDistance
@en