184 search results - page 4 / 37 » Efficiently handling feature redundancy in high-dimensional ... |
PCM
2001
Springer
13 years 10 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
KDD
2001
ACM
14 years 6 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
TASLP
2008
13 years 6 months ago
2008
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...