Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood

Statistical Modelling

Volumn 15, Issue 6, 2015, Pages 564-589

  Côme, Etienne ^a   Latouche, Pierre ^b  

^a GRETTIA   (France)

^b Université Paris 1 Panthéon Sorbonne   (France)

Author keywords

greedy inference; Integrated classification likelihood; networks; random graphs; stochastic block models

Indexed keywords

EID: 84953736602     PISSN: 1471082X     EISSN: 14770342     Source Type: Journal    
DOI: 10.1177/1471082X15577017     Document Type: Article

References (47)

1. L.AdamicN.Glance (2005) The political blogosphere and the 2004 US election. In Proceedings of the WWW Workshop on the Weblogging Ecosystem. Chicago, IL, USA.
2. E.AiroldiD.BleiE.XingS.Fienberg (2006) Mixed membership stochastic block models for relational data with application to proteinprotein interactions. In Proceedings of the International Biometrics Society Annual Meeting. Monteral, Quebec, Canada.
3. E.AiroldiD.BleiS.E.FienbergE.P.Xing (2007) Mixed membership analysis of high-throughput interaction studies: Relational data. 2007, ArXiv e-prints.
4. E.M.AiroldiD.M.BleiS.E.FienbergE.P.Xing (2008) Mixed-membership stochastic blo- ckmodels. Journal of Machine Learning Research, 9, 1981–2014.
5. A.L.BarabásiZ.N.Oltvai (2004) Network biology: understanding the cell's functional organization.Nature Reviews. Genetics, 5, 101–13.
6. J.Besag (1986) On the statistical analysis of dirty pictures (with discussions). Journal of the Royal Statistical Society, Series B, 48, 259–302.
7. P.J.BickelA.Chen (2009) A non parametric view of network models and Newman Girvan and other modularities. Proceedings of the National Academy of Sciences, 106, 21068–73.
8. C.BiernackiG.CeleuxG.Govaert (2000) Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7, 719–25.
9. C.BiernackiG.CeleuxG.Govaert (2010) Exact and Monte Carlo calculations of integrated likelihoods for the latent class model. Journal of Statistical Planning and Inference, 140, 2991–3002.
10. V.D.BlondelJ.L.GuillaumeR.LambiotteE.Lefebvre (2008) Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 10, 10008–20.
11. R.BouletB.JouveF.RossiN.Villa (2008) Batch kernel SOM and related Laplacian methods for social network analysis. Neurocomputing, 71, 1257–73.
12. E.CômeE.Diemert (2010) The noise cluster model, a greedy solution to the network community extraction problem. Information Intelligence Interaction, 11, 40–59.
13. J.DaudinF.PicardS.Robin (2008) A mixture model for random graph. Statistics and computing, 18, 1–36.
14. E.EstradaJ.A.Rodriguez-Velazquez (2005) Spectral measures of bipartivity in complex networks. Physical Review E, 72, 046105.
15. S.FienbergS.Wasserman (1981) Categorical data analysis of single sociometric relations. Sociological Methodology, 12, 156–92.
16. S.FortunatoM.Barthélemy (2007) Resolution limit in community detection. Proceedings of the National Academy of Sciences of the United States of America, 104, 36–41.
17. M.GirvanM.E.J.Newman (2002) Community structure in social and biological networks. In Proceedings of the National Academy of Sciences, 99, 7821–26.
18. A.GoldenbergA.ZhengS.FienbergE.Airoldi (2010) A survey of statistical network models. Foundations and Trends in Mac- hine Learning, 2, 129–233.
19. M.S.HandcockA.E.RafteryJ.M.Tantrum (2007) Model-based clustering for social networks. Journal of the Royal Statistical Society, 170, 1–22.
20. P.HoffA.RafteryM.Handcock (2002) Latent space approaches to social network analysis. Journal of the Royal Statistical Society, 97, 1090–98.
21. J.HofmanC.Wiggins (2008) A Bayesian approach to network modularity. Physical Review Letters, 100, 258701–9900.
22. J.HollandK.LaskeyS.Leinhard (1993) Stochastic block models: First steps. Social Networks, 5, 109–37.
23. L.HubertP.Arabie (1985) Comparing parti- tions. Journal of classification, 2, 193–218.
24. H.Jeffreys (1946) An invariant form for the prior probability in estimations problems. In Proceedings of the Royal Society of London. Series A, 186, 453–61.
25. B.KarrerM.E.J.Newman (2011) Stochastic blockmodels and community structure in networks. Physical Review E, 83, 016107.
26. P.N.KrivitskyM.S.HandcockA.E.RafteryP.D.Hoff (2009) Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models. Social Networks, 31, 204–13.
27. V.LacroixC.FernandesM.F.Sagot (2006) Motif search in graphs: Application to metabolic networks. Transactions in Computational Biology and Bioinformatics, 3, 360–68.
28. P.LatoucheE.BirmeléC.Ambroise (2009) Bayesian methods for graph clustering. Advances in Data Analysis Data Handling and Business Intelligence, pages 229–39. Springer.
29. P.LatoucheE.BirmeléC.Ambroise (2011) Overlapping stochastic block models with application to the french political blogosphere.Annals of Applied Statistics, 5, 309–36.
30. LatoucheE.BirmeléC.Ambroise (2012) Variational bayesian inference and complexity control for stochastic block models.Statistical Modelling, 12, 93–115.
31. M.MariadassouS.RobinC.Vacher (2010) Uncovering latent structure in valued graphs: A variational approach. Annals of Applied Statistics, 4, 715–42.
32. A.Mc DaidT.N.F.MurphyN.Hurley (2013) Improved Bayesian inference for the stochastic block model with application to large networks. Computational Statistics and Data Analysis, 60, 12–31.
33. R.MiloS.Shen-OrrS.ItzkovitzD.KashtanD.ChklovskiiU.Alon (2002) Network motifs: Simple building blocks of complex networks. Science, 298, 824–27.
34. J.L.Moreno (1934) Who shall survive? A new approach to the problem of human interrelations. Washington DC: Nervous and Mental Disease Publishing.
35. M.NewmanE.Leicht (2007) Mixture models and exploratory analysis in networks. Proceedings of the National Academy of Sciences, 104, 9564–69.
36. M.E.J.Newman (2004) Fast algorithm for detecting community structure in networks. Physical Review Letter E, 69, 0066133.
37. M.E.J.Newman (2006) Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103, 8577–82.
38. A.NobileA.Fearnside (2007) Bayesian finite mixtures with an unknown number of components: the allocation sampler. Statistics and Computing, 17, 147–62.
39. K.NowickiT.A.B.Snijders (2001) Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96, 1077–87.
40. G.PallaA.BarabásiT.Vicsek (2007) Quantifying social group evolution.Nature, 446, 664–67.
41. J.ShiJ.Malik (2000) Normalized cuts and image segmentation. IEEE Transactions on PAMI, 22, 888–905.
42. N.X.VinhJ.Epps (2010) Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. Journal of Machine Learning Research, 11, 2837–54.
43. D.J.WattsS.H.Strogatz (1998) Collective dynamics of small-world networks. Nature, 393, 440–42.
44. H.WhiteS.BoormanR.Breiger (1976) Social structure from multiple networks. I. Blockmodels of roles and positions. American Journal of Sociology, 81, 730–80.
45. J.G.WhiteE.SouthgateJ.N.ThompsonS.Benner (1986) The structure of the nervous system of the nematode caenorhabditis elegans. Philosophical Transactions. Royal Society London B, 314, 1–340.
46. H.ZanghiC.AmbroiseV.Miele (2008) Fast online graph clustering via Erdos–Renyi mixture. Pattern Recognition, 41, 3592–99.
47. H.ZanghiF.PicardV.MieleC.Ambroise (2010) Strategies for online inference of network mixture. Annals of Applied Statistics, 4, 687–714.