Sciweavers

80 search results - page 2 / 16
» Spectral clustering based on matrix perturbation theory
Sort
View
JISE
2010
52views more  JISE 2010»
12 years 11 months ago
A Novel Spectral Clustering Method Based on Pairwise Distance Matrix
Chi-Fang Chin, Arthur Chun-Chieh Shih, Kuo-Chin Fa...
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 5 months ago
Exploring the community structure of newsgroups
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
Christian Borgs, Jennifer T. Chayes, Mohammad Mahd...
NIPS
2004
13 years 6 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
JMLR
2006
108views more  JMLR 2006»
13 years 4 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan
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