暂无分享,去创建一个
[1] Yun Chi,et al. Combining link and content for community detection: a discriminative approach , 2009, KDD.
[2] Thomas Seidl,et al. DB-CSC: A Density-Based Approach for Subspace Clustering in Graphs with Feature Vectors , 2011, ECML/PKDD.
[3] Edward A. Fox,et al. Combination of Multiple Searches , 1993, TREC.
[4] Michael William Newman,et al. The Laplacian spectrum of graphs , 2001 .
[5] Tanya Y. Berger-Wolf,et al. Sampling community structure , 2010, WWW '10.
[6] Philip S. Yu,et al. Outlier detection in graph streams , 2011, 2011 IEEE 27th International Conference on Data Engineering.
[7] David A. Cohn,et al. The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity , 2000, NIPS.
[8] Wei Tang,et al. Clustering with Multiple Graphs , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[9] Ramesh Nallapati,et al. Joint latent topic models for text and citations , 2008, KDD.
[10] W. Marsden. I and J , 2012 .
[11] J. Lafferty,et al. Mixed-membership models of scientific publications , 2004, Proceedings of the National Academy of Sciences of the United States of America.
[12] Mark Steyvers,et al. Finding scientific topics , 2004, Proceedings of the National Academy of Sciences of the United States of America.
[13] David R. Karger,et al. Random sampling in cut, flow, and network design problems , 1994, STOC '94.
[14] Rong Ge,et al. Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center Problem , 2006, SDM.
[15] Jure Leskovec,et al. Empirical comparison of algorithms for network community detection , 2010, WWW '10.
[16] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[17] Inderjit S. Dhillon,et al. Kernel k-means: spectral clustering and normalized cuts , 2004, KDD.
[18] Hongyuan Zha,et al. Probabilistic models for discovering e-communities , 2006, WWW '06.
[19] Alan M. Frieze,et al. Min-wise independent permutations (extended abstract) , 1998, STOC '98.
[20] Daniel Hanisch,et al. Co-clustering of biological networks and gene expression data , 2002, ISMB.
[21] Yihong Gong,et al. Combining content and link for classification using matrix factorization , 2007, SIGIR.
[22] Jignesh M. Patel,et al. Efficient aggregation for graph summarization , 2008, SIGMOD Conference.
[23] David R. Karger,et al. Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..
[24] B. Mohar. THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .
[25] Joydeep Ghosh,et al. Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..
[26] Alan M. Frieze,et al. Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..
[27] Srinivasan Parthasarathy,et al. Scalable graph clustering using stochastic flows: applications to community discovery , 2009, KDD.
[28] S. Dongen. Graph clustering by flow simulation , 2000 .
[29] Javed A. Aslam,et al. Relevance score normalization for metasearch , 2001, CIKM '01.
[30] Hong Cheng,et al. Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.
[31] Michael I. Jordan,et al. Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..
[32] Srinivasan Parthasarathy,et al. Local graph sparsification for scalable clustering , 2011, SIGMOD '11.
[33] Ron Shamir,et al. Identification of functional modules using network topology and high-throughput data , 2007, BMC Systems Biology.
[34] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.
[35] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.