Node similarity and modularity for finding communities in networks
暂无分享,去创建一个
[1] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[2] Shengrui Wang,et al. Discovering Knowledge-Sharing Communities in Question-Answering Forums , 2010, TKDD.
[3] M E J Newman,et al. Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[4] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[5] Konstantin Avrachenkov,et al. Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.
[6] Boleslaw K. Szymanski,et al. Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.
[7] Jean-Charles Delvenne,et al. The many facets of community detection in complex networks , 2016, Applied Network Science.
[8] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[9] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] Linyuan Lü,et al. Predicting missing links via local information , 2009, 0901.0553.
[11] Martin Rosvall,et al. Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.
[12] A. Barabasi,et al. Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.
[13] P. Jaccard,et al. Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .
[14] D. Lusseau,et al. The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.
[15] Réka Albert,et al. Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[16] Massimo Marchiori,et al. Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[17] Hua Xu,et al. A novel disjoint community detection algorithm for social networks based on backbone degree and expansion , 2015, Expert Syst. Appl..
[18] Claudio M. Rocco Sanseverino,et al. Robustness in network community detection under links weights uncertainties , 2016, Reliab. Eng. Syst. Saf..
[19] Linyuan Lu,et al. Link Prediction in Complex Networks: A Survey , 2010, ArXiv.
[20] Abdelouahab Moussaoui,et al. Community detection in networks based on minimum spanning tree and modularity , 2016 .
[21] Leon Danon,et al. Comparing community structure identification , 2005, cond-mat/0505245.
[22] R. Guimerà,et al. Functional cartography of complex metabolic networks , 2005, Nature.
[23] Michel Crampes,et al. Survey on Social Community Detection , 2013, Social Media Retrieval.
[24] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[25] Santo Fortunato,et al. Community detection in networks: A user guide , 2016, ArXiv.
[26] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[27] F. Radicchi,et al. Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[28] Claudio Castellano,et al. Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[29] M. A. Muñoz,et al. Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .
[30] Hicham Lakhlef. A multi-level clustering scheme based on cliques and clusters for wireless sensor networks , 2015, Comput. Electr. Eng..
[31] Lada A. Adamic,et al. Friends and neighbors on the Web , 2003, Soc. Networks.
[32] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[33] Matthieu Latapy,et al. Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..