A node representation learning approach for link prediction in social networks using game theory and K-core decomposition

Elaheh Nasiri, Asgarali Bouyer () and Esmaeil Nourani
Additional contact information
Elaheh Nasiri: Azarbaijan Shahid Madani University
Asgarali Bouyer: Azarbaijan Shahid Madani University
Esmaeil Nourani: Azarbaijan Shahid Madani University

The European Physical Journal B: Condensed Matter and Complex Systems, 2019, vol. 92, issue 10, 1-13

Abstract: Abstract The role of social networks in people’s daily life is undeniable. Link prediction is one of the most important tasks of complex network analysis. Predicting links is currently becoming a concerned topic in social network analysis. Although many link prediction methods have been proposed in the recent years, most of the existing link prediction methods have unsatisfactory performance because of high time complexity, network size, sparsity, and similarity measures between node pairs for processing topological information. In this paper, we proposed a method for node representation learning and also a new embedding technique is used for generating latent features. We also proposed an improved version of the weighted random walk based on game theoretical technique and k-core decomposition. Node representations are generated via skipgram method. Although most of the link prediction methods have high time complexity, since our method uses Stochastic Gradient Descent for the optimization process, it has linear time complexity with respect to the number of vertices. This causes our algorithm to be scalable to large networks. In addition to that, sparsity is a huge challenge in complex networks and we cannot infer enough information from the structure of the network to make predictions. By learning a low-dimensional representation that captures the network structure, classification of nodes and edges can be done more easily. The performance of the proposed method was evaluated with some benchmark heuristic scores and state-of-the-art techniques on link prediction in several real-world networks. The experimental results show that the proposed method obtains higher accuracy in comparison with considered methods and measures. However, the time complexity is not improved effectively. Graphical abstract

Keywords: Statistical; and; Nonlinear; Physics (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1140/epjb/e2019-100225-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:eurphb:v:92:y:2019:i:10:d:10.1140_epjb_e2019-100225-8

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10051

DOI: 10.1140/epjb/e2019-100225-8

Access Statistics for this article

The European Physical Journal B: Condensed Matter and Complex Systems is currently edited by P. Hänggi and Angel Rubio

More articles in The European Physical Journal B: Condensed Matter and Complex Systems from Springer, EDP Sciences
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().