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

Semisupervised Clustering for Networks Based on Fast Affinity Propagation

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

Received 3 May 2013; Accepted 1 July 2013

Academic Editor: Orwa Jaber Housheya

Copyright © 2013 Mu Zhu 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. Coscia, F. Giannotti, and D. Pedreschi, “A classification for community discovery methods in complex networks,” Statistical Analysis and Data Mining, vol. 4, no. 5, pp. 512–546, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  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. J. Lee, S. P. Gross, and J. Lee, “Modularity optimization by conformational space annealing,” Physical Review E, vol. 85, no. 5, Article ID 056702, 5 pages, 2012. View at Publisher · View at Google Scholar
  4. X. Liu and T. Murata, “Advanced modularity-specialized label propagation algorithm for detecting communities in networks,” Physica A, vol. 389, no. 7, pp. 1493–1500, 2010. View at Publisher · View at Google Scholar · View at Scopus
  5. R. Shang, J. Bai, L. Jiao, and C. Jin, “Community detection based on modularity and an improved genetic algorithm,” Physica A, vol. 392, no. 5, pp. 1215–1231, 2013. View at Publisher · View at Google Scholar
  6. U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, no. 4, pp. 395–416, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  7. Y.-C. Wei and C.-K. Cheng, “Ratio cut partitioning for hierarchical designs,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 10, no. 7, pp. 911–921, 1991. View at Publisher · View at Google Scholar · View at Scopus
  8. J. B. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000. View at Publisher · View at Google Scholar · View at Scopus
  9. X. W. Xu, N. Yuruk, Z. D. Feng, and T. A. J. Schweiger, “SCAN: a structural clustering algorithm for networks,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pp. 824–833, ACM, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. H.-W. Liu, “Community detection by affinity propagation with various similarity measures,” in Proceedings of the 4th International Joint Conference on Computational Sciences and Optimization (CSO '11), pp. 182–186, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. H. Cheng, Y. Zhou, X. Huang, and J. X. Yu, “Clustering large attributed information networks: an efficient incremental computing approach,” Data Mining and Knowledge Discovery, vol. 25, no. 3, pp. 450–477, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. K. Wagstaff, C. Cardie, S. Rogers, S. Schrödl et al., “Constrained K-means clustering with background knowledge,” in Proceedings of the 18th International Conference on Machine Learning (ICML '01), pp. 577–584, Morgan Kaufmann Publishers, 2001.
  13. K. Wagstaff and C. Cardie, “Clustering with instance-level constraints,” in Proceedings of the 17th International Conference on Machine Learning (ICML '00), pp. 1103–1110, Morgan Kaufmann Publishers, 2000.
  14. M. Bilenko, S. Basu, and R. J. Mooney, “Integrating constraints and metric learning in semisupervised clustering,” in Proceedings of the 21st International Conference on Machine Learning (ICML '04), pp. 81–88, ACM, July 2004. View at Scopus
  15. D. Klein, S. D. Kamvar, and C. D. Manning, “From instance-level constraints to space-level constraints: making the most of prior knowledge in data clustering,” in Proceedings of the 19th International Conference on Machine Learning (ICML '02), pp. 307–314, Morgan Kaufmann Publishers, 2002.
  16. W. Tang, H. Xiong, S. Zhong, and J. Wu, “Enhancing semisupervised clustering: a feature projection perspective,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pp. 707–716, ACM, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. Xiao and J. Yu, “Semisupervised clustering based on affinity propagation algorithm,” Journal of Software, vol. 19, no. 11, pp. 2803–2813, 2008. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. C. Ruiz, M. Spiliopoulou, and E. Menasalvas, “C-DBSCAN: density-Based clustering with constraints,” in Proceedings of the 11th Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, pp. 216–223, Springer, 2007.
  19. I. E. Givoni and B. J. Frey, “Semisupervised Affinity Propagation with Instance-Level Constraints,” in Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, pp. 161–168, JMLR, 2009.
  20. A. Bar-Hillel, T. Hertz, N. Shental, and D. Weinshall, “Learning Distance Functions using Equivalence Relations,” in Proceedings of the 20th International Conference on Machine Learning, pp. 11–18, ACM, August 2003. View at Scopus
  21. S. Basu, M. Bilenko, and R. J. Mooney, “A probabilistic framework for semisupervised clustering,” in Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '04), pp. 59–68, August 2004. View at Scopus
  22. S. D. Kamvar, D. Klein, and C. Manning, “Spectral learning,” in Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 561–566, ACM, 2003.
  23. X. Wang and I. Davidson, “Flexible constrained spectral clustering,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '10), pp. 563–572, ACM, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. W. F. Chen and G. C. Feng, “Spectral clustering: a semisupervised approach,” Neurocomputing, vol. 77, no. 1, pp. 229–242, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. B. Kulis, S. Basu, I. Dhillon, and R. Mooney, “Semisupervised graph clustering: a kernel approach,” in Proceedings of the 22nd International Conference on Machine Learning (ICML '05), pp. 457–464, ACM, August 2005. View at Publisher · View at Google Scholar · View at Scopus
  26. X. K. Ma, L. Gao, X. R. Yong, and L. Fu, “Semisupervised clustering algorithm for community structure detection in complex networks,” Physica A, vol. 389, no. 1, pp. 187–197, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. G. Jeh and J. Widom, “SimRank: a measure of structural-context similarity,” in Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’02), pp. 538–543, ACM, July 2002. View at Scopus
  28. B. F. Frey and D. Dueck, “Clustering by passing messages between data points,” Science, vol. 305, no. 5814, pp. 972–976, 2007. View at Google Scholar
  29. A. Lancichinetti and S. Fortunato, “Limits of modularity maximization in community detection,” Physical Review E, vol. 84, no. 6, Article ID 066122, 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. S. White and P. Smyth, “A spectral clustering approach to finding communities in graphs,” in Proceedings of SIAM Conference on Data Mining (SDM '05), pp. 76–84, 2005.
  31. 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 Zentralblatt MATH · View at MathSciNet
  32. I. S. Dhillon, Y. Guan, and B. Kulis, “Kernel k-means, spectral clustering and normalized cuts,” in Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '04), pp. 551–556, ACM, August 2004. View at Scopus
  33. Z. P. Li, S. H. 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, 9 pages, 2008. View at Publisher · View at Google Scholar
  34. I. E. Givoni and B. J. Frey, “A binary variable model for affinity propagation,” Neural Computation, vol. 21, no. 6, pp. 1589–1600, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  35. C. M. Bishop, Pattern Recognition and Machine Learning, Springer, New York, NY, USA, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  36. http://www-personal.umich.edu/~mejn/netdata/.
  37. P. Sen, G. M. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine, vol. 29, no. 3, pp. 93–106, 2008. View at Google Scholar · View at Scopus
  38. http://www.cs.umd.edu/~sen/lbc-proj/LBC.html.