Sciweavers

8776 search results - page 49 / 1756
» Robust Data Clustering
Sort
View
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
14 years 26 days ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
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...
Zhexue Huang
NIPS
2004
13 years 10 months ago
Semi-supervised Learning by Entropy Minimization
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...
Yves Grandvalet, Yoshua Bengio
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 8 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
SIGMOD
1998
ACM
233views Database» more  SIGMOD 1998»
14 years 27 days ago
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopul...
ICML
2004
IEEE
14 years 9 months ago
Boosting margin based distance functions for clustering
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...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall