• Corpus ID: 29831431

Hidden space reconstruction inspires link prediction in complex networks

  title={Hidden space reconstruction inspires link prediction in complex networks},
  author={Hao Liao and Mingyang Zhou and Zong-Wen Wei and Rui Mao and Alexandre Vidmer and Yi-Cheng Zhang},
As a fundamental challenge in vast disciplines, link prediction aims to identify potential links in a network based on the incomplete observed information, which has broad applications ranging from uncovering missing protein-protein interaction to predicting the evolution of networks. One of the most influential methods rely on similarity indices characterized by the common neighbors or its variations. We construct a hidden space mapping a network into Euclidean space based solely on the… 

Figures and Tables from this paper

International Journal of Scientific Research in Computer Science, Engineering and Information Technology

A technique is made which helps to avoid congestion and route changing and also used sensors for V2V (Vehicle to Vehicle) communication and V2I (vehicle to infrastructure) communication to resolve the problem that comes in day to day life related to Vehicles.

Cloud Data Security Using Third Party Auditor

This work studies the problem of ensuring the integrity of data storage in Cloud Computing, and focused on third party auditor (TPA) on the side of the cloud client for verifying the Integrity of dynamically stored data on the cloud.



Supervised Link Prediction Using Multiple Sources

A supervised learning framework that can effectively and efficiently learn the dynamics of social networks in the presence of auxiliary networks, a feature design scheme for constructing a rich variety of path-based features using multiple sources, and an effective feature selection strategy based on structured sparsity are presented.

Link Prediction in Complex Networks: A Survey

A Survey of Link Prediction in Complex Networks

This survey will review the general-purpose techniques at the heart of the link prediction problem, which can be complemented by domain-specific heuristic methods in practice.

Hierarchical structure and the prediction of missing links in networks

This work presents a general technique for inferring hierarchical structure from network data and shows that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks.

New perspectives and methods in link prediction

This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task and presents an effective flow-based predicting algorithm, formal bounds on imbalance in sparse network link prediction, and employ an evaluation method appropriate for the observed imbalance.

Toward link predictability of complex networks

A quantitative index for measuring link predictability and an algorithm that outperforms state-of-the-art link prediction methods in both accuracy and universality are introduced and a universal structural consistency index is proposed that is free of prior knowledge of network organization.

Uncovering the hidden geometry behind metabolic networks.

A cartographic map of metabolic networks is designed by embedding them into a simple geometry that provides a natural explanation for their observed network topology and that codifies node proximity as a measure of hidden structural similarities.

Cold start link prediction

This paper introduces cold start link prediction as the problem of predicting the structure of a social network when the network itself is totally missing while some other information regarding the nodes is available.

Hidden geometric correlations in real multiplex networks

It is shown that these multiplex systems are not random combinations of single network layers, but are organized in specific ways dictated by hidden geometric correlations between the layers, which facilitate the definition and detection of multidimensional communities.

Networks: Teasing out the missing links

A new study provides a general technique to divide network vertices into groups and sub-groups, which makes it possible to predict missing links from partial data with higher accuracy than previous methods.