Sciweavers

27 search results - page 1 / 6
» Information Theoretic Angle-Based Spectral Clustering: A The...
Sort
View
IJCNN
2006
IEEE
13 years 10 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
FOCS
2000
IEEE
13 years 9 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
ICPR
2008
IEEE
14 years 5 months ago
Multiclass spectral clustering based on discriminant analysis
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
Xi Li, Zhongfei Zhang, Yanguo Wang, Weiming Hu
AIPRF
2008
13 years 6 months ago
A Coherent and Heterogeneous Approach to Clustering
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...
Arian Maleki, Nima Asgharbeygi
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 5 months ago
Fast 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-s...
Donghui Yan, Ling Huang, Michael I. Jordan