Sciweavers

90 search results - page 7 / 18
» Spectral Clustering by Recursive Partitioning
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 7 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICCV
2003
IEEE
14 years 9 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
CVPR
2006
IEEE
14 years 9 months ago
Spectral Methods for Automatic Multiscale Data Clustering
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
Arik Azran, Zoubin Ghahramani
ICPR
2010
IEEE
13 years 10 months ago
Multiple Atlas Inference and Population Analysis with Spectral Clustering
In medical imaging, constructing an atlas and bringing an image set in a single common reference frame may easily lead the analysis to erroneous conclusions, especially when the po...
Giorgos Sfikas, Christian Heinrich, Christophoros ...
NIPS
2001
13 years 8 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...