Computer Science ›› 2018, Vol. 45 ›› Issue (6): 41-45.doi: 10.11896/j.issn.1002-137X.2018.06.007

• WISA2019 • Previous Articles     Next Articles

Method of Link Prediction in Social Networks Using Node Attribute Information

ZHANG Yu, GAO Ke-ning, YU Ge   

  1. School of Computer Science and Engineering,Northeastern University,Shenyang 110819,China
  • Received:2017-03-11 Online:2018-06-15 Published:2018-07-24

Abstract: With the development of large social networks,link prediction has become an important research subject.The link prediction problem in social networks using rich node attribute information was studied in this paper.Based on attribute-augmented social network model,which means rebuilding an augmented network by adding additional nodes with each node corresponding to an attribute,called social-attribute network,the classification of node attributes was added to the model as an important parameter.Several methods of assigning weights for different kinds of links were proposed.Then a random walk method was used for link prediction in the network.Experimental results reveal that this method has better performance compared with other similar methods.

Key words: Link prediction, Social network, Social-attribute network, Social node, Attribute node

CLC Number: 

  • TP311
[1]LIBEN-NOWELL D,KLEINBERG J.The link-prediction problem for social network[J].Journal of the American Society for Information Science and Technology,2007,58(7):1019-1031.
[2]LÜ L,ZHOU T.Link prediction in complex networks:A survey[J].Physica A Statistical Mechanics & Its Applications,2011,390(16):1150-1170.
[3]HASAN M A,ZAKI M J.A Survey of Link Prediction in Social Networks[M]//Social Networks Data Analytics.Springer US,2011:243-275.
[4]LICHTENWALTER R N,LUSSIER J T,CHAWLA N V.New perspectives and methods in link prediction[C]//ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Washington DC,USA,2010:243-252.
[5]HASAN,MOHAMMAD A.Link Prediction using Supervised Learning[J].Proc of Sdm Workshop on Link Analysis Counter-terrorism & Security,2006,30(9):798-805.
[6]HSU C C,LAI Y A,CHEN W H,et al.Unsupervised Ranking using Graph Structures and Node Attributes[C]//Tenth ACM International Conference on Web Search and Data Mining.ACM,2017:771-779.
[7]BACKSTROM L,LESKOVEC J.Supervised random walks: predicting and recommending links in social networks[C]//ACM International Conference on Web Search & Data Mining.ACM,2011:635-644.
[8]YIN Z,GUPTA M,WENINGER T,et al.LINKREC:a unified framework for link recommendation with user attributes and graph structure[C]//International Conference on World Wide Web(WWW 2010).Raleigh,North Carolina,USA,2010:1211-1212.
[9]YIN Z,GUPTA M,WENINGER T,et al.A Unified Framework for Link Recommendation Using Random Walks[C]//Procee-dings of the 2010 International Conference on Advances in Social Networks Analysis and Mining.IEEE Computer Society,2010:152-159.
[10]GONG N Z,TALWALKAR A,MACKEY L,et al.Joint Link Prediction and Attribute Inference Using a Social-Attribute Network[J].Acm Transactions on Intelligent Systems & Technology,2014,5(2):1-20.
[11]TONG H,FALOUTSOS C,PAN J Y.Fast Random Walk with Restart and Its Applications[C]//International Conference on Data Mining.IEEE,2006:613-622.
[1] MA Li-bo, QIN Xiao-lin. Topic-Location-Category Aware Point-of-interest Recommendation [J]. Computer Science, 2020, 47(9): 81-87.
[2] WANG Hui, LE Zi-chun, GONG Xuan, WU Yu-kun, ZUO Hao. Review of Link Prediction Methods Based on Feature Classification [J]. Computer Science, 2020, 47(8): 302-312.
[3] CHEN Jin-yin, ZHANG Dun-Jie, LIN Xiang, XU Xiao-dong and ZHU Zi-ling. False Message Propagation Suppression Based on Influence Maximization [J]. Computer Science, 2020, 47(6A): 17-23.
[4] YANG Zhuo-xuan, MA Yuan-pei and YAN Guan. Polynomial Time Community Detection Algorithm Based on Coupling Strength [J]. Computer Science, 2020, 47(6A): 102-107.
[5] LIANG Jun-bin, ZHANG Min, JIANG Chan. Research Progress of Social Sensor Cloud Security [J]. Computer Science, 2020, 47(6): 276-283.
[6] KONG Fang, LI Qi-zhi, LI Shuai. Survey on Online Influence Maximization [J]. Computer Science, 2020, 47(5): 7-13.
[7] FU Kun, QIU Qian, ZHAO Xiao-meng, GAO Jin-hui. Event Detection Method Based on Node Evolution Staged Optimization [J]. Computer Science, 2020, 47(5): 96-102.
[8] YUAN Rong, SONG Yu-rong, MENG Fan-rong. Link Prediction Method Based on Weighted Network Topology Weight [J]. Computer Science, 2020, 47(5): 265-270.
[9] LIU Xiao-fei, ZHU Fei, FU Yu-chen, LIU Quan. Personalized Recommendation Algorithm Based on User Preference Feature Mining [J]. Computer Science, 2020, 47(4): 50-53.
[10] LI Xin-chao, LI Pei-feng, ZHU Qiao-ming. Knowledge Graph Representation Based on Improved Vector Projection Distance [J]. Computer Science, 2020, 47(4): 189-193.
[11] MA Yang, CHENG Guang-quan, LIANG Xing-xing, LI Yan, YANG Yu-ling, LIU Zhong. Improved SDNE in Weighted Directed Network [J]. Computer Science, 2020, 47(4): 233-237.
[12] LIU Miao-miao,HU Qing-cui,GUO Jing-feng,CHEN Jing. Survey of Link Prediction Algorithms in Signed Networks [J]. Computer Science, 2020, 47(2): 21-30.
[13] WU Lei,YUE Feng,WANG Han-ru,WANG Gang. Academic Paper Recommendation Method Combined with Researcher Tag [J]. Computer Science, 2020, 47(2): 51-57.
[14] ZHANG Min-jun, HUA Qing-yi. Personalized Recommendation of Social Network Users' Interest Points Based on ProbabilityMatrix Decomposition Algorithm [J]. Computer Science, 2020, 47(12): 144-148.
[15] WANG Hui, LE Zi-chun, GONG Xuan, ZUO Hao, WU Yu-kun. TNTlink Prediction Model Based on Feature Learning [J]. Computer Science, 2020, 47(12): 245-251.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .