Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 627581, 13 pages
http://dx.doi.org/10.1155/2014/627581
Research Article

A Node Influence Based Label Propagation Algorithm for Community Detection in Networks

School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu 221116, China

Received 17 January 2014; Revised 25 April 2014; Accepted 13 May 2014; Published 4 June 2014

Academic Editor: Bo Yang

Copyright © 2014 Yan Xing 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. B. Yang, D. Y. Liu, J. Liu, D. Jin, and H. B. Ma, “Complex network clustering algorithms,” Journal of Software, vol. 20, no. 1, pp. 54–66, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, Article ID 026113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. U. Brandes, D. Delling, M. Gaertler et al., “On modularity clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 2, pp. 172–188, 2008. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. Bu, C. Zhang, Z. Xia, and J. Wang, “A fast parallel modularity optimization algorithm (FPMQA) for community detection in online social network,” Knowledge-Based Systems, vol. 50, pp. 246–259, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Q. Zhang and H. Y. Zhao, “Normalized modularity optimization method for community identification with degree adjustment,” Physical Review E, vol. 88, no. 5, Article ID 052802, 2013. View at Google Scholar
  6. M. Shiga, I. Takigawa, and H. Mamitsuka, “A spectral clustering approach to optimally combining numericalvectors with a modular network,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 647–656, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. S. Hua-Wei and C. Xue-Qi, “Spectral methods for the detection of network community structure: a comparative analysis,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2010, no. 10, Article ID P10020, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Huang, R. Li, H. Chen, X. Gu, K. Wen, and Y. Li, “Detecting network communities using regularized spectral clustering algorithm,” Artificial Intelligence Review, pp. 1–16, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. L. Šubelj and M. Bajec, “Unfolding communities in large complex networks: combining defensive and offensive label propagation for core extraction,” Physical Review E, vol. 83, no. 3, Article ID 036103, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. V. D. Blondel, J. L. 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
  11. U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Physical Review E, vol. 76, no. 3, Article ID 036106, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. S. Gregory, “Finding overlapping communities in networks by label propagation,” New Journal of Physics, vol. 12, no. 10, Article ID 103018, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Rosvall and C. T. Bergstrom, “Maps of random walks on complex networks reveal community structure,” Proceedings of the National Academy of Sciences of the United States of America, vol. 105, no. 4, pp. 1118–1123, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Lou, S. Li, and Y. Zhao, “Detecting community structure using label propagation with weighted coherent neighborhood propinquity,” Physica A: Statistical Mechanics and Its Applications, vol. 392, no. 14, pp. 3095–3105, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. J. R. Xie and B. K. Szymanski, “LabelRank: a stabilized label propagation algorithm for community detection in networks,” in Proceedings of the IEEE Network Science Workshop, pp. 138–143, 2013.
  16. J. Ugander and L. Backstrom, “Balanced label propagation for partitioning massive graphs,” in Proceedings of the 6th ACM International Conference on Web Search and Data Mining, pp. 507–516, February 2013. View at Publisher · View at Google Scholar · View at Scopus
  17. J. R. Xie, B. K. Szymanski, and X. M. Liu, “SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process,” in Proceedings of the 11th IEEE International Conference on Data Mining Workshops, pp. 344–349, December 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. http://www-personal.umich.edu/~mejn/netdata/.
  19. http://www.cs.bris.ac.uk/~steve/networks/copra/.
  20. M. E. J. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E, vol. 74, no. 3, Article ID 036104, 2006. View at Publisher · View at Google Scholar · View at Scopus
  21. J. Sohn, D. Kang, H. Park et al., “An improved social network analysis method for social networks,” in Advanced Technologies, Embedded and Multimedia for Human-Centric Computing, Lecture Notes in Electrical Engineering, pp. 115–123, Springer, Amsterdam, The Netherlands, 2014. View at Google Scholar
  22. L. Šubelj and M. Bajec, “Group detection in complex networks: an algorithm and comparison of the state of the art,” Physica A: Statistical Mechanics and Its Applications, vol. 397, pp. 144–156, 2014. View at Google Scholar
  23. O. Green and D. A. Bader, “Faster betweenness centrality based on data structure experimentation,” Procedia Computer Science, vol. 18, pp. 399–408, 2013. View at Google Scholar
  24. M. Kitsak, L. K. Gallos, S. Havlin et al., “Identification of influential spreaders in complex networks,” Nature Physics, vol. 6, no. 11, pp. 888–893, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. L. Šubelj and M. Bajec, “Robust network community detection using balanced propagation,” European Physical Journal B, vol. 81, no. 3, pp. 353–362, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. S. Fortunato and M. Barthélem, “Resolution limit in community detection,” Proceedings of the National Academy of Sciences of the United States of America, pp. 36–41, 2007. View at Google Scholar
  27. A. Lancichinetti, S. Fortunato, and F. Radicchi, “Benchmark graphs for testing community detection algorithms,” Physical Review E, vol. 78, no. 4, Article ID 046110, 2008. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Lancichinetti and S. Fortunato, “Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities,” Physical Review E, vol. 80, no. 1, Article ID 016118, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Zhu, F. Meng, and Y. Zhou, “Semisupervised clustering for networks based on fast affinity propagation,” Mathematical Problems in Engineering, vol. 2013, Article ID 385265, 13 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  30. P. G. Sun, “Weighting links based on edge centrality for community detection,” Physica A: Statistical Mechanics and Its Applications, vol. 394, pp. 346–357, 2014. View at Google Scholar