Fast online graph clustering via Erdős-Rényi mixture

DOI10.1016/j.patcog.2008.06.019zbMath1151.68623OpenAlexW1988074911MaRDI 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

zbMATH Keywords

EM algorithmonlinegraph clustering

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (24)

On the statistical detection of clusters in undirected networks ⋮ Improved Bayesian inference for the stochastic block model with application to large networks ⋮ An online expectation maximization algorithm for exploring general structure in massive networks ⋮ Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models ⋮ Statistical Network Analysis: A Review with Applications to the Coronavirus Disease 2019 Pandemic ⋮ Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure ⋮ Parameter identifiability in a class of random graph mixture models ⋮ Network Structure Change Point Detection by Posterior Predictive Discrepancy ⋮ Detecting local network motifs ⋮ Inferring sparse Gaussian graphical models with latent structure ⋮ Graph clustering ⋮ Overlapping stochastic block models with application to the French political blogosphere ⋮ Model selection in overlapping stochastic block models ⋮ Variational Bayesian inference and complexity control for stochastic block models ⋮ The stochastic topic block model for the clustering of vertices in networks with textual edges ⋮ Strategies for online inference of model-based clustering in large and growing networks ⋮ Optimal Bayesian estimators for latent variable cluster models ⋮ Gaussian-based visualization of Gaussian and non-Gaussian-based clustering ⋮ A hybrid artificial immune network for detecting communities in complex networks ⋮ Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood ⋮ Goodness of Fit of Logistic Regression Models for Random Graphs ⋮ Probabilistic Community Detection With Unknown Number of Communities ⋮ Identifiability of parameters in latent structure models with many observed variables ⋮ Convergence of the groups posterior distribution in latent or stochastic block models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Fast online graph clustering via Erdős-Rényi mixture