An online expectation maximization algorithm for exploring general structure in massive networks

DOI10.1016/j.physa.2015.07.001zbMath1400.62113OpenAlexW2147013875MaRDI QIDQ1618786

Caiyan Jia, Jian Yu, Bianfang Chai

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.07.001

zbMATH Keywords

complex networksgeneral structure explorationonline expectation maximization algorithm

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Approximation algorithms (68W25)

Related Items

Topic segmentation via community detection in complex networks

Cites Work

• Unnamed Item
• Fast online graph clustering via Erdős-Rényi mixture
• Strategies for online inference of model-based clustering in large and growing networks
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• On-Line Expectation–Maximization Algorithm for latent Data Models
• Robustness of community structure to node removal
• Mixture models and exploratory analysis in networks
• Estimation and Prediction for Stochastic Blockstructures
• Community structure in social and biological networks
• 10.1162/jmlr.2003.3.4-5.993
• Efficient discovery of overlapping communities in massive networks

This page was built for publication: An online expectation maximization algorithm for exploring general structure in massive networks