Sciweavers

897 search results - page 14 / 180
» Correlational spectral clustering
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 11 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
100
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Blind audiovisual separation based on redundant representations
In this work we present a method to perform a complete audiovisual source separation without need of previous information. This method is based on the assumption that sounds are c...
Anna Llagostera Casanovas, Gianluca Monaci, Pierre...
ICML
2006
IEEE
15 years 10 months ago
Spectral clustering for multi-type relational data
Clustering on multi-type relational data has attracted more and more attention in recent years due to its high impact on various important applications, such as Web mining, e-comm...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
56
Voted
KDD
2007
ACM
158views Data Mining» more  KDD 2007»
15 years 10 months ago
Evolutionary spectral clustering by incorporating temporal smoothness
Yun Chi, Xiaodan Song, Dengyong Zhou, Koji Hino, B...
COLT
2004
Springer
15 years 3 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...