Sciweavers

767 search results - page 59 / 154
» On Clustering Using Random Walks
Sort
View
RSFDGRC
2005
Springer
100views Data Mining» more  RSFDGRC 2005»
14 years 2 months ago
A Hybrid Approach to MR Imaging Segmentation Using Unsupervised Clustering and Approximate Reducts
Abstract. We introduce a hybrid approach to magnetic resonance image segmentation using unsupervised clustering and the rules derived from approximate decision reducts. We utilize ...
Sebastian Widz, Kenneth Revett, Dominik Slezak
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 9 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
MCS
2007
Springer
14 years 2 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
NIPS
2003
13 years 10 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 6 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy