Strategies for online inference of model-based clustering in large and growing networks

DOI10.1214/10-AOAS359zbMath1194.62096OpenAlexW2030361081MaRDI QIDQ993242

Christophe Ambroise, Hugo Zanghi, Vincent Miele, Franck Picard

Publication date: 10 September 2010

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/10-aoas359

zbMATH Keywords

graph clusteringEM algorithmsonline strategiesweb graph structure analysis

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of statistics (62P99) Stochastic approximation (62L20) History, political science (91F10)

Related Items (10)

An online expectation maximization algorithm for exploring general structure in massive networks ⋮ Bayesian degree-corrected stochastic blockmodels for community detection ⋮ Statistical Network Analysis: A Review with Applications to the Coronavirus Disease 2019 Pandemic ⋮ Parameter identifiability in a class of random graph mixture models ⋮ Model-based clustering of large networks ⋮ A motif building process for simulating random networks ⋮ A FAST ESTIMATION ALGORITHM OF COMMUNITY NUMBER IN LARGE SCALE-FREE COMPLEX NETWORKS ⋮ Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood ⋮ Weighted stochastic block model ⋮ Convergence of the groups posterior distribution in latent or stochastic block models

Uses Software

• Cytoscape
• Mixnet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost sure convergence of Titterington's recursive estimator for mixture models
• Fast online graph clustering via Erdős-Rényi mixture
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Convergence of a stochastic approximation version of the EM algorithm
• An introduction to variational methods for graphical models
• Online EM algorithm for mixture with application to Internet traffic modeling
• A classification EM algorithm for clustering and two stochastic versions
• A nonparametric view of network models and Newman–Girvan and other modularities
• Mixed membership stochastic blockmodels
• Authoritative sources in a hyperlinked environment
• Mixture models and exploratory analysis in networks
• A vector space model for automatic indexing
• Estimation and Prediction for Stochastic Blockstructures

This page was built for publication: Strategies for online inference of model-based clustering in large and growing networks