Fast online graph clustering via Erdős–Rényi mixture
Authors:
- 1 December 2008
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 41 (12) , 3592-3599
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A mixture model for random graphsStatistics and Computing, 2007
- Model-Based Clustering for Social NetworksJournal of the Royal Statistical Society Series A: Statistics in Society, 2007
- New Specifications for Exponential Random Graph ModelsSociological Methodology, 2006
- An EM algorithm for the block mixture modelIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Functional cartography of complex metabolic networksNature, 2005
- Fast algorithm for detecting community structure in networksPhysical Review E, 2004
- Detecting community structure in networksThe European Physical Journal B, 2004
- Self-organization and identification of Web communitiesComputer, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block StructureJournal of Classification, 1997