766 search results - page 3 / 154 » Clustering high dimensional data using subspace and projecte... |
DMIN
2008
13 years 10 months ago
2008
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
14 years 25 days ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
SDM
2009
SIAM
14 years 5 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...