8776 search results - page 49 / 1756 » Robust Data Clustering |
173
click to vote
DMKD
1997
ACM
15 years 7 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
109
click to vote
NIPS
2004
15 years 4 months ago
2004
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
129
click to vote
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
141
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...