113 search results - page 4 / 23 » Locally adaptive metrics for clustering high dimensional dat... |
UAI
2000
13 years 8 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
KDD
2008
ACM
14 years 7 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...
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...