Fragmentation Coagulation Based Mixed Membership Stochastic Blockmodel
- URL: http://arxiv.org/abs/2002.00901v1
- Date: Fri, 17 Jan 2020 22:02:23 GMT
- Title: Fragmentation Coagulation Based Mixed Membership Stochastic Blockmodel
- Authors: Zheng Yu, Xuhui Fan, Marcin Pietrasik, Marek Reformat
- Abstract summary: Mixed-Membership Blockmodel(MMSB) is proposed as one of the state-of-the-art Bayesian methods suitable for learning the complex hidden structure underlying the network data.
Our model performs entity-based clustering to capture the community information for entities and linkage-based clustering to derive the group information for links simultaneously.
By integrating the community structure with the group compatibility matrix we derive a generalized version of MMSB.
- Score: 17.35449041036449
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Mixed-Membership Stochastic Blockmodel~(MMSB) is proposed as one of the
state-of-the-art Bayesian relational methods suitable for learning the complex
hidden structure underlying the network data. However, the current formulation
of MMSB suffers from the following two issues: (1), the prior information~(e.g.
entities' community structural information) can not be well embedded in the
modelling; (2), community evolution can not be well described in the
literature. Therefore, we propose a non-parametric fragmentation coagulation
based Mixed Membership Stochastic Blockmodel (fcMMSB). Our model performs
entity-based clustering to capture the community information for entities and
linkage-based clustering to derive the group information for links
simultaneously. Besides, the proposed model infers the network structure and
models community evolution, manifested by appearances and disappearances of
communities, using the discrete fragmentation coagulation process (DFCP). By
integrating the community structure with the group compatibility matrix we
derive a generalized version of MMSB. An efficient Gibbs sampling scheme with
Polya Gamma (PG) approach is implemented for posterior inference. We validate
our model on synthetic and real world data.
Related papers
- Copula-based mixture model identification for subgroup clustering with imaging applications [2.285847431713438]
We consider the more flexible Copula-Based Mixture Models (CBMMs) for clustering.
CBMMs allow heterogeneous component distributions composed by flexible choices of marginal and copula forms.
arXiv Detail & Related papers (2025-02-12T16:30:39Z) - Amortized Bayesian Mixture Models [1.3976439685325095]
This paper introduces a novel extension of Amortized Bayesian Inference (ABI) tailored to mixture models.
We factorize the posterior into a distribution of the parameters and a distribution of (categorical) mixture indicators, which allows us to use a combination of generative neural networks.
The proposed framework accommodates both independent and dependent mixture models, enabling filtering and smoothing.
arXiv Detail & Related papers (2025-01-17T14:51:03Z) - Adaptive Fuzzy C-Means with Graph Embedding [84.47075244116782]
Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods.
We propose a novel FCM based clustering model that is capable of automatically learning an appropriate membership degree hyper- parameter value.
arXiv Detail & Related papers (2024-05-22T08:15:50Z) - Fake It Till Make It: Federated Learning with Consensus-Oriented
Generation [52.82176415223988]
We propose federated learning with consensus-oriented generation (FedCOG)
FedCOG consists of two key components at the client side: complementary data generation and knowledge-distillation-based model training.
Experiments on classical and real-world FL datasets show that FedCOG consistently outperforms state-of-the-art methods.
arXiv Detail & Related papers (2023-12-10T18:49:59Z) - Bipartite mixed membership distribution-free model. A novel model for community detection in overlapping bipartite weighted networks [0.4972323953932129]
We introduce a novel model, the Bipartite Mixed Membership Distribution-Free (BiMMDF) model.
Our model allows an adjacency matrix to follow any distribution as long as its expectation has a block structure related to node membership.
An efficient algorithm with a theoretical guarantee of consistent estimation is applied to fit BiMMDF.
arXiv Detail & Related papers (2022-11-02T06:26:47Z) - Mixed membership distribution-free model [0.4972323953932129]
We consider the problem of community detection in overlapping weighted networks, where nodes can belong to multiple communities and edge weights can be finite real numbers.
To model such complex networks, we propose a general framework - the mixed membership distribution-free (MMDF) model.
We use an efficient spectral algorithm with a theoretical guarantee of convergence rate to estimate community memberships under the model.
arXiv Detail & Related papers (2021-12-04T18:21:02Z) - CaEGCN: Cross-Attention Fusion based Enhanced Graph Convolutional
Network for Clustering [51.62959830761789]
We propose a cross-attention based deep clustering framework, named Cross-Attention Fusion based Enhanced Graph Convolutional Network (CaEGCN)
CaEGCN contains four main modules: cross-attention fusion, Content Auto-encoder, Graph Convolutional Auto-encoder and self-supervised model.
Experimental results on different types of datasets prove the superiority and robustness of the proposed CaEGCN.
arXiv Detail & Related papers (2021-01-18T05:21:59Z) - Robust Finite Mixture Regression for Heterogeneous Targets [70.19798470463378]
We propose an FMR model that finds sample clusters and jointly models multiple incomplete mixed-type targets simultaneously.
We provide non-asymptotic oracle performance bounds for our model under a high-dimensional learning framework.
The results show that our model can achieve state-of-the-art performance.
arXiv Detail & Related papers (2020-10-12T03:27:07Z) - Model Fusion with Kullback--Leibler Divergence [58.20269014662046]
We propose a method to fuse posterior distributions learned from heterogeneous datasets.
Our algorithm relies on a mean field assumption for both the fused model and the individual dataset posteriors.
arXiv Detail & Related papers (2020-07-13T03:27:45Z) - Repulsive Mixture Models of Exponential Family PCA for Clustering [127.90219303669006]
The mixture extension of exponential family principal component analysis ( EPCA) was designed to encode much more structural information about data distribution than the traditional EPCA.
The traditional mixture of local EPCAs has the problem of model redundancy, i.e., overlaps among mixing components, which may cause ambiguity for data clustering.
In this paper, a repulsiveness-encouraging prior is introduced among mixing components and a diversified EPCA mixture (DEPCAM) model is developed in the Bayesian framework.
arXiv Detail & Related papers (2020-04-07T04:07:29Z) - Struct-MMSB: Mixed Membership Stochastic Blockmodels with Interpretable
Structured Priors [13.712395104755783]
Mixed membership blockmodel (MMSB) is a popular framework for community detection and network generation.
We present a flexible MMSB model, textitStruct-MMSB, that uses a recently developed statistical relational learning model, hinge-loss Markov random fields (HL-MRFs)
Our model is capable of learning latent characteristics in real-world networks via meaningful latent variables encoded as a complex combination of observed features and membership distributions.
arXiv Detail & Related papers (2020-02-21T19:32:32Z)
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.