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

Link Prediction in Complex Network via Penalizing Noncontribution Relations of Endpoints

1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
2School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450000, China

Received 21 July 2014; Revised 10 September 2014; Accepted 24 September 2014; Published 16 November 2014

Academic Editor: Bo Shen

Copyright © 2014 Xuzhen 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. R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, article 47, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  2. M. E. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, “Complex networks: structure and dynamics,” Physics Reports, vol. 424, no. 4-5, pp. 175–308, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. L. Getoor and C. P. Diehl, “Link mining: a survey,” ACM SIGKDD Explorations Newsletter, vol. 7, no. 2, p. 3, 2005. View at Google Scholar
  5. W.-Q. Wang, Q.-M. Zhang, and T. Zhou, “Evaluating network models: a likelihood analysis,” EPL, vol. 98, no. 2, Article ID 28004, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Scellato, A. Noulas, and C. Mascolo, “Exploiting place features in link prediction on location-based social networks,” in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '11), pp. 1046–1054, ACM, August 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. C. V. Cannistraci, G. Alanis-Lobato, and T. Ravasi, “From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks,” Scientific reports, vol. 3, article 1613, 2013. View at Publisher · View at Google Scholar · View at Scopus
  8. R. Guimerà and M. Sales-Pardo, “Missing and spurious interactions and the reconstruction of complex networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 106, no. 52, pp. 22073–22078, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. L. Lü, M. Medo, C. H. Yeung, Y.-C. Zhang, Z.-K. Zhang, and T. Zhou, “Recommender systems,” Physics Reports, vol. 519, no. 1, pp. 1–49, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. X. Z. Zhu, H. Tian, and S. M. Cai, “Personalized recommendation with corrected similarity,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2014, Article ID P07004, 2014. View at Publisher · View at Google Scholar
  11. L. L. Linyuan and T. Zhou, “Link prediction in complex networks: a survey,” Physica A, vol. 390, no. 6, pp. 1150–1170, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Katz, “A new status index derived from sociometric analysis,” Psychometrika, vol. 18, no. 1, pp. 39–43, 1953. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. M. E. J. Newman, “Clustering and preferential attachment in growing networks,” Physical Review E, vol. 64, no. 2, Article ID 025102, 2001. View at Google Scholar · View at Scopus
  14. Y.-B. Xie, T. Zhou, and B.-H. Wang, “Scale-free networks without growth,” Physica A: Statistical Mechanics and Its Applications, vol. 387, no. 7, pp. 1683–1688, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. L. A. Adamic and E. Adar, “Friends and neighbors on the Web,” Social Networks, vol. 25, no. 3, pp. 211–230, 2003. View at Publisher · View at Google Scholar · View at Scopus
  16. T. Zhou, L. Lü, and Y.-C. Zhang, “Predicting missing links via local information,” European Physical Journal B, vol. 71, no. 4, pp. 623–630, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. X. Zhu, H. Tian, Z. Hu, and H. Liu, “Self-adaptive optimized link prediction based on weak ties theory in unweighted network,” in Proceedings of the International Conference on Social Computing (SocialCom '13), pp. 896–900, September 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. H. Liu, Z. Hu, H. Haddadi, and H. Tian, “Hidden link prediction based on node centrality and weak ties,” Europhysics Letters, vol. 101, no. 1, Article ID 18004, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. L. Lü, C.-H. Jin, and T. Zhou, “Similarity index based on local paths for link prediction of complex networks,” Physical Review E, vol. 80, no. 4, Article ID 046122, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Papadimitriou, P. Symeonidis, and Y. Manolopoulos, “Fast and accurate link prediction in social networking systems,” Journal of Systems and Software, vol. 85, no. 9, pp. 2119–2132, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. X. Zhu, H. Tian, S. Cai, J. Huang, and T. Zhou, “Predicting missing links via significant paths,” EPL (Europhysics Letters), vol. 106, no. 1, Article ID 18008, 2014. View at Publisher · View at Google Scholar · View at Scopus
  22. W. Liu and L. Lu, “Link prediction based on local random walk,” EPL, vol. 89, no. 5, Article ID 58007, 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. V. Batagelj and A. Mrvar, “Pajek-program for large network analysis,” Connections, vol. 21, no. 2, p. 47, 1998. View at Google Scholar
  24. D. Bu, Y. Zhao, L. Cai et al., “Topological structure analysis of the protein-protein interaction network in budding yeast,” Nucleic Acids Research, vol. 31, no. 9, pp. 2443–2450, 2003. View at Publisher · View at Google Scholar · View at Scopus
  25. M. E. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 74, no. 3, Article ID 036104, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. P. M. Gleiser and L. Danon, “Community structure in jazz,” Advances in Complex Systems, vol. 6, no. 04, p. 565, 2003. View at Google Scholar
  27. D. J. Watts and S. H. Strogatz, “Collective dynamics of small-world networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar · View at Scopus
  28. N. Blagus, L. Šubelj, and M. Bajec, “Self-similar scaling of density in complex real-world networks,” Physica A, vol. 391, no. 8, pp. 2794–2802, 2012. View at Publisher · View at Google Scholar · View at Scopus
  29. R. Guimerà, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas, “Self-similar community structure in a network of human interactions,” Physical Review E, vol. 68, no. 6, Article ID 065103, 2003. View at Google Scholar · View at Scopus
  30. L. Isella, J. Stehlé, A. Barrat, C. Cattuto, J.-F. Pinton, and W. Van den Broeck, “What's in a crowd? Analysis of face-to-face behavioral networks,” Journal of Theoretical Biology, vol. 271, no. 1, pp. 166–180, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. D. van Welden, “Mapping system theory problems to the field of knowledge discovery in databases,” in Proceedings of the 1st Future Business Technology Conference (Fubutec'04), pp. 55–59, EUROSIS, 2004.
  32. J. A. Hanley and B. J. McNeil, “A method of comparing the areas under receiver operating characteristic curves derived from the same cases,” Radiology, vol. 148, no. 3, pp. 839–843, 1983. View at Publisher · View at Google Scholar · View at Scopus
  33. M. E. J. Newman, “Assortative mixing in networks,” Physical Review Letters, vol. 89, no. 20, Article ID 208701, 2002. View at Publisher · View at Google Scholar