10 search results - page 1 / 2 » Pairwise Constrained Clustering for Sparse and High Dimensio... |
126
Voted
PAKDD
2009
ACM
15 years 10 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
167
Voted
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
110
Voted
TMM
2008
15 years 3 months ago
2008
Story clustering is a critical step for news retrieval, topic mining, and summarization. Nonetheless, the task remains highly challenging owing to the fact that news topics exhibit...
132
Voted
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
142
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...