Bipartite graph partitioning and data clustering
暂无分享,去创建一个
Chris H. Q. Ding | Hongyuan Zha | Xiaofeng He | Horst D. Simon | Ming Gu | C. Ding | Xiaofeng He | H. Simon | H. Zha | Ming Gu
[1] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[2] Brian Everitt,et al. Cluster analysis , 1974 .
[3] Gene H. Golub,et al. Matrix computations , 1983 .
[4] M. Greenacre. Correspondence analysis in practice , 1993 .
[5] A. D. Gordon,et al. Correspondence Analysis Handbook. , 1993 .
[6] Dirk Roose,et al. An Improved Spectral Bisection Algorithm and its Application to Dynamic Load Balancing , 1995, EUROSIM International Conference.
[7] William N. Venables,et al. Modern Applied Statistics with S-Plus. , 1996 .
[8] Fan Chung,et al. Spectral Graph Theory , 1996 .
[9] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[10] Thomas Hofmann,et al. Probabilistic latent semantic indexing , 1999, SIGIR '99.
[11] Naftali Tishby,et al. Document clustering using word clusters via the information bottleneck method , 2000, SIGIR '00.
[12] Tamara G. Kolda,et al. Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing , 1999, SIAM J. Sci. Comput..
[13] Michael Heine,et al. Finding Out About: A Cognitive Perspective on Search Engine Technology and the WWW , 2002, J. Documentation.