Latent co-interests' relationship prediction

Tsinghua Science and Technology

Volumn 18, Issue 4, 2013, Pages 379-386

  Tan, Feng ^a   Li, Li ^a   Zhang, Zheyu ^a   Guo, Yunlong ^a  

^a SOUTHWEST UNIVERSITY   (China)

Author keywords

Factor graph model; Linking prediction; Node similarity; Social network

Indexed keywords

DEEP NEURAL NETWORKS; SOCIAL NETWORKING (ONLINE);

AUTHOR RELATIONSHIPS; FACTOR GRAPHS; LATENT INFORMATION; NETWORK INFORMATION; NETWORK STRUCTURES; NODE SIMILARITIES; PREDICTIVE METHODS; RESEARCH EFFORTS;

GRAPH THEORY;

EID: 84897691102     PISSN: 10070214     EISSN: None     Source Type: Journal    
DOI: 10.1109/TST.2013.6574676     Document Type: Article

References (29)

1. M. McPherson, L. S. Lovin, and J. M. Cook, Birds of a feather: Homophily in social networks, Annual Review of Sociology, vol. 27, no. 1, pp. 415-444, Aug. 2001.
2. G. Salton and M. McGill, Introduction to Modern Information Retrieval, New York, USA, 1986.
3. E. Leicht, P. Holme, and M. Newman, Vertex similarity in networks, Physical Review, vol. 73, no. 2, pp. 1-10, Jun. 2006.
4. E. Ravasz, A. Somera, D. Mongru, Z. Oltvai, and A. Barabasi, Hierarchical organization of modularity in metabolic networks, Science, vol. 297, no. 5586, pp. 1551-1555, Aug. 2002. (Pubitemid 34971002)
5. S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, vol. 30, no. 7, pp. 107-117, Sep. 1998.
6. H. Tong, C. Faloutsos, and J. Pan, Fast random walk with restart and its applications, in Proc. 6th International Conference on Data Mining, Washington DC, USA, 2006, pp. 613-622.
7. G. Jeh and J. Wido, SimRank: A measure of structuralcontext similarity, in Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, 2002, pp. 271-279.
8. C. Bishop, Pattern Recognition and Machine Learning, New York, USA: Springer, 2006.
9. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer, Learning probabilistic relational models, in Proc. 16th International Joint Conference on Artificial Intelligence, Sweden, 1999, pp. 1300-1309.
10. Y. Z. Guo, K. Ramamohanarao, and L. A. F. Park, Web page prediction based on conditional random fields, ECAI, Amsterdam, the Netherlands, 2008, pp. 251-255.
11. Z. Wei and H. Z. Li, A Markov random field model for network-based analysis of genomic data, Mathematics and Physical Sciences Bioinformatics, vol. 12, no. 23, pp. 1537-1544, Sep. 2007. (Pubitemid 47244479)
12. J. Tang, M. C. Hong, J. Z. Li, and B. Y. Liang, Tree-structured conditional random fields for semantic annotation, in Proc. 6th International Semantic Web Conference, Busan, Korea, 2006, pp. 640-653. (Pubitemid 44892062)
13. W. Tang, H. Zhuang, and J. Tang, Learning to infer social ties in large networks, in Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, 2011, pp. 381-397.
14. Z. Wang, J. Li, Z. Wang, and J. Tang, Crosslingual knowledge linking across wiki knowledge bases, in Proceedings of the Twenty-First World Wide Web Conference, Lyon, France, 2012, pp. 459-468.
15. M. Newman, The structure and function of complex networks, SIAM Rev., vol. 45, no. 3, pp. 167-256, Mar. 2003.
16. F. Wang and D. Landau, Efficient, multiple-range random walk algorithm to calculate the density of states, Phys. Rev. Lett., vol. 86, no. 10, pp. 2050-2053, Jul. 2001.
17. K. Murphy, Y. Weiss, and M. Jordan, Loopy belief propagation for approximate inference: An empirical study, in Proceeding of Uncertainty in AI, Stockholm, Sweden, 1999, pp. 467-475.
18. T. Moon, The expectation-maximization algorithm, IEEE Trans Signal Processing, vol. 6, no. 13, pp. 47-60, Feb. 1996. (Pubitemid 126518983)
19. J. Spall, Estimation via markov chain monte carlo, IEEE Control Systems Magazine, vol. 23, no. 2, pp. 34-45, Apr. 2003.
20. C. Bishop, Pattern Recognition and Machine Learning, New York, USA: Springer, 2006.
21. L. Lü and T. Zhou, Link prediction in complex networks: A survey, Physica A: Statistical Mechanics and its Applications, vol. 390, no. 6, pp. 1150-1170, Mar. 2011.
22. T. Zhou and Y. Zhang, Predicting missing links via local information, The European Physical Journal B, vol. 71, no. 4, pp. 623-630, Oct. 2009.
23. N. Koudas, S. Sarawagi, and D. Srivastava, Record linkage: Similarity measures and algorithms, in Proceedings of SIGMOD '06, New York, USA, 2006, pp. 802-803. (Pubitemid 46946588)
24. D. Liben-Nowell and J. Kleinberg, The link prediction problem for social networks, in Proceedings of the 12th International Conference on Information and Knowledge Management CIKM, New Orleans, LA, USA, 2003, pp. 556-559. (Pubitemid 40673595)
25. Y. Pan, D. Li, J. Liu, and J. Liang, Detecting community structure in complex networks via node similarity, Physica A: Statistical Mechanics and Its Applications, vol. 389, no. 14, pp. 2849-2857, Aug. 2010.
26. D. Heckerman, D. Geiger, and D. Chickering, Learning Bayesian networks: The combination of knowledge and statistical data, Machine Learning, vol. 20, no. 3, pp. 197-243, Mar. 1995.
27. C. Wang, V. Satuluri, and S. Parthasarathy, Local probabilistic models for link prediction, in ICDM'07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, Washington DC, USA, 2007, pp. 322-331.
28. C. Wang, J. Han, Y. Jia, J. Tang, D. Zhang, Y. Yu, and J. Guo, Mining advisoradvisee relationships from research publication networks, in Proceedings of the Sixteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, USA, 2010, pp. 203-212.
29. J. Leskovec, D. Huttenlocher, and J. Kleinberg, Predicting positive and negative links in online social networks, in Proceedings of the 19th International Conference onWorld Wide Web, Raleigh, NC, USA, 2010, pp. 641-650.