4,448 research outputs found
Link Prediction in Complex Networks: A Survey
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 labelled networks. Finally, we introduce some
applications and outline future challenges of link prediction algorithms.Comment: 44 pages, 5 figure
Edge vulnerability in neural and metabolic networks
Biological networks, such as cellular metabolic pathways or networks of
corticocortical connections in the brain, are intricately organized, yet
remarkably robust toward structural damage. Whereas many studies have
investigated specific aspects of robustness, such as molecular mechanisms of
repair, this article focuses more generally on how local structural features in
networks may give rise to their global stability. In many networks the failure
of single connections may be more likely than the extinction of entire nodes,
yet no analysis of edge importance (edge vulnerability) has been provided so
far for biological networks. We tested several measures for identifying
vulnerable edges and compared their prediction performance in biological and
artificial networks. Among the tested measures, edge frequency in all shortest
paths of a network yielded a particularly high correlation with vulnerability,
and identified inter-cluster connections in biological but not in random and
scale-free benchmark networks. We discuss different local and global network
patterns and the edge vulnerability resulting from them.Comment: 8 pages, 4 figures, to appear in Biological Cybernetic
Outlier Edge Detection Using Random Graph Generation Models and Applications
Outliers are samples that are generated by different mechanisms from other
normal data samples. Graphs, in particular social network graphs, may contain
nodes and edges that are made by scammers, malicious programs or mistakenly by
normal users. Detecting outlier nodes and edges is important for data mining
and graph analytics. However, previous research in the field has merely focused
on detecting outlier nodes. In this article, we study the properties of edges
and propose outlier edge detection algorithms using two random graph generation
models. We found that the edge-ego-network, which can be defined as the induced
graph that contains two end nodes of an edge, their neighboring nodes and the
edges that link these nodes, contains critical information to detect outlier
edges. We evaluated the proposed algorithms by injecting outlier edges into
some real-world graph data. Experiment results show that the proposed
algorithms can effectively detect outlier edges. In particular, the algorithm
based on the Preferential Attachment Random Graph Generation model consistently
gives good performance regardless of the test graph data. Further more, the
proposed algorithms are not limited in the area of outlier edge detection. We
demonstrate three different applications that benefit from the proposed
algorithms: 1) a preprocessing tool that improves the performance of graph
clustering algorithms; 2) an outlier node detection algorithm; and 3) a novel
noisy data clustering algorithm. These applications show the great potential of
the proposed outlier edge detection techniques.Comment: 14 pages, 5 figures, journal pape
Discriminative Distance-Based Network Indices with Application to Link Prediction
In large networks, using the length of shortest paths as the distance measure
has shortcomings. A well-studied shortcoming is that extending it to
disconnected graphs and directed graphs is controversial. The second
shortcoming is that a huge number of vertices may have exactly the same score.
The third shortcoming is that in many applications, the distance between two
vertices not only depends on the length of shortest paths, but also on the
number of shortest paths. In this paper, first we develop a new distance
measure between vertices of a graph that yields discriminative distance-based
centrality indices. This measure is proportional to the length of shortest
paths and inversely proportional to the number of shortest paths. We present
algorithms for exact computation of the proposed discriminative indices.
Second, we develop randomized algorithms that precisely estimate average
discriminative path length and average discriminative eccentricity and show
that they give -approximations of these indices. Third, we
perform extensive experiments over several real-world networks from different
domains. In our experiments, we first show that compared to the traditional
indices, discriminative indices have usually much more discriminability. Then,
we show that our randomized algorithms can very precisely estimate average
discriminative path length and average discriminative eccentricity, using only
few samples. Then, we show that real-world networks have usually a tiny average
discriminative path length, bounded by a constant (e.g., 2). Fourth, in order
to better motivate the usefulness of our proposed distance measure, we present
a novel link prediction method, that uses discriminative distance to decide
which vertices are more likely to form a link in future, and show its superior
performance compared to the well-known existing measures
An Evolutionary Algorithm Approach to Link Prediction in Dynamic Social Networks
Many real world, complex phenomena have underlying structures of evolving
networks where nodes and links are added and removed over time. A central
scientific challenge is the description and explanation of network dynamics,
with a key test being the prediction of short and long term changes. For the
problem of short-term link prediction, existing methods attempt to determine
neighborhood metrics that correlate with the appearance of a link in the next
observation period. Recent work has suggested that the incorporation of
topological features and node attributes can improve link prediction. We
provide an approach to predicting future links by applying the Covariance
Matrix Adaptation Evolution Strategy (CMA-ES) to optimize weights which are
used in a linear combination of sixteen neighborhood and node similarity
indices. We examine a large dynamic social network with over nodes
(Twitter reciprocal reply networks), both as a test of our general method and
as a problem of scientific interest in itself. Our method exhibits fast
convergence and high levels of precision for the top twenty predicted links.
Based on our findings, we suggest possible factors which may be driving the
evolution of Twitter reciprocal reply networks.Comment: 17 pages, 12 figures, 4 tables, Submitted to the Journal of
Computational Scienc
- …