Community Detection on Mixture Multi-layer Networks via Regularized
Tensor Decomposition
- URL: http://arxiv.org/abs/2002.04457v1
- Date: Mon, 10 Feb 2020 06:19:50 GMT
- Title: Community Detection on Mixture Multi-layer Networks via Regularized
Tensor Decomposition
- Authors: Bing-Yi Jing and Ting Li and Zhongyuan Lyu and Dong Xia
- Abstract summary: We study the problem of community detection in multi-layer networks, where pairs of nodes can be related in multiple modalities.
We propose a tensor-based algorithm (TWIST) to reveal both global/local memberships of nodes, and memberships of layers.
- Score: 12.244594819580831
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the problem of community detection in multi-layer networks, where
pairs of nodes can be related in multiple modalities. We introduce a general
framework, i.e., mixture multi-layer stochastic block model (MMSBM), which
includes many earlier models as special cases. We propose a tensor-based
algorithm (TWIST) to reveal both global/local memberships of nodes, and
memberships of layers. We show that the TWIST procedure can accurately detect
the communities with small misclassification error as the number of nodes
and/or the number of layers increases. Numerical studies confirm our
theoretical findings. To our best knowledge, this is the first systematic study
on the mixture multi-layer networks using tensor decomposition. The method is
applied to two real datasets: worldwide trading networks and malaria parasite
genes networks, yielding new and interesting findings.
Related papers
- Estimating mixed memberships in multi-layer networks [0.0]
Community detection in multi-layer networks has emerged as a crucial area of modern network analysis.
We propose novel methods to estimate the common mixed memberships in the multi-layer mixed membership block model.
arXiv Detail & Related papers (2024-04-05T07:02:10Z) - Community detection in multiplex networks based on orthogonal
nonnegative matrix tri-factorization [26.53951886710295]
We introduce a new multiplex community detection approach that can identify communities that are common across layers as well as those that are unique to each layer.
The proposed algorithm is evaluated on both synthetic and real multiplex networks and compared to state-of-the-art techniques.
arXiv Detail & Related papers (2022-05-02T02:33:15Z) - LocalDrop: A Hybrid Regularization for Deep Neural Networks [98.30782118441158]
We propose a new approach for the regularization of neural networks by the local Rademacher complexity called LocalDrop.
A new regularization function for both fully-connected networks (FCNs) and convolutional neural networks (CNNs) has been developed based on the proposed upper bound of the local Rademacher complexity.
arXiv Detail & Related papers (2021-03-01T03:10:11Z) - Gaussian Mixture Graphical Lasso with Application to Edge Detection in
Brain Networks [21.49394455839253]
This work is inspired by Latent DirichletAllocation (LDA)
We propose a novel model called GaussianMixture Graphical Lasso (MGL)
MGL learns the proportionsof signals generated by each mixture component and their parameters iteratively via an EM framework.
arXiv Detail & Related papers (2021-01-13T21:15:30Z) - Global and Individualized Community Detection in Inhomogeneous
Multilayer Networks [14.191073951237772]
In network applications, it has become increasingly common to obtain datasets in the form of multiple networks observed on the same set of subjects.
Such datasets can be modeled by multilayer networks where each layer is a separate network itself while different layers are associated and share some common information.
The present paper studies community detection in a stylized yet informative inhomogeneous multilayer network model.
arXiv Detail & Related papers (2020-12-02T02:42:52Z) - Understanding Self-supervised Learning with Dual Deep Networks [74.92916579635336]
We propose a novel framework to understand contrastive self-supervised learning (SSL) methods that employ dual pairs of deep ReLU networks.
We prove that in each SGD update of SimCLR with various loss functions, the weights at each layer are updated by a emphcovariance operator.
To further study what role the covariance operator plays and which features are learned in such a process, we model data generation and augmentation processes through a emphhierarchical latent tree model (HLTM)
arXiv Detail & Related papers (2020-10-01T17:51:49Z) - 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) - M2Net: Multi-modal Multi-channel Network for Overall Survival Time
Prediction of Brain Tumor Patients [151.4352001822956]
Early and accurate prediction of overall survival (OS) time can help to obtain better treatment planning for brain tumor patients.
Existing prediction methods rely on radiomic features at the local lesion area of a magnetic resonance (MR) volume.
We propose an end-to-end OS time prediction model; namely, Multi-modal Multi-channel Network (M2Net)
arXiv Detail & Related papers (2020-06-01T05:21:37Z) - 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) - Unpaired Multi-modal Segmentation via Knowledge Distillation [77.39798870702174]
We propose a novel learning scheme for unpaired cross-modality image segmentation.
In our method, we heavily reuse network parameters, by sharing all convolutional kernels across CT and MRI.
We have extensively validated our approach on two multi-class segmentation problems.
arXiv Detail & Related papers (2020-01-06T20:03:17Z)
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.