I-Louvain: An Attributed Graph Clustering Method
暂无分享,去创建一个
Mathias Géry | Elöd Egyed-Zsigmond | Christine Largeron | David Combe | David Combe | M. Géry | Elöd Egyed-Zsigmond | C. Largeron
[1] Nitesh V. Chawla,et al. Community Detection in a Large Real-World Social Network , 2008 .
[2] Jure Leskovec,et al. Community Detection in Networks with Node Attributes , 2013, 2013 IEEE 13th International Conference on Data Mining.
[3] Rong Ge,et al. Joint cluster analysis of attribute data and relationship data , 2008, ACM Trans. Knowl. Discov. Data.
[4] Hong Cheng,et al. Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.
[5] Rong Ge,et al. Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center Problem , 2006, SDM.
[6] Bruce Hendrickson. Graph Partitioning , 2011, Encyclopedia of Parallel Computing.
[7] Nicole Immorlica,et al. Joint Cluster Analysis of Attribute Data and Relationship Data , 2008 .
[8] M Cieplak. 蛋白質の折りたたみにおける協調性と接触秩序 | 文献情報 | J-GLOBAL 科学技術総合リンクセンター , 2004 .
[9] Alex Arenas,et al. Analysis of the structure of complex networks at different resolution levels , 2007, physics/0703218.
[10] Charles-Edmond Bichot,et al. Graph Partitioning: Bichot/Graph Partitioning , 2013 .
[11] Mathias Géry,et al. Combining Relations and Text in Scientific Network Clustering , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.
[12] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[13] Joydeep Ghosh,et al. Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..
[14] Marc Plantevit,et al. Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors , 2013, IEEE Transactions on Knowledge and Data Engineering.
[15] Andrea Lancichinetti,et al. Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.
[16] Chris H. Q. Ding,et al. A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[17] Hong Cheng,et al. Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..
[18] Rong Ge,et al. Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters , 2007, KDD '07.
[19] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[20] Mark Newman,et al. Detecting community structure in networks , 2004 .
[21] G K Gilbert,et al. THE ORIGIN OF HYPOTHESES, ILLUSTRATED BY THE DISCUSSION OF A TOPOGRAPHIC PROBLEM. , 1896, Science.
[22] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[23] Ulrike von Luxburg,et al. A tutorial on spectral clustering , 2007, Stat. Comput..
[24] Ji-Rong Wen,et al. Scalable community discovery on textual data with relations , 2008, CIKM '08.
[25] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[26] David Combe,et al. Détection de communautés dans les réseaux d'information utilisant liens et attributs. (Community detection in information networks using links and attributes) , 2013 .
[27] R. Lambiotte,et al. Multilevel Local Optimization of Modularity , 2013 .
[28] Emmanuel Viennet,et al. Community Detection based on Structural and Attribute Similarities , 2012, ICDS 2012.
[29] Srinivasan Parthasarathy,et al. Scalable graph clustering using stochastic flows: applications to community discovery , 2009, KDD.
[30] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[31] Thomas Seidl,et al. DB-CSC: A Density-Based Approach for Subspace Clustering in Graphs with Feature Vectors , 2011, ECML/PKDD.
[32] J. Reichardt,et al. Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[33] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[34] Haithum Elhadi,et al. Structure and attributes community detection: comparative analysis of composite, ensemble and selection methods , 2013, SNAKDD '13.
[35] Jean-Loup Guillaume,et al. Fast unfolding of community hierarchies in large networks , 2008, ArXiv.
[36] Robert E. Tarjan,et al. Graph Clustering and Minimum Cut Trees , 2004, Internet Math..
[37] Thomas Seidl,et al. Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms , 2010, 2010 IEEE International Conference on Data Mining.
[38] François Poulet,et al. Entropy based community detection in augmented social networks , 2011, 2011 International Conference on Computational Aspects of Social Networks (CASoN).
[39] Satu Elisa Schaeffer,et al. Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.
[40] Martine Collard,et al. From Frequent Features to Frequent Social Links , 2013, Int. J. Inf. Syst. Model. Des..
[41] Charu C. Aggarwal,et al. Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.