Universal Multilayer Network Exploration by Random Walk with Restart
- URL: http://arxiv.org/abs/2107.04565v1
- Date: Fri, 9 Jul 2021 17:33:45 GMT
- Title: Universal Multilayer Network Exploration by Random Walk with Restart
- Authors: Anthony Baptista, Aitor Gonzalez, Ana\"is Baudot
- Abstract summary: MultiXrank is a Python package that enables Random Walk with Restart on any kind of multilayer network.
We show how MultiXrank can be used for unsupervised node prioritization and supervised classification in the context of human genetic diseases.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The amount and variety of data is increasing drastically for several years.
These data are often represented as networks, which are then explored with
approaches arising from network theory. Recent years have witnessed the
extension of network exploration methods to leverage more complex and richer
network frameworks. Random walks, for instance, have been extended to explore
multilayer networks. However, current random walk approaches are limited in the
combination and heterogeneity of network layers they can handle. New analytical
and numerical random walk methods are needed to cope with the increasing
diversity and complexity of multilayer networks. We propose here MultiXrank, a
Python package that enables Random Walk with Restart (RWR) on any kind of
multilayer network with an optimized implementation. This package is supported
by a universal mathematical formulation of the RWR. We evaluated MultiXrank
with leave-one-out cross-validation and link prediction, and introduced
protocols to measure the impact of the addition or removal of multilayer
network data on prediction performances. We further measured the sensitivity of
MultiXrank to input parameters by in-depth exploration of the parameter space.
Finally, we illustrate the versatility of MultiXrank with different use-cases
of unsupervised node prioritization and supervised classification in the
context of human genetic diseases.
Related papers
- Random Walk on Multiple Networks [20.52880283389138]
We propose random walk on multiple networks, RWM, to take advantage of rich information in multiple networks.
RWM sends a random walker on each network to obtain the local proximity.
Experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness and efficiency of RWM.
arXiv Detail & Related papers (2023-07-04T10:45:11Z) - Multiplex Heterogeneous Graph Convolutional Network [25.494590588212542]
This work proposes a Multiplex Heterogeneous Graph Convolutional Network (MHGCN) for heterogeneous network embedding.
Our MHGCN can automatically learn the useful heterogeneous meta-path interactions of different lengths in multiplex heterogeneous networks.
arXiv Detail & Related papers (2022-08-12T06:17:54Z) - Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes.
We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
arXiv Detail & Related papers (2021-06-15T09:03:28Z) - All at Once Network Quantization via Collaborative Knowledge Transfer [56.95849086170461]
We develop a novel collaborative knowledge transfer approach for efficiently training the all-at-once quantization network.
Specifically, we propose an adaptive selection strategy to choose a high-precision enquoteteacher for transferring knowledge to the low-precision student.
To effectively transfer knowledge, we develop a dynamic block swapping method by randomly replacing the blocks in the lower-precision student network with the corresponding blocks in the higher-precision teacher network.
arXiv Detail & Related papers (2021-03-02T03:09:03Z) - Link prediction in multiplex networks via triadic closure [0.9329978164030673]
Link prediction algorithms can help to understand the structure and dynamics of complex systems.
We show that different kind of relational data can be exploited to improve the prediction of new links.
We propose a novel link prediction algorithm by generalizing the Adamic-Adar method to multiplex networks composed by an arbitrary number of layers.
arXiv Detail & Related papers (2020-11-16T20:25:08Z) - Solving Sparse Linear Inverse Problems in Communication Systems: A Deep
Learning Approach With Adaptive Depth [51.40441097625201]
We propose an end-to-end trainable deep learning architecture for sparse signal recovery problems.
The proposed method learns how many layers to execute to emit an output, and the network depth is dynamically adjusted for each task in the inference phase.
arXiv Detail & Related papers (2020-10-29T06:32:53Z) - MultiVERSE: a multiplex and multiplex-heterogeneous network embedding
approach [0.0]
MultiVERSE is a fast and scalable method to learn node embeddings from multiplex and multiplex-heterogeneous networks.
We evaluate MultiVERSE on several biological and social networks and demonstrate its efficiency.
arXiv Detail & Related papers (2020-08-23T18:18:54Z) - A Multi-Semantic Metapath Model for Large Scale Heterogeneous Network
Representation Learning [52.83948119677194]
We propose a multi-semantic metapath (MSM) model for large scale heterogeneous representation learning.
Specifically, we generate multi-semantic metapath-based random walks to construct the heterogeneous neighborhood to handle the unbalanced distributions.
We conduct systematical evaluations for the proposed framework on two challenging datasets: Amazon and Alibaba.
arXiv Detail & Related papers (2020-07-19T22:50:20Z) - ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks.
Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
arXiv Detail & Related papers (2020-06-28T23:09:27Z) - Detecting Communities in Heterogeneous Multi-Relational Networks:A
Message Passing based Approach [89.19237792558687]
Community is a common characteristic of networks including social networks, biological networks, computer and information networks.
We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
arXiv Detail & Related papers (2020-04-06T17:36:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.