Sciweavers

234 search results - page 3 / 47
» Spectral Clustering with Perturbed Data
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
LKR
2008
13 years 6 months ago
Identification of MCMC Samples for Clustering
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...
Kenichi Kurihara, Tsuyoshi Murata, Taisuke Sato
DIS
2005
Springer
13 years 10 months ago
Active Constrained Clustering by Examining Spectral Eigenvectors
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...
Qianjun Xu, Marie desJardins, Kiri Wagstaff
ICML
2007
IEEE
14 years 5 months ago
A dependence maximization view of clustering
We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Inde...
Le Song, Alexander J. Smola, Arthur Gretton, Karst...
CVPR
2008
IEEE
14 years 6 months ago
Correlational spectral clustering
We present a new method for spectral clustering with paired data based on kernel canonical correlation analysis, called correlational spectral clustering. Paired data are common i...
Matthew B. Blaschko, Christoph H. Lampert