A Dynamic Link Prediction Method Based on Improved Dynamic Triad Model

doi:10.3969/j.issn.1671-1122.2020.09.020

Abstract

Abstract:

Concerning dynamic social network link prediction, the paper proposed an improved DynamicTriad model. The dynamic triadic closure structure was the carrier, and three vertices formd a basic network unit. Combined with the network homophily and similarity index, the dynamic network was represented dynamically and each node was represented in different time slices, as to realize the dynamic individual behavior prediction of social network. Moreover, the t+1 time embedding vector was used to validate t time prediction effect. Experiments show that the improved model represents the relationship between nodes dynamically, and the effect of link prediction is better than the traditional algorithms. Besides, the proposed method supports the modeling and analysis of dynamic social network.

Key words: social network, dynamic network, link prediction

CLC Number:

TP309

XIA Tianyu, GU Yijun. A Dynamic Link Prediction Method Based on Improved Dynamic Triad Model[J]. Netinfo Security, 2020, 20(9): 97-101.

Figures/Tables 2

References 20

[1]	CALDERONI F, CATANESE S, MEO D P, et al. Robust Link Prediction in Criminal Networks: A Case Study of the Sicilian Mafia[J]. Expert Systems with Applications, 2020(161):113666.
[2]	ZHOU Lekui, YANG Yang, REN Xiang, et al. Dynamic Network Embedding by Modeling Triadic Closure Process[C]// AAAI. 32nd AAAI Conference on Artificial Intelligence, February 2-7, 2018, New Orleans, Louisiana, USA. California: AAAI, 2018: 571-578.
[3]	KOSSINETS G, WATTS D J. Origins of Homophily in an Evolving Social Network[J]. American Journal of Sociology, 2009,115(2):405-450. doi: 10.1086/599247 URL
[4]	ZHOU Tao, LÜ Linyuan, ZHANG Yicheng. Predicting Missing Links via Local Information[J]. The European Physical Journal B, 2009,71(4):623-630. doi: 10.1140/epjb/e2009-00335-8 URL
[5]	LIN Dekang. An Information-theoretic Definition of Similarity[C]// ACM. 15th International Conference on Machine Learning, July 24-27, 1998, San Francisco, California, USA. New York: ACM, 1998: 296-304.
[6]	LESKOVEC J, HORVITZ E. Planetary-scale Views on an Instant-Messaging Network[C]// ACM. 17th International Conference on World Wide Web, April 21-25, 2008, Beijing, China. New York: ACM, 2008: 915-924.
[7]	LÜ Linyuan, ZHOU Tao. Link Prediction in Complex Networks: A Survey[J]. Physica A: Statistical Mechanics and its Applications, 2011,390(6):1150-1170. doi: 10.1016/j.physa.2010.11.027 URL
[8]	HASAN M AL, CHAOJI V, SALEM S, et al. Link Prediction Using Supervised Learning[C]// SIAM. SIAM International Conference on Data Mining, April 20-22, 2006, Bethesda, Maryland, USA. Pennsylvania: SIAM, 2006: 798-805.
[9]	YUAN Guangchao, MURUKANNAIAH P K, ZHANG Zhe, et al. Exploiting Sentiment Homophily for Link Prediction[C]// ACM. 8th ACM Conference on Recommender Systems,October 6-10, 2014, Foster City, Silicon Valley, California, USA. New York: ACM, 2014: 17-24.
[10]	KUNEGIS J, LOMMATZSCH A. Learning Spectral Graph Transformations for Link Prediction[C]// ACM. 26th Annual International Conference on Machine Learning,June 14-18, 2009, Montreal, Quebec, Canada. New York: ACM, 2009: 561-568.
[11]	CLAUSET A, MOORE C, NEWMAN M. Hierarchical Structure and the Prediction of Missing Links in Networks[J]. Nature, 2008,453(7191):98-101. doi: 10.1038/nature06830 URL pmid: 18451861
[12]	PEROZZI B, Al-RFOU R, SKIENA S. Deepwalk: Online Learning of Social Representations[C]// ACM. 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 24-27, 2014, New York, USA. New York: ACM, 2009: 701-710.
[13]	TANG Jian, QU Meng, WANG Mingzhe, et al. Line: Large-Scale Information Network Embedding[C]// ACM. 24th International Conference on World Wide Web, May 18-22, 2015, Florence, Italy. New York: ACM, 2015: 1067-1077.
[14]	WANG Daxin, CUI Peng, ZHU Wenwu. Structural Deep Network Embedding[C]// ACM. 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 13-17, 2016, San Francisco, California, USA. New York: ACM, 2016: 1225-1234.
[15]	GROVER A, LESKOVEC J. Node2vec: Scalable Feature Learning for Networks[C]// ACM. 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 13-17, 2016, San Francisco, California, USA. New York: ACM, 2016: 855-864.
[16]	RIBEIRO L F R, SAVERESE P H P, FIGUEIREDO D R. Struc2vec: Learning Node Representations from Structural Identity[C]// ACM. 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 13-17, 2017, Halifax, Nova Scotia, Canada. New York: ACM, 2017: 385-394.
[17]	WHITE H. Maximum Likelihood Estimation of Misspecified Models[J]. Econometrica: Journal of the Econometric Society, 1982,50(1):1-25. doi: 10.2307/1912526 URL
[18]	SALTON G, MCGILL M J. Introduction to Modern Information Retrieval[M]. Auckland: MuGraw-Hill, 1983.
[19]	ROSSI R A, AHMED N K. The Network Data Repository with Interactive Graph Analytics and Visualization[C]// AAAI. 29th AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. California: AAAI, 2015: 4292-4293.
[20]	BROWN J D. Principal Components Analysis and Exploratory Factor Analysis-Definitions, Differences, and Choices[J]. JALT Testing & Evaluation SIG Newsletter, 2009,13(1):26-30.