26,661 research outputs found
Link Prediction via Matrix Completion
Inspired by practical importance of social networks, economic networks,
biological networks and so on, studies on large and complex networks have
attracted a surge of attentions in the recent years. Link prediction is a
fundamental issue to understand the mechanisms by which new links are added to
the networks. We introduce the method of robust principal component analysis
(robust PCA) into link prediction, and estimate the missing entries of the
adjacency matrix. On one hand, our algorithm is based on the sparsity and low
rank property of the matrix, on the other hand, it also performs very well when
the network is dense. This is because a relatively dense real network is also
sparse in comparison to the complete graph. According to extensive experiments
on real networks from disparate fields, when the target network is connected
and sufficiently dense, whatever it is weighted or unweighted, our method is
demonstrated to be very effective and with prediction accuracy being
considerably improved comparing with many state-of-the-art algorithms
Mining complex trees for hidden fruit : a graph–based computational solution to detect latent criminal networks : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Information Technology at Massey University, Albany, New Zealand.
The detection of crime is a complex and difficult endeavour. Public and private organisations – focusing on law enforcement, intelligence, and compliance – commonly apply the rational isolated actor approach premised on observability and materiality. This is manifested largely as conducting entity-level risk management sourcing ‘leads’ from reactive covert human intelligence sources and/or proactive sources by applying simple rules-based models. Focusing on discrete observable and material actors simply ignores that criminal activity exists within a complex system deriving its fundamental structural fabric from the complex interactions between actors - with those most unobservable likely to be both criminally proficient and influential. The graph-based computational solution developed to detect latent criminal networks is a response to the inadequacy of the rational isolated actor approach that ignores the connectedness and complexity of criminality.
The core computational solution, written in the R language, consists of novel entity resolution, link discovery, and knowledge discovery technology. Entity resolution enables the fusion of multiple datasets with high accuracy (mean F-measure of 0.986 versus competitors 0.872), generating a graph-based expressive view of the problem. Link discovery is comprised of link prediction and link inference, enabling the high-performance detection (accuracy of ~0.8 versus relevant published models ~0.45) of unobserved relationships such as identity fraud. Knowledge discovery uses the fused graph generated and applies the “GraphExtract” algorithm to create a set of subgraphs representing latent functional criminal groups, and a mesoscopic graph representing how this set of criminal groups are interconnected. Latent knowledge is generated from a range of metrics including the “Super-broker” metric and attitude prediction.
The computational solution has been evaluated on a range of datasets that mimic an applied setting, demonstrating a scalable (tested on ~18 million node graphs) and performant (~33 hours runtime on a non-distributed platform) solution that successfully detects relevant latent functional criminal groups in around 90% of cases sampled and enables the contextual understanding of the broader criminal system through the mesoscopic graph and associated metadata. The augmented data assets generated provide a multi-perspective systems view of criminal activity that enable advanced informed decision making across the microscopic mesoscopic macroscopic spectrum
An Overview on Application of Machine Learning Techniques in Optical Networks
Today's telecommunication networks have become sources of enormous amounts of
widely heterogeneous data. This information can be retrieved from network
traffic traces, network alarms, signal quality indicators, users' behavioral
data, etc. Advanced mathematical tools are required to extract meaningful
information from these data and take decisions pertaining to the proper
functioning of the networks from the network-generated data. Among these
mathematical tools, Machine Learning (ML) is regarded as one of the most
promising methodological approaches to perform network-data analysis and enable
automated network self-configuration and fault management. The adoption of ML
techniques in the field of optical communication networks is motivated by the
unprecedented growth of network complexity faced by optical networks in the
last few years. Such complexity increase is due to the introduction of a huge
number of adjustable and interdependent system parameters (e.g., routing
configurations, modulation format, symbol rate, coding schemes, etc.) that are
enabled by the usage of coherent transmission/reception technologies, advanced
digital signal processing and compensation of nonlinear effects in optical
fiber propagation. In this paper we provide an overview of the application of
ML to optical communications and networking. We classify and survey relevant
literature dealing with the topic, and we also provide an introductory tutorial
on ML for researchers and practitioners interested in this field. Although a
good number of research papers have recently appeared, the application of ML to
optical networks is still in its infancy: to stimulate further work in this
area, we conclude the paper proposing new possible research directions
Global Models of Intermediate Timescale Variability on the Sun
In recent years a number of advances in both observation and theory have increased our understanding of the solar interior and how to model it. For climate studies, the timescale of interest for changes in the Sun ranges from decades to centuries. Some of the theoretical advances that will contribute to the building of global models of the Sun's variability on intermediate timescales are described. The current constraints on the important components are discussed. Finally a short discussion presenting some implications for input to climate modeling is presented
An Approach for Link Prediction in Directed Complex Networks based on Asymmetric Similarity-Popularity
Complex networks are graphs representing real-life systems that exhibit
unique characteristics not found in purely regular or completely random graphs.
The study of such systems is vital but challenging due to the complexity of the
underlying processes. This task has nevertheless been made easier in recent
decades thanks to the availability of large amounts of networked data. Link
prediction in complex networks aims to estimate the likelihood that a link
between two nodes is missing from the network. Links can be missing due to
imperfections in data collection or simply because they are yet to appear.
Discovering new relationships between entities in networked data has attracted
researchers' attention in various domains such as sociology, computer science,
physics, and biology. Most existing research focuses on link prediction in
undirected complex networks. However, not all real-life systems can be
faithfully represented as undirected networks. This simplifying assumption is
often made when using link prediction algorithms but inevitably leads to loss
of information about relations among nodes and degradation in prediction
performance. This paper introduces a link prediction method designed explicitly
for directed networks. It is based on the similarity-popularity paradigm, which
has recently proven successful in undirected networks. The presented algorithms
handle the asymmetry in node relationships by modeling it as asymmetry in
similarity and popularity. Given the observed network topology, the algorithms
approximate the hidden similarities as shortest path distances using edge
weights that capture and factor out the links' asymmetry and nodes' popularity.
The proposed approach is evaluated on real-life networks, and the experimental
results demonstrate its effectiveness in predicting missing links across a
broad spectrum of networked data types and sizes
- …