复杂网络社区发现方法总结：
参考文献：
[1] Kernighan B W and Lin S. An efficient heuristic procedure for partitioning graphs [J]. Bell system Technica1 Journal, 1970, 49(2):291一307.
[2] Karypis G and Kumar V. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs [J]. SIAM Journal on Scientific Computing, 1998, 20:359
[3] Flake G W, Lawrence S and Giles C L. Efficient identification of web communities [C]. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, 2000:160.
[4] Flake G W, Lawrence S and Giles C L, et al. Self-organization and identification of web communities [J]. Computer, 2002, 35(3):66-70.
[5] Girvan M and Newman M E J. Community structure in social and biological networks [J] . Proceedings of the National Academy of Sciences of the United States of America, 2002, 99(12):782.
[6] Newman M E J and Girvan M. Finding and evaluating community structure in networks [J]. Physical review E, 2004, 69(2): 26113.
[7] Donath W E and Hoffman A J. Lower bounds for the partitioning of graphs [J]. IBM Journal of Research and Development, 1973, 17(5):420-425.
[8] Pothen A, Simon H D and Liou K. Partitioning sparse matrices with eigenvectors of graphs [J]. SLAM Journal on Metrix Analysis and Applications, 1990, 11(3).
[9] Newman M E J. Fast algorithm for detecting community structure in networks [J]. Physical review E, 2004, 69(6):066133.
[10] Clauset A, Newman M E J and Moore C. Finding community structure in very large networks [J]. Physical Review E, 2004, 70(6):6611.
[11] Bron C and Kerbosch J. Algorithm 457: finding all cliques of an undirected graph [J]. Communications of the ACM, 1973, 16(9):575-577.
[12] Makino K and Uno T. New algorithms for enumerating all maximal cliques [C]. Algorithm Theory-SWAT, 2004:260-272.
[13] Liu G and Wong L. Effective pruning techniques for mining quasi-cliques [C]. Machine Learning and Knowledge Discovery in Databases, 2008:33-49.
[14] Batagel J V and Zaversnik M. An O(m) algorithm for cores decomposition of networks [C]. CoRR (Computing Research Repository), 2003.
[15] Blondel V D, Guillaume J L and Lambiotte R, et al. Fast unfolding of communities in large networks [J]. Journal of Statistical Mechanics : Theory and Experiment, 2008:PI0008.
[16] Bu D, Zhao Y, Cai L, et al. Topological structure analysis of the protein-protein interaction network in budding yeast [J]. Nucleic Acids Research, 2003, 31(9):2443.
[17] Wang N, Parthasarathy S, Tan K L, et al. CSV: visualizing and mining cohesive subgraphs [C]. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, ACM, 2008:445-458.
[18] Charikar M. Greedy approximation algorithms for finding dense components in a graph [C]. Approximation Algorithms for Combinatorial Optimization, 2000:139-152.
[19] Andersen R and Peres Y. Finding Sparse cuts locally using evolving sets [C]. In Proceedings of the 41st annual ACM symposium on Theory of computing, ACM, 2009:235-244.
[20] Andersen R. A Local Algorithm for Finding Dense Sub-graphs [J] . ACM Transactions on Algorithms(TALG), ACM, 2010, 6:1-12.
[21] Clauset A. Finding local community structure in networks [J]. Physical Review E, 2005, 72(2):26132.
[22] Chen J, Zaizne O and Goebel R. Local community identification in social networks [C]. International Conference on Advances in Social Network Analysis and Mining, IEEE, 2009:237-242.
[23] Kirkpatriek S, Gelatt J, et al. Optimization by simulated annealing [J]. Science, 1983, 220(4598):671-679.
[24] 王亮. 基于局部聚类的复杂网络社区发现算法研究[D]. 大连理工大学, 大连, 2011.
0 0
