Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2018, Article ID 2942054, 12 pages
https://doi.org/10.1155/2018/2942054
Research Article

An Autonomous Divisive Algorithm for Community Detection Based on Weak Link and Link-Break Strategy

College of Computer Science and Technology, Harbin Engineering University, Heilongjiang 150001, China

Correspondence should be addressed to Jianpei Zhang; nc.ude.uebrh@iepnaijgnahz

Received 4 June 2017; Accepted 14 December 2017; Published 15 January 2018

Academic Editor: Sebastian Anita

Copyright © 2018 Xiaoyu Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3-5, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Xie, S. Kelley, and B. K. Szymanski, “Overlapping community detection in networks: the state-of-the-art and comparative study,” ACM Computing Surveys, vol. 45, no. 4, Article ID 2501657, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. W. Liu, M. Pellegrini, and X. Wang, “Detecting communities based on network topology,” Scientific Reports, vol. 4, article no. 5739, 2014. View at Publisher · View at Google Scholar · View at Scopus
  4. X. Qi, W. Tang, Y. Wu, G. Guo, E. Fuller, and C. Zhang, “Optimal local community detection in social networks based on density drop of subgraphs,” Pattern Recognition Letters, vol. 36, pp. 46–53, 2014. View at Publisher · View at Google Scholar
  5. D. Rafailidis, E. Constantinou, and Y. Manolopoulos, “Landmark selection for spectral clustering based on Weighted PageRank,” Future Generation Computer Systems, vol. 68, pp. 465–472, 2017. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Mahmood, M. Small, S. A. Al-Maadeed, and N. Rajpoot, “Using geodesic space density gradients for network community detection,” IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 4, pp. 921–935, 2017. View at Publisher · View at Google Scholar · View at Scopus
  7. X. Bai, P. Yang, and X. Shi, “An overlapping community detection algorithm based on density peaks,” Neurocomputing, vol. 226, pp. 7–15, 2017. View at Publisher · View at Google Scholar · View at Scopus
  8. H. Zhou, “Distance, dissimilarity index, and network community structure,” Physical review. E, Statistical, Nonlinear, And Soft Matter Physics, vol. 67, no. 6, Article ID 061901, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Paris, “Defining and identifying communities in networks,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 101, no. 9, pp. 2658–2663, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 2, Article ID 026113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. Yang, P. G. Sun, X. Hu, and Z. J. Li, “Closed walks for community detection,” Physica A: Statistical Mechanics and its Applications, vol. 397, no. 37, pp. 129–143, 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. J. Q. Jiang, A. W. M. Dress, and G. Yang, “A spectral clustering-based framework for detecting community structures in complex networks,” Applied Mathematics Letters, vol. 22, no. 9, pp. 1479–1482, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. L. Huang, R. Li, H. Chen, X. Gu, K. Wen, and Y. Li, “Detecting network communities using regularized spectral clustering algorithm,” Artificial Intelligence Review, vol. 41, no. 4, pp. 579–594, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. L. Bai, X. Cheng, J. Liang, and Y. Guo, “Fast graph clustering with a new description model for community detection,” Information Sciences, vol. 388-389, pp. 37–47, 2017. View at Publisher · View at Google Scholar · View at Scopus
  15. Z. Bu, G. Gao, H.-J. Li, and J. Cao, “CAMAS: A cluster-aware multiagent system for attributed graph clustering,” Information Fusion, vol. 37, pp. 10–21, 2017. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Clauset, M. E. J. Newman, and C. Moore, “Finding community structure in very large networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 70, no. 6, Article ID 066111, 2004. View at Publisher · View at Google Scholar · View at Scopus
  17. V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, Article ID P10008, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. J. Mei, S. He, G. Shi, Z. Wang, and W. Li, “Revealing network communities through modularity maximization by a contraction-dilation method,” New Journal of Physics , vol. 11, Article ID 043025, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. J. Xiang, T. Hu, Y. Zhang et al., “Local modularity for community detection in complex networks,” Physica A: Statistical Mechanics and its Applications, vol. 443, pp. 451–459, 2015. View at Publisher · View at Google Scholar · View at Scopus
  20. D. Gómez, J. T. Rodríguez, J. Yáñez, and J. Montero, “A new modularity measure for fuzzy community detection problems based on overlap and grouping functions,” International Journal of Approximate Reasoning, vol. 74, pp. 88–107, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  21. U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 76, no. 3, Article ID 036106, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. S. Gregory, “Finding overlapping communities in networks by label propagation,” New Journal of Physics , vol. 12, Article ID 103018, 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. H. Sun, J. Liu, J. Huang et al., “CenLP: A centrality-based label propagation algorithm for community detection in networks,” Physica A: Statistical Mechanics and its Applications, vol. 436, pp. 767–780, 2015. View at Publisher · View at Google Scholar · View at Scopus
  24. R. Francisquini, V. Rosset, and M. C. V. Nascimento, “GA-LP: A genetic algorithm based on Label Propagation to detect communities in directed networks,” Expert Systems with Applications, vol. 74, pp. 127–138, 2017. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. M. E. Newman, “Mixing patterns in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 67, no. 2, Article ID 026126, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  27. M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 6, Article ID 066133, 2004. View at Publisher · View at Google Scholar · View at Scopus
  28. S. Fortunato, V. Latora, and M. Marchiori, “Method to find community structures based on information centrality,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 70, no. 5, Article ID 056104, 2004. View at Publisher · View at Google Scholar · View at Scopus
  29. N. A. Christakis and J. H. Fowler, “Social contagion theory: examining dynamic social networks and human behavior,” Statistics in Medicine, vol. 32, no. 4, pp. 556–577, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. T. S. Evans and R. Lambiotte, “Line graphs, link partitions, and overlapping communities,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 80, no. 1, Article ID 016105, pp. 145–148, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. Y. Y. Ahn, J. P. Bagrow, and S. Lehmann, “Link communities reveal multiscale complexity in networks,” Nature, vol. 466, no. 7307, pp. 761–764, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. J. Cheng, M. Leng, L. Li, H. Zhou, and X. Chen, “Active semi-supervised community detection based on must-link and cannot-link constraints,” PLoS ONE, vol. 9, no. 10, Article ID e110088, 2014. View at Publisher · View at Google Scholar · View at Scopus
  33. D. Deritei, Z. I. Lázár, I. Papp et al., “Community detection by graph Voronoi diagrams,” New Journal of Physics , vol. 16, Article ID 063007, 2014. View at Publisher · View at Google Scholar · View at Scopus
  34. Y. Chen, X. L. Wang, B. Yuan, and B. Z. Tang, “Overlapping community detection in networks with positive and negative links,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2014, no. 3, Article ID P03021, 2014. View at Publisher · View at Google Scholar · View at Scopus
  35. Y. Xu, H. Xu, and D. Zhang, “A novel disjoint community detection algorithm for social networks based on backbone degree and expansion,” Expert Systems with Applications, vol. 42, no. 21, pp. 8349–8360, 2015. View at Publisher · View at Google Scholar · View at Scopus
  36. L. Liu, W. L. Zuo, and T. Peng, “Detecting outlier pairs in complex network based on link structure and semantic relationship,” Expert Systems with Applications, vol. 69, pp. 40–49, 2017. View at Publisher · View at Google Scholar · View at Scopus
  37. H. Zhuge and J. Zhang, “Topological centrality and its e-Science applications,” Journal of the Association for Information Science and Technology, vol. 61, no. 9, pp. 1824–1841, 2010. View at Publisher · View at Google Scholar
  38. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas, “Comparing community structure identification,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2005, Article ID P09008, 2005. View at Publisher · View at Google Scholar · View at Scopus
  39. A. Lancichinetti, S. Fortunato, and F. Radicchi, “Benchmark graphs for testing community detection algorithms,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 78, no. 4, Article ID 046110, 2008. View at Publisher · View at Google Scholar · View at Scopus
  40. W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977. View at Publisher · View at Google Scholar
  41. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, “The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait?” Behavioral Ecology and Sociobiology, vol. 54, no. 4, pp. 396–405, 2003. View at Publisher · View at Google Scholar · View at Scopus
  42. V. Krebs, Social network of political books, 2004, http://www.visualcomplexity.com.