Sciweavers

333 search results - page 14 / 67
» B-Matching for Spectral Clustering
Sort
View
ICDM
2009
IEEE
171views Data Mining» more  ICDM 2009»
13 years 5 months ago
Hybrid Clustering by Integrating Text and Citation Based Graphs in Journal Database Analysis
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...
Xinhai Liu, Shi Yu, Yves Moreau, Frizo A. L. Janss...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 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
ICML
2006
IEEE
14 years 8 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...
KDD
2007
ACM
158views Data Mining» more  KDD 2007»
14 years 8 months ago
Evolutionary spectral clustering by incorporating temporal smoothness
Yun Chi, Xiaodan Song, Dengyong Zhou, Koji Hino, B...
COLT
2004
Springer
14 years 27 days 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...