Sciweavers

268 search results - page 3 / 54
» Learning Pairwise Similarity for Data Clustering
Sort
View
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
BMVC
2001
13 years 9 months ago
An EM-like Algorithm for Motion Segmentation via Eigendecomposition
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...
Antonio Robles-Kelly, Edwin R. Hancock
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
13 years 8 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
14 years 7 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
ICML
2005
IEEE
14 years 8 months ago
Multi-way distributional clustering via pairwise interactions
We present a novel unsupervised learning scheme that simultaneously clusters variables of several types (e.g., documents, words and authors) based on pairwise interactions between...
Ron Bekkerman, Ran El-Yaniv, Andrew McCallum