766 search results - page 31 / 154 » Clustering high dimensional data using subspace and projecte... |
PAMI
2006
13 years 8 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
WISE
2002
Springer
14 years 1 months ago
2002
Springer
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a un...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we devise an efficient algorithm for clustering market-basket data. Different from those of the traditional data, the features of market-basket data are known to b...
CIDU
2010
13 years 6 months ago
2010
There has been a lot of research targeting text classification. Many of them focus on a particular characteristic of text data - multi-labelity. This arises due to the fact that a ...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...