Fast online graph clustering via Erdős-Rényi mixture
From MaRDI portal
Publication:947984
DOI10.1016/j.patcog.2008.06.019zbMath1151.68623MaRDI QIDQ947984
Christophe Ambroise, Vincent Miele, Hugo Zanghi
Publication date: 8 October 2008
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.06.019
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
Related Items
Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood, Network Structure Change Point Detection by Posterior Predictive Discrepancy, Variational Bayesian inference and complexity control for stochastic block models, Probabilistic Community Detection With Unknown Number of Communities, The stochastic topic block model for the clustering of vertices in networks with textual edges, Optimal Bayesian estimators for latent variable cluster models, Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models, Graph clustering, Overlapping stochastic block models with application to the French political blogosphere, Parameter identifiability in a class of random graph mixture models, Strategies for online inference of model-based clustering in large and growing networks, Identifiability of parameters in latent structure models with many observed variables, On the statistical detection of clusters in undirected networks, An online expectation maximization algorithm for exploring general structure in massive networks, Detecting local network motifs, Inferring sparse Gaussian graphical models with latent structure, Model selection in overlapping stochastic block models, Gaussian-based visualization of Gaussian and non-Gaussian-based clustering, Convergence of the groups posterior distribution in latent or stochastic block models, Improved Bayesian inference for the stochastic block model with application to large networks, A hybrid artificial immune network for detecting communities in complex networks, Goodness of Fit of Logistic Regression Models for Random Graphs
Cites Work
- Almost sure convergence of Titterington's recursive estimator for mixture models
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Online EM algorithm for mixture with application to Internet traffic modeling
- Statistical mechanics of complex networks
- Scene Labeling by Relaxation Operations
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
