5096 search results - page 116 / 1020 » Landscape of Clustering Algorithms |
210
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 9 months 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...
149
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
240
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
143
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
161
click to vote
APWEB
2004
Springer
15 years 10 months ago
2004
Springer
Today, search engine is the most commonly used tool for Web information retrieval, however, its current status is still far from satisfaction. This paper focuses on clustering Web...