Link Prediction using Network Embedding based on Global Similarity

سال انتشار: 1399
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 199

فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JECEI-8-1_009

تاریخ نمایه سازی: 23 آذر 1399

چکیده مقاله:

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link prediction methods identify all path structures in a network and can determine the similarity degree between graph-extracted entities with high accuracy but are time-consuming instead. Most existing algorithms are only using one type of feature (global or local) to represent data, which not well described due to the large scale and heterogeneity of complex networks. Methods: In this paper, a new method presented for Link Prediction using node embedding due to the high dimensions of real-world networks. The proposed method extracts a smaller model of the input network by getting help from the deep neural network and combining global and local nodes in a way to preserve the network's information and features to the desired extent. First, the feature vector is being extracted by an encoder-decoder for each node, which is a suitable tool for modeling complex nonlinear phenomena. Secondly, both global and local information concurrently used to improve the loss function. More obvious, the clustering similarity threshold considered as the local criterion and the transitive node similarity measure used to exploit the global features. To the end, the accuracy of the link prediction algorithm increased by designing the optimization operation accurately. Results: The proposed method applied to 4 datasets named Cora, Wikipedia, Blog catalog, Drug-drug-interaction, and the results are compared with laplacian, Node2vec, and GAE methods. Experimental results show an average accuracy achievement of 0.620, 0.723, 0.875, and 0.845 on the mentioned datasets, and confirm that the link prediction can effectively improve the prediction performance using network embedding based on global similarity.

نویسندگان

S. F. Mirmousavi

Faculty of Computer Engineering , Shahid Rajaee Teacher Training University,Tehran, Iran

S. Kianian

Faculty of Computer Engineering , Shahid Rajaee Teacher Training University,Tehran, Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • [1] G. Tsoumakas, I. Katakis, “Multi-label classification: An overview,” International ...
  • [2] L. Lü, T. Zhou, “Link prediction in complex networks: ...
  • [3] S. Fortunato, Community detection in graphs. Physics reports, 2010. ...
  • [4]  L. Lü, M. Medo, C.H. Yeung, Y.C. Zhang, Z.K. ...
  • [5] S. Wang, Q.Wang, M. Gong. "Multi-Task  Learning Based Network ...
  • [6] E.Airoldi “Mixed membership block models for relational data with application ...
  • [7] Z. Huang, X. Li, H. Chen, “Link prediction approach ...
  • [8] M. Al Hasan, V. Chaoji, S. Salem, M. Zaki, ...
  • [9] Z. Huang, D.K. Lin, “The time-series link prediction problem ...
  • [10] L. A. Adamic, E. Adar, Friends and neighbors on ...
  • [11] P. Jaccard, Etude comparative de la distribution florale  dans une   ...
  • [12]A, Clauset, C. Moore, M.E. Newman, “Hierarchical structure and the ...
  • [13] H. C. White, S. A. Boorman, R. L. Breiger, “Social ...
  • [14] N. Friedman, L. Getoor, D. Koller, A. Pfeffer, “Learning ...
  • [15] D. Heckerman, C. Meek, D. Koller, “Probabilistic entity-relationship models, ...
  • [16] P. Goyal, E. Ferrara, "Graph embedding techniques, applications, and ...
  • [17] W. L. Hamilton, R. Ying, J. Leskovec, Representation  learning ...
  • [18] X. Yue, et al., "Graph embedding on biomedical networks: ...
  •  [19] A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, A. J.  ...
  •  [20] D. Wang, P. Cui, W. Zhu, “Structural deep network embedding,” ...
  • [21] C. Hongyun, V.W. Zheng, K. Chen-Chuan Chang. "A comprehensive survey ...
  • [22] Ou, Mingdong, et al., "Asymmetric transitivity preserving graph   embedding,” in ...
  • [23] B. Perozzi, R. Al-Rfou, S. Skiena, "August. Deepwalk: "Online ...
  • [24] A. Grover, J. Leskovec, “node2vec: Scalable feature learning for ...
  • [25] C. Peng, et al., “A survey on network embedding,” IEEE ...
  • [26] J. Tang, M. Qu, M. Wang, M. Zhang, J. ...
  • [27] T.N. Kipf, M. Welling, "Semi-supervised Classification With Graph Convolutional ...
  • [28] Y. Wang, Y. Hongxun, S. Zhao, "Auto-encoder based dimensionality ...
  • [29] A. Papadimitriou, “Panagiotis Symeonidis, and Yannis  Manolopoulos,” Friendlink: link ...
  • [30] C. Xing, et al., "The application of degree related ...
  • [31] S. Panagiotis, E. Tiakas, Y. Manoulos, “Transitive node similarity for ...
  • [32] M. Belkin, P. Niyogi, “Laplacian eigenmaps and spectral techniques ...
  • [33] T.N. Kipf, M. Welling, “Variational graph auto-encoders,” arXiv preprint ...
  • [34] L. Tang, H. Liu, “Relational learning via latent social ...
  • [35] http://www.mattmahoney.net/dc/textdata ...
  • [36] T. Yang, R. Jin, Y. Chi, Z. Shenghuo, “Combining ...
  • [37] D.S. Wishart, Y.D. Feunang, A.C. Guo, et al., “Drugbank ...
  • نمایش کامل مراجع