Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 3790590, 15 pages
http://dx.doi.org/10.1155/2016/3790590
Research Article

A Neighborhood-Impact Based Community Detection Algorithm via Discrete PSO

Aeronautics and Astronautics Engineering College, Air Force Engineering University, Xi’an 710038, China

Received 30 August 2015; Revised 6 December 2015; Accepted 31 December 2015

Academic Editor: Daniel Aloise

Copyright © 2016 Dongqing Zhou and Xing Wang. 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. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, “Natural communities in large linked networks,” in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 541–546, ACM, Washington, DC, USA, August 2003.
  2. M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of the Internet topology,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM ’99), pp. 251–262, ACM, Cambridge, Mass, USA, August-September 1999. View at Publisher · View at Google Scholar
  3. S. Lozano, J. Duch, and A. Arenas, “Analysis of large social datasets by community detection,” The European Physical Journal Special Topics, vol. 143, no. 1, pp. 257–259, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy 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
  5. C. A. Hidalgo, B. Winger, A.-L. Barabási, and R. Hausmann, “The product space conditions the development of nations,” Science, vol. 317, no. 5837, pp. 482–487, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Chen, K. Kuzmin, and B. K. Szymanski, “Community detection via maximization of modularity and its variants,” IEEE Transactions on Computational Social Systems, vol. 1, no. 1, pp. 46–65, 2014. View at Publisher · View at Google Scholar
  7. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. U. Elsner, “Graph partitioning—a survey,” in Encyclopedia of Parallel Computing, pp. 805–808, Springer US, 1997. View at Google Scholar
  9. 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, 5 pages, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Clauset, M. E. J. Newman, and C. Moore, “Finding community structure in very large networks,” Physical Review E, vol. 70, no. 6, Article ID 066111, 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Guimerà and L. A. N. Amaral, “Functional cartography of complex metabolic networks,” Nature, vol. 433, no. 7028, pp. 895–900, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 72, no. 2, Article ID 027104, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. M. E. J. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577–8582, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. C. Pizzuti, “GA-Net: a genetic algorithm for community detection in social networks,” in Parallel Problem Solving from Nature—PPSN X, pp. 1081–1090, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  15. C. Pizzuti, “A multiobjective genetic algorithm to find communities in complex networks,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 3, pp. 418–430, 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Arenas and A. Díaz-Guilera, “Synchronization and modularity in complex networks,” The European Physical Journal: Special Topics, vol. 143, no. 1, pp. 19–25, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. S. Fortunato and M. Barthélemy, “Resolution limit in community detection,” Proceedings of the National Academy of Sciences of the United States of America, vol. 104, no. 1, pp. 36–41, 2007. View at Publisher · View at Google Scholar
  18. Z. Li, S. Zhang, R.-S. Wang, X.-S. Zhang, and L. Chen, “Quantitative function for community detection,” Physical Review E, vol. 77, no. 3, Article ID 036109, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS ’95), vol. 1, pp. 39–43, Nagoya, Japan, October 1995. View at Publisher · View at Google Scholar
  20. C. A. Coello Coello, G. T. Pulido, and M. S. Lechuga, “Handling multiple objectives with particle swarm optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 256–279, 2004. View at Publisher · View at Google Scholar · View at Scopus
  21. L. C. Cagnina, S. C. Esquivel, and C. A. C. Coello, “A fast particle swarm algorithm for solving smooth and non-smooth economic dispatch problems,” Engineering Optimization, vol. 43, no. 5, pp. 485–505, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. Z. Zhu, J. Zhou, Z. Ji, and Y.-H. Shi, “DNA sequence compression using adaptive particle swarm optimization-based memetic algorithm,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 5, pp. 643–658, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108, Orlando, Fla, USA, October 1997. View at Publisher · View at Google Scholar
  24. W.-N. Chen, J. Zhang, H. S. H. Chung, W.-L. Zhong, W.-G. Wu, and Y.-H. Shi, “A novel set-based particle swarm optimization method for discrete optimization problems,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 2, pp. 278–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Gong, Q. Cai, X. Chen, and L. Ma, “Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 1, pp. 82–97, 2013. View at Publisher · View at Google Scholar
  26. D. Aloise, G. Caporossi, P. Hansen, L. Liberti, S. Perron, and M. Ruiz, “Modularity maximization in networks by variable neighborhood search,” in Proceedings of the 10th DIMACS Implementation Challenge Graph Partitioning and Graph Clustering, pp. 113–127, Atlanta, Ga, USA, February 2012.
  27. 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, 2007. View at Publisher · View at Google Scholar
  28. S. Gómez, P. Jensen, and A. Arenas, “Analysis of community structure in networks of correlated data,” Physical Review E, vol. 80, no. 1, Article ID 016114, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. F. Wu and B. A. Huberman, “Finding communities in linear time: a physics approach,” The European Physical Journal B—Condensed Matter and Complex Systems, vol. 38, no. 2, pp. 331–338, 2004. View at Publisher · View at Google Scholar · View at Scopus
  30. 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
  31. W. Zachary, “An information flow modelfor conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977. View at Google Scholar
  32. 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,” Behavioral Ecology and Sociobiology, vol. 54, no. 4, pp. 396–405, 2003. View at Publisher · View at Google Scholar · View at Scopus
  33. M. E. 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 MathSciNet · View at Scopus
  34. B. Yang, W. K. Cheung, and J. Liu, “Community mining from signed social networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 10, pp. 1333–1348, 2007. View at Publisher · View at Google Scholar · View at Scopus
  35. A. Ferligoj and A. Kramberger, An Analysis of the Slovene Parliamentary Parties Network, 1996.
  36. K. E. Read, “Cultures of the central highlands, new Guinea,” Southwestern Journal of Anthropology, vol. 10, no. 1, pp. 1–43, 1954. View at Google Scholar