JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2014, Vol. 44 ›› Issue (6): 26-31.doi: 10.6040/j.issn.1672-3961.1.2014.116

Previous Articles     Next Articles

LDA-based link prediction in social network

LU Wenyang, XU Jiayi, YANG Yubin   

  1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, Jiangsu, China
  • Received:2014-03-31 Revised:2014-11-14 Online:2014-12-20 Published:2014-03-31

PDF (PC)

2079

Abstract: To address the problem of ignoring the text contents of nodes in social network link prediction methods, a Latent Dirichlet Allocation(LDA)-based collaborative evolutionary link prediction algorithm was proposed. The algorithm used LDA model to analyze the text content and abstracted a topic distribution vector for each node; The product of the topic distribution vectors was adopted to measure the similarity between the nodes' contents; Afterwards, the content similarity matrix was added to the adjacency matrix and the similarities between the nodes were computed consequently; At last, k most similar nodes were selected as the prediction result. The experimental results showed that the proposed algorithm achieved good prediction performance in sparse networks.

Key words: network evolution, social network, link prediction, topic model, Latent Dirichlet Allocation

CLC Number: 

  • TP301
[1] NEWMAN M E J. Clustering and preferential attachment in growing networks[J].Physical Review E, 2001, 64(2):251021-251024.
[2] CARMI S, HAVLIN S, KIRKPATRICK S, et al. A model of Internet topology using k-shell decomposition[J]. Proceedings of the National Academy of Sciences, 2007, 104(27):11150-11154.
[3] MURATA T, MORIYASU S. Link prediction of social networks based on weighted proximity measures[C]//Web Intelligence, IEEE/WIC/ACM International Conference on. Fremont:IEEE, 2007:85-88.
[4] BLEI D M, NG A Y, JORDAN M I. Latent dirichlet allocation[J].Journal of Machine Learning Research, 2003, 3:993-1022.
[5] SRENSEN T. 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[J]. Biol Skr, 1948, 5:1-34.
[6] LEICHT E A, HOLME P, NEWMAN M E J. Vertex similarity in networks[J]. Physical Review E, 2006, 73(2):26120.
[7] CHOWDHURY G. Introduction to modern information retrieval[M]. London:Facet publishing, 2010.
[8] ADAMIC L A, ADAR E. Friends and neighbors on the web[J]. Social Networks, 2003, 25(3):211-230.
[9] LU L, ZHOU T. Link prediction in complex networks:a survey[J].Physica A:Statistical Mechanics and its Applications, 2011, 390(6):1150-1170.
[10] CHAKRABARTI S, DOM B, INDYK P. Enhanced hypertext categorization using hyperlinks[C]//Proceedings of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, Washington:ACM, 1998, 27(2):307-318.
[11] ZHANG T, PROPESCUL A, DOM B. Linear prediction models with graph regularization for web-page categorization[C]//Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Philadelphia, USA:ACM, 2006:821-826.
[12] CARVALHO V R, COHEN W W. On the collective classification of email speech acts[C]//Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Salvador, Brazil:ACM, 2005:345-352.
[13] HEINRICH G. Parameter estimation for text analysis[R]. Darmstadt, Germany:Fraunhofer IGD, 2005.
[14] HOFMANN T. Probabilistic latent semantic indexing[C]//Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Salvador, Brazil:ACM, 1999:50-57.
[15] KUMAR R, NOVAK J, TOMKINS A. Structure and evolution of online social networks[M].New York:Springer, 2010:337-357.
[16] GUHA S, MEYERSON A, MISHRAN, et al. Clustering data streams:Theory and practice[J]. Knowledge and Data Engineering, 2003, 15(3):515-528.
[1] YAN Yingying, HUANG Ruizhang, WANG Rui, MA Can, LIU Bowei, HUANG Ting. A document understanding method for short texts by auxiliary long documents [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2018, 48(3): 67-74.
[2] DU Xixi, LIU Huafeng, JING Liping. An additive co-clustering for recommendation of integrating social network [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2018, 48(3): 96-102.
[3] SHEN Ji, MA Zhiqiang, LI Tuya, ZHANG Li. A word extend LDA model for short text sentiment [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2018, 48(3): 120-126.
[4] LI Shuo, SHI Yuliang. The method of spot cluster recommendation in location-based social networks [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2016, 46(3): 44-50.
[5] HAN Zhongming, WU Yang, TAN Xusheng, LIU Wen, YANG Weijie. Comparison and analysis on measure indexes for structural hole nodes in social network [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2015, 45(1): 1-8.
[6] WEI Wei, ZHANG Yanning. Pose estimation based on semi-supervised latent Dirichlet allocation [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2011, 41(3): 17-22.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of Journal of Shandong University (Engineering Science)
Supported by Beijing Magtech Co.Ltd