Table of Contents Author Guidelines Submit a Manuscript
Applied Computational Intelligence and Soft Computing
Volume 2016 (2016), Article ID 3217612, 11 pages
http://dx.doi.org/10.1155/2016/3217612
Research Article

Local Community Detection Algorithm Based on Minimal Cluster

School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221008, China

Received 14 June 2016; Accepted 11 October 2016

Academic Editor: Wu Deng

Copyright © 2016 Yong Zhou 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. 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, pp. 292–313, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Lee, S. P. Gross, and J. Lee, “Modularity optimization by conformational space annealing,” Physical Review E, vol. 85, no. 5, Article ID 056702, pp. 499–508, 2012. View at Publisher · View at Google Scholar · View at Scopus
  3. H.-W. Shen and X.-Q. Cheng, “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
  4. J. Wu, Z.-M. Cui, Y.-J. Shi, S.-L. Sheng, and S.-R. Gong, “Local density-based similarity matrix construction for spectral clustering,” Journal on Communications, vol. 34, no. 3, pp. 14–22, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Mehrkanoon, C. Alzate, R. Mall, R. Langone, and J. A. K. Suykens, “Multiclass semisupervised learning based upon kernel spectral clustering,” IEEE Transactions on Neural Networks and Learning Systems, vol. 26, no. 4, pp. 720–733, 2015. View at Publisher · View at Google Scholar
  6. K. Taşdemir, B. Yalçin, and I. Yildirim, “Approximate spectral clustering with utilized similarity information using geodesic based hybrid distance measures,” Pattern Recognition, vol. 48, no. 4, pp. 1461–1473, 2015. View at Publisher · View at Google Scholar · View at Scopus
  7. V. D. Blondel, J. Guillaume, R. Lambiotte et al., “Fast unfolding of communities in large networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 30, no. 2, pp. 155–168, 2008. View at Google Scholar
  8. K. M. Tan, D. Witten, and A. Shojaie, “The cluster graphical lasso for improved estimation of Gaussian graphical models,” Computational Statistics and Data Analysis, vol. 85, pp. 23–36, 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. F. De Morsier, D. Tuia, M. Borgeaud, V. Gass, and J.-P. Thiran, “Cluster validity measure and merging system for hierarchical clustering considering outliers,” Pattern Recognition, vol. 48, no. 4, pp. 1478–1489, 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Bouguettaya, Q. Yu, X. Liu, X. Zhou, and A. Song, “Efficient agglomerative hierarchical clustering,” Expert Systems with Applications, vol. 42, no. 5, pp. 2785–2797, 2015. View at Publisher · View at Google Scholar · View at Scopus
  11. L. Subelj and M. Bajec, “Unfolding communities in large complex networks: combining defensive and offensive label propagation for core extraction,” Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, vol. 83, no. 3, pp. 885–896, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. Li, H. Lou, W. Jiang, and J. Tang, “Detecting community structure via synchronous label propagation,” Neurocomputing, vol. 151, no. 3, pp. 1063–1075, 2015. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Yi, Y. Shi, H. Zhang, J. Wang, and J. Kong, “Label propagation based semi-supervised non-negative matrix factorization for feature extraction,” Neurocomputing, vol. 149, pp. 1021–1037, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. D. Zikic, B. Glocker, and A. Criminisi, “Encoding atlases by randomized classification forests for efficient multi-atlas label propagation,” Medical Image Analysis, vol. 18, no. 8, pp. 1262–1273, 2014. View at Publisher · View at Google Scholar · View at Scopus
  15. A. Clauset, “Finding local community structure in networks,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 72, no. 2, pp. 254–271, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. F. Luo, J. Z. Wang, and E. Promislow, “Exploring local community structures in large networks,” Web Intelligence and Agent Systems, vol. 6, no. 4, pp. 387–400, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. J. Wu, H. Huang, Z. F. Hao, and F. Chen, “Local community detection using link similarity,” Journal of Computer Science and Technology, vol. 27, no. 6, pp. 1261–1268, 2012. View at Publisher · View at Google Scholar
  18. Q. Chen, T.-T. Wu, and M. Fang, “Detecting local community structures in complex networks based on local degree central nodes,” Physica A: Statistical Mechanics and Its Applications, vol. 392, no. 3, pp. 529–537, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. http://www-personal.umich.edu/~mejn/netdata/
  20. 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
  21. M. Girvan and M. E. J. 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
  22. N. P. Nguyen, T. N. Dinh, S. Tokala, and M. T. Thai, “Overlapping communities in dynamic networks: their detection and mobile applications,” in Proceedings of the 17th Annual International Conference on Mobile Computing and Networking (MobiCom '11), pp. 85–95, Las Vegas, Nev, USA, September 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Fortunato and C. Castellano, “Community structure in graphs,” in Computational Complexity, pp. 490–512, Springer, 2012. View at Google Scholar
  24. A. Lancichinetti, S. Fortunato, and F. Radicchi, “Benchmark graphs for testing community detection algorithms,” Physical Review E, vol. 78, no. 4, Article ID 046110, pp. 561–570, 2008. View at Publisher · View at Google Scholar · View at Scopus