Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 708581, 10 pages
http://dx.doi.org/10.1155/2013/708581
Research Article

Sign Inference for Dynamic Signed Networks via Dictionary Learning

State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received 19 July 2013; Accepted 15 October 2013

Academic Editor: Dewei Li

Copyright © 2013 Yi Cen 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. C. Zhang, J. Sun, X. Zhu, and Y. Fang, “Privacy and security for online social networks: challenges and opportunities,” IEEE Network, vol. 24, no. 4, pp. 13–18, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. N. Jabeur, S. Zeadally, and B. Sayed, “Mobile social networking applications,” Communications of the ACM, vol. 56, no. 3, pp. 71–79, 2013. View at Google Scholar
  3. D. M. Dunlavy, T. G. Kolda, and E. Acar, “Temporal link prediction using matrix and tensor factorizations,” ACM Transactions on Knowledge Discovery from Data, vol. 5, no. 2, article 10, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Clauset, C. Moore, and M. E. J. Newman, “Hierarchical structure and the prediction of missing links in networks,” Nature, vol. 453, no. 7191, pp. 98–101, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. F. Harary, “On the notion of balance of a signed graph,” The Michigan Mathematical Journal, vol. 2, no. 2, pp. 143–146, 1953. View at Google Scholar · View at MathSciNet
  6. D. Cartwright and F. Harary, “Structural balance: a generalization of Heider's theory,” Psychological Review, vol. 63, no. 5, pp. 277–293, 1956. View at Publisher · View at Google Scholar · View at Scopus
  7. J. A. Davis, “Clustering and structural balance in graphs,” Human Relations, vol. 20, no. 2, pp. 181–187, 1967. View at Google Scholar
  8. C. J. Hsieh, K. Y. Chiang, and I. S. Dhillon, “Low rank modeling of signed networks,” in Proceedings of the Knowledge Discovery and Data Mining Conference (KDD '12), 2012.
  9. J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Predicting positive and negative links in online social networks,” in Proceedings of the 19th International World Wide Web Conference (WWW '10), pp. 641–650, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. K.-Y. Chiang, N. Natarajan, A. Tewari, and I. S. Dhillon, “Exploiting longer cycles for link prediction in signed networks,” in Proceedings of the 20th ACM Conference on Information and Knowledge Management (CIKM '11), pp. 1157–1162, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. 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
  12. L. Lü and T. Zhou, “Link prediction in complex networks: a survey,” Physica A, vol. 390, no. 6, pp. 1150–1170, 2011. View at Google Scholar
  13. M. Szell, R. Lambiotte, and S. Thurner, “Multirelational organization of large-scale social networks in an online world,” Proceedings of the National Academy of Sciences of the United States of America, vol. 107, no. 31, pp. 13636–13641, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Kunegis, A. Lommatzsch, and C. Bauckhage, “The slashdot zoo: mining a social network with negative edges,” in Proceedings of the 18th International World Wide Web Conference (WWW '09), pp. 741–750, ACM, 2009.
  15. J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Signed networks in social media,” in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI '10 ), pp. 1361–1370, ACM, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. J. A. Davis, “Structural balance, mechanical solidarity, and interpersonal relations,” The American Journal of Sociology, vol. 68, no. 4, pp. 444–462, 1963. View at Publisher · View at Google Scholar
  17. A. Srinivasan, “Local balancing influences global structure in social networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 108, no. 5, pp. 1751–1752, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. F. Heider, “Attitudes and cognitive organization,” The Journal of Psychology, vol. 21, no. 1, pp. 107–112, 1946. View at Google Scholar
  19. Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Kluwer Academic, Boston, Mass, USA, 2003.
  20. J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956–1982, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. Y. Cong, J. Yuan, and J. Liu, “Sparse reconstruction cost for abnormal event detection,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '11), pp. 3449–3456, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. D. L. Donoho and I. M. Johnstone, “Adapting to unknown smoothness via wavelet shrinkage,” Journal of the American Statistical Association, vol. 90, no. 432, pp. 1200–1224, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. J. B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms, vol. 2, Springer, Heidelberg, Germany, 2nd edition, 1996.
  24. Y. Nesterov, “A method of solving a convex programming problem with convergence rate O(1/k2),” Soviet Mathematics Doklady, vol. 27, no. 2, pp. 372–376, 1983. View at Google Scholar
  25. A. Nemirovsky and D. Yudin, Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems, John Wiley & Sons, New York, NY, USA, 1983.
  26. J. Liu, J. Chen, and J. Ye, “Large-scale sparse logistic regression,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 547–555, July 2009. View at Publisher · View at Google Scholar · View at Scopus
  27. A. Nemirovski, “Efficient Methods in Convex Programming,” Lecture Notes, 1994.
  28. H. Huang and A. Makur, “Backtracking-based matching pursuit method for sparse signal reconstruction,” IEEE Signal Processing Letters, vol. 18, no. 7, pp. 391–394, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. Y. Koren, R. M. Bell, and C. Volinsky, “Matrixfactorization techniques for recommender systems,” IEEE Computer, vol. 42, no. 8, pp. 30–37, 2009. View at Google Scholar
  30. P. Jain, R. Meka, and I. Dhillon, “Guaranteed rank minimization via singular value projection,” in Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS '10), pp. 934–945, December 2010. View at Scopus