Sciweavers

1105 search results - page 18 / 221
» Approximate Spectral Clustering.
Sort
View
IWCMC
2010
ACM
14 years 19 days ago
Group detection in mobility traces
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...
SDM
2007
SIAM
122views Data Mining» more  SDM 2007»
13 years 9 months ago
Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, Thoma...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 8 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 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
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
11 years 10 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...