ABSTRACT
A large number of complex systems in the real world can be abstractly expressed as complex networks. However, the existing network in the real society contains some information of link pattern and there is some correlation between the vertices. Therefore, based on the idea of the correlation analysis between the link pattern of vertices, we propose a community detection algorithm based on correlation analysis of link pattern, named CCP algorithm. The algorithm firstly obtains the link pattern of the vertex, then calculates the correlation coefficient to obtain the correlation among the connection nodes and obtains the must-link and the cannot-link pairwise constraints. Secondly, expands the must-link and the cannot-link according to the transferability of the must-link. Then, according to the expanded cannot-link set cooperation seed node, the skeleton of the community structure is attracted to the must-link. Finally, the nodes that are not classified into the community is divided into corresponding communities by minimum spanning tree, and the final community structure is obtained. In order to verify the performance of the proposed method, experiments are carried out on the actual network data sets and synthetic network data sets. The experimental results show that the proposed algorithm can extract high quality community structures from the network.
- W. W. Zachary, Journal of Anthropological Research 33, 452 (1977).Google ScholarCross Ref
- S. Fortunato and D. Hric, Physics reports 659, 1 (2016).Google ScholarCross Ref
- J. Mcauley and J. Leskovec, Acm Transactions on Knowledge Discovery from Data 8, 1 (2014).Google ScholarDigital Library
- R. Guimerà, S. Mossa, A. Turtschi, L. A. N. Amaral and K. W. Wachter, Proceedings of the National Academy of Sciences of the United States of America 102, 7794 (2005).Google ScholarCross Ref
- D. Freimuth, E. C. Hu, J. D. Lavoie, R. Mraz, E. M. Nahum, P. Pradhan and J. M. Tracey, Server network scalability and tcp offload, in Usenix Technical Conference, 2005.Google Scholar
- J. E. Dowling and G. Wald, Nutrition reviews 39, 135 (1981).Google ScholarCross Ref
- X. Lei, W. Fei, F. X. Wu, A. Zhang and W. Pedrycz, Information Sciences 329, 303 (2016).Google ScholarDigital Library
- Y. Atay, I. Koc, I. Babaoglu and H. Kodaz, Applied Soft Computing 50, 194 (2017).Google ScholarDigital Library
- M. E. Newman, Proceedings of the national academy of sciences 98, 404 (2001).Google Scholar
- N. S. Jones, C. F. Lewis Anna, M. A. Porter and D. M. Charlotte, Bmc Systems Biology 4, p. 100 (2010).Google ScholarCross Ref
- L. X. Harrington, G. P. Way, J. A. Doherty and C. S. Greene, BioRxiv , p. 166207 (2017).Google Scholar
- Y. Pan, D.-H. Li, J.-G. Liu and J.-Z. Liang, Physica A: Statistical Mechanics and its Applications 389, 2849 (2010).Google ScholarCross Ref
- M. E. Newman and M. Girvan, Physical review E 69, p. 026113 (2004).Google ScholarCross Ref
- A. Singh and M. D. Humphries, Sci Rep 5, p. 8828 (2015).Google ScholarCross Ref
- B. W. Kernighan and S. Lin, The Bell system technical journal 49, 291 (1970).Google ScholarCross Ref
- M. Fiedler, Banach Center Publications 25, 57 (1989).Google ScholarCross Ref
- Y. R. Wang, P. J. Bickel , The Annals of Statistics 45, 500 (2017).Google ScholarCross Ref
- M. E. Newman, Proceedings of the national academy of sciences 103, 8577 (2006).Google Scholar
- M. Guerrero, F. G. Montoya, R. Baños, A. Alcayde and C. Gil, Neurocomputing 266, 101 (2017).Google ScholarDigital Library
- A. Said, R. A. Abbasi, O. Maqbool, A. Daud and N. R. Aljohani, Applied Soft Com- puting 63, 59 (2018).Google ScholarDigital Library
- V. D. Blondel, J.-L. Guillaume, R. Lambiotte and E. Lefebvre, Journal of statistical mechanics: theory and experiment 2008, p. P10008 (2008).Google ScholarCross Ref
- S. A. Tabrizi, A. Shakery, M. Asadpour, M. Abbasi and M. A. Tavallaie, Physica A: Statistical Mechanics and its Applications 392, 5772 (2013).Google ScholarCross Ref
- M. Girvan and M. E. Newman, Proceedings of the national academy of sciences 99, 7821 (2002).Google ScholarCross Ref
- M. E. Newman, Phys Rev E Stat Nonlin Soft Matter Phys 69, p. 066133 (2004).Google ScholarCross Ref
- F. D. Zarandi and M. K. Rafsanjani, Physica A: Statistical Mechanics and its Applica- tions 503, 882 (2018).Google ScholarCross Ref
- U. N. Raghavan, R. Albert and S. Kumara, Physical review E 76, p. 036106 (2007).Google ScholarCross Ref
- X. Hu, W. He, H. Li and J. Pan, arXiv preprint arXiv:1601.06307 (2016).Google Scholar
- C. Gui, R. Zhang, Z. Zhao, J. Wei and R. Hu, International Journal of Modern Physics C 29, p. 1850011 (2018).Google ScholarCross Ref
- S. B. Thakare and A. W. Kiwelekar, Skiplpa: An efficient label propagation algorithm for community detection in sparse network, in Proceedings of the 9th Annual ACM India Conference, 2016.Google ScholarDigital Library
- J. H. Chin and K. Ratnavelu, Scientific Reports 7, p. 45836 (2017).Google ScholarCross Ref
- Y. Su, B. Wang and X. Zhang, Scientific reports 7, p. 41830 (2017).Google ScholarCross Ref
- H.-l. Sun, E. Ch'ng, X. Yong, J. M. Garibaldi, S. See and D.-b. Chen, Physica A: Statistical Mechanics and its Applications 496, 108 (2018).Google ScholarCross Ref
- P. Pons and M. Latapy, Computing communities in large networks using random walks, in International symposium on computer and information sciences, 2005.Google ScholarDigital Library
- M. Rosvall and C. T. Bergstrom, Proceedings of the National Academy of Sciences 105, 1118 (2008).Google ScholarCross Ref
- L. Yang, X. Cao, D. He, C. Wang, X. Wang and W. Zhang, Modularity based community detection with deep learning., in IJCAI, 2016.Google Scholar
- L. Yang, D. Jin, D. He, H. Fu, X. Cao and F. Fogelman-Soulie, Scientific reports 7, p. 634 (2017).Google Scholar
- L. Duan, Y. Liu, W. N. Street and H. Lu, Expert Systems with Applications 84, 74 (2017).Google ScholarDigital Library
- X. Ma, L. Gao, X. Yong and L. Fu, Physica A Statistical Mechanics & Its Applications 389, 187 (2010).Google ScholarCross Ref
- Z.-Y. Zhang, EPL (europhysics letters) 101, p. 48005 (2013).Google Scholar
- X. Xu, N. Yuruk, Z. Feng and T. A. Schweiger, Scan: a structural clustering algorithm for networks, in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, 2007.Google ScholarDigital Library
- K. Pearson, Notes on regression and inheritance in the case of two parents proceedings of the royal society of london, 58, 240-242 (1895).Google Scholar
- J. Doyle and R. L. Rivest, Inf. Process. Lett. 5, 146 (1976).Google ScholarCross Ref
- R. L. Graham and P. Hell, Annals of the History of Computing 7, 43 (1985).Google ScholarDigital Library
- M. Alamgir and U. Von Luxburg, arXiv preprint arXiv:1206.6381 (2012).Google Scholar
- T. You, H. M. Cheng, Y. Z. Ning, B. C. Shia and Z. Y. Zhang, Physica A Statistical Mechanics & Its Applications 464, 221 (2016).Google ScholarCross Ref
- J. Shao, Z. Han, Q. Yang and T. Zhou, Community detection based on distance dynamics, in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015.Google ScholarDigital Library
- L. Ana and A. K. Jain, Robust data clustering, in Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on, 2003.Google ScholarCross Ref
- W. W. Zachary, Journal of anthropological research 33, 452 (1977).Google Scholar
- D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten and S. M. Dawson, Behavioral Ecology and Sociobiology 54, 396 (2003).Google ScholarCross Ref
- K. Steinhaeuser and N. V. Chawla, Pattern Recognition Letters 31, 413 (2010).Google ScholarDigital Library
- M. E. Newman, Physical review E 64, p. 016131 (2001).Google Scholar
- D. E. Knuth, The Stanford GraphBase: a platform for combinatorial computing (AcM Press New York, 1993).Google Scholar
- P. M. Gleiser and L. Danon, Advances in complex systems 6, 565 (2003).Google ScholarCross Ref
- H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai and A.-L. Barabási, Nature 407, p. 651 (2000).Google ScholarCross Ref
- J. Leskovec, K. J. Lang, A. Dasgupta and M. W. Mahoney, Internet Mathematics 6, 29 (2009).Google ScholarCross Ref
- A. Lancichinetti, S. Fortunato and F. Radicchi, Physical review E 78, p. 046110 (2008).Google ScholarCross Ref
Recommendations
Uncovering community structure in social networks by clique correlation
MDAI'11: Proceedings of the 8th international conference on Modeling decisions for artificial intelligenceCommunity is tightly-connected group of agents in social networks and the discovery of such subgraphs has aroused considerable research interest in the past few years. Typically, a quantity function called modularity is used to guide the division of the ...
Utilizing advances in correlation analysis for community structure detection
Build the connection between correlation analysis and community detection.A framework of utilizing correlation analysis to advance community detection.A novel graphic analysis for selecting methods.Solve the resolution problem through the proposed ...
Using Spearman's correlation coefficients for exploratory data analysis on big dataset
Correlation analysis is both popular and useful in a number of social networking research, particularly in the exploratory data analysis. In this paper, three well-known and often-used correlation coefficients, Pearson product-moment correlation ...
Comments