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

Link Prediction via Sparse Gaussian Graphical Model

College of Command Information System, PLA University of Science and Technology, Nanjing 210007, China

Received 10 November 2015; Revised 27 January 2016; Accepted 27 January 2016

Academic Editor: David Bigaud

Copyright © 2016 Liangliang Zhang 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. L. L. Lü and T. Zhou, “Link prediction in complex networks: a survey,” Physica A: Statistical Mechanics & Its Applications, vol. 390, no. 6, pp. 1150–1170, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. B. Ermiş, E. Acar, and A. T. Cemgil, “Link prediction in heterogeneous data via generalized coupled tensor factorization,” Data Mining & Knowledge Discovery, vol. 29, no. 1, pp. 203–236, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Yang, N. Chawla, Y. Sun, and J. Hani, “Predicting links in multi-relational and heterogeneous networks,” in Proceedings of the 12th IEEE International Conference on Data Mining (ICDM '12), pp. 755–764, Brussels, Belgium, December 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American Society for Information Science and Technology, vol. 58, no. 7, pp. 1019–1031, 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. Y. Yang, R. N. Lichtenwalter, and N. V. Chawla, “Evaluating link prediction methods,” Knowledge and Information Systems, vol. 45, no. 3, pp. 751–782, 2015. View at Publisher · View at Google Scholar · View at Scopus
  6. N. Z. Gong, A. Talwalkar, L. MacKey et al., “Joint link prediction and attribute inference using a social-attribute network,” ACM Transactions on Intelligent Systems and Technology, vol. 5, no. 2, article 27, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Friedman, T. Hastie, and R. Tibshirani, “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics, vol. 9, no. 3, pp. 432–441, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. M. E. Newman, “Clustering and preferential attachment in growing networks,” Physical Review E, vol. 64, no. 2, pp. 25–102, 2001. View at Google Scholar
  9. G. Salton and M. J. McGill, Introduction to Modern Information Retrieval, McGraw-Hill, New York, NY, USA, 1986.
  10. P. Jaccard, “Etude comparative de la distribution florale dans une portion des Alpes et du Jura,” Bulletin de la Société Vaudoise des Sciences Naturelles, vol. 37, no. 142, pp. 547–579, 1901. View at Google Scholar
  11. T. Sørensen, “A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons,” Biologiske Skrifter, vol. 5, pp. 1–34, 1948. View at Google Scholar
  12. E. A. Leicht, P. Holme, and M. E. J. Newman, “Vertex similarity in networks,” Physical Review E, vol. 73, no. 2, Article ID 026120, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. 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
  14. T. Zhou, L. Lü, and Y.-C. Zhang, “Predicting missing links via local information,” The European Physical Journal B, vol. 71, no. 4, pp. 623–630, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. Z. Liu, Q. M. Zhang, L. Lü, and T. Zhou, “Link prediction in complex networks: a local naïve Bayes model,” EPL (Europhysics Letters), vol. 96, no. 4, Article ID 48007, 2011. View at Publisher · View at Google Scholar
  16. J. Dahl, L. Vandenberghe, and V. Roychowdhury, “Covariance selection for nonchordal graphs via chordal embedding,” Optimization Methods & Software, vol. 23, no. 4, pp. 501–520, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. O. Banerjee, L. E. Ghaoui, and A. Daspremont, “Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data,” Machine Learning Research, vol. 9, no. 3, pp. 485–516, 2008. View at Google Scholar · View at MathSciNet
  18. C. J. Hsieh, M. A. Sustik, I. S. Dhillon, P. K. Ravikumar, and R. Poldrack, “Big & quic: sparse inverse covariance estimation for a million variables,” in Advances in Neural Information Processing Systems, pp. 3165–3173, MIT Press, 2013. View at Google Scholar
  19. C.-J. Hsieh, M. A. Sustik, I. S. Dhillon, and P. Ravikumar, “QUIC: quadratic approximation for sparse inverse covariance estimation,” Journal of Machine Learning Research, vol. 15, pp. 2911–2947, 2014. View at Google Scholar · View at Scopus
  20. V. Latora and M. Marchiori, “Efficient behavior of small-world networks,” Physical Review Letters, vol. 87, Article ID 198701, 2001. View at Publisher · View at Google Scholar · View at Scopus
  21. 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
  22. M. E. J. Newman, “Assortative mixing in networks,” Physical Review Letters, vol. 89, no. 20, Article ID 208701, 2002. View at Google Scholar · View at Scopus
  23. J. Liu, S. Ji, and J. Ye, SLEP: Sparse Learning with Efficient Projections, vol. 6, Arizona State University, Tempe, Ariz, USA, 2009.