Link prediction in complex networks: A survey
Reads0
Chats0
TLDR
Recent progress about link prediction algorithms is summarized, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods.Abstract:
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. This article summaries recent progress about link prediction algorithms, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods. We also introduce three typical applications: reconstruction of networks, evaluation of network evolving mechanism and classification of partially labeled networks. Finally, we introduce some applications and outline future challenges of link prediction algorithms.read more
Citations
More filters
Journal ArticleDOI
Graph embedding techniques, applications, and performance: A survey
Palash Goyal,Emilio Ferrara +1 more
TL;DR: A comprehensive and structured analysis of various graph embedding techniques proposed in the literature, and the open-source Python library, named GEM (Graph Embedding Methods, available at https://github.com/palash1992/GEM ), which provides all presented algorithms within a unified interface to foster and facilitate research on the topic.
Journal ArticleDOI
A Review of Relational Machine Learning for Knowledge Graphs
TL;DR: This paper provides a review of how statistical models can be “trained” on large knowledge graphs, and then used to predict new facts about the world (which is equivalent to predicting new edges in the graph) and how such statistical models of graphs can be combined with text-based information extraction methods for automatically constructing knowledge graphs from the Web.
Proceedings Article
Link prediction based on graph neural networks
Muhan Zhang,Yixin Chen +1 more
TL;DR: A novel $\gamma$-decaying heuristic theory is developed that unifies a wide range of heuristics in a single framework, and proves that all these heuristic can be well approximated from local subgraphs.
Proceedings Article
Network representation learning with rich text information
TL;DR: By proving that DeepWalk, a state-of-the-art network representation method, is actually equivalent to matrix factorization (MF), this work proposes text-associated DeepWalk (TADW), which incorporates text features of vertices into network representation learning under the framework of Matrix factorization.
Journal ArticleDOI
A Survey on Network Embedding
TL;DR: Network embedding assigns nodes in a network to low-dimensional representations and effectively preserves the network structure as discussed by the authors, and a significant amount of progress has been made toward this emerging network analysis paradigm.
References
More filters
Journal ArticleDOI
Hierarchical organization unveiled by functional connectivity in complex brain networks.
TL;DR: This work study synchronization dynamics in the cortical brain network of the cat finds that in the biologically plausible regime the dynamics exhibits a hierarchical modular organization, in particular, revealing functional clusters coinciding with the anatomical communities at different scales.
Journal ArticleDOI
The spatial structure of networks
Michael T. Gastner,Mark Newman +1 more
TL;DR: There are strong signatures in these networks of topography and use patterns, giving the networks shapes that are quite distinct from one another and from non-geographic networks.
Journal ArticleDOI
Geographical dispersal of mobile communication networks
Renaud Lambiotte,Renaud Lambiotte,Vincent D. Blondel,Cristobald de Kerchove,Etienne Huens,Christophe Prieur,Zbigniew Smoreda,Paul Van Dooren +7 more
TL;DR: It is shown that the degree distribution in this network has a power-law degree distribution k−5 and that the probability that two customers are connected by a link follows a gravity model, i.e. decreases as d−2, where d is the distance between the customers.
Journal ArticleDOI
A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
TL;DR: It is pointed out that Kleinberg's "hub and authority" method to identify web-pages relevant to a given query can be viewed as a special case of the definition in the case where one of the graphs has two vertices and a unique directed edge between them.
Proceedings ArticleDOI
The Slashdot Zoo: Mining a Social Network with Negative Edges
TL;DR: The corpus of user relationships of the Slashdot technology news site is analysed and it is shown that the network exhibits multiplicative transitivity which allows algebraic methods based on matrix multiplication to be used.