Fetching the paper…
Reading the bibliography…
A common data mining task on networks is community detection, which seeks an unsupervised decomposition of a network into structural groups based on statistical regularities in the network's connectivity.
J. Rissanen, “Modeling by shortest data description,” Automatica , vol. 14, no. 5, pp. 465–471, 1978
1978
Earlier work this paper cites.
G. Schwarz et al. , “Estimating the dimension of a model,” Ann. Stat. , vol. 6, no. 2, pp. 461–464, 1978
1978
Earlier work this paper cites.
P. W. Holland, K. B. Laskey, and S. Leinhardt, “Stochastic blockmodels: First steps,” Soc. Netw. , vol. 5, no. 2, pp. 109–137, 1983
1983
Earlier work this paper cites.
N. Alon, M. Krivelevich, and B. Sudakov, “Finding a large hidden clique in a random graph,” Rand. Struct. Alg. , vol. 13, no. 3-4, pp. 457–466, 1998
1998
Earlier work this paper cites.
C. Biernacki, G. Celeux, and G. Govaert, “Assessing a mixture model for clustering with the integrated completed likelihood,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 22, no. 7, pp. 719–725, 2000
2000
Earlier work this paper cites.
A. Condon and R. M. Karp, “Algorithms for graph partitioning on the planted partition model,” Rand. Struct. Alg. , vol. 18, no. 2, pp. 116–140, 2001
2001
Earlier work this paper cites.
M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Phys. Rev. E , vol. 69, no. 2, p. 026113, 2004
2004
Earlier work this paper cites.
C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda, “Learning systems of concepts with an infinite relational model,” in AAAI Conf. on Artificial Intelligence , 2006, pp. 381–388
2006
Earlier work this paper cites.
M. E. J. Newman, “Modularity and community structure in networks,” Proc. Natl. Acad. Sci. USA , vol. 103, no. 23, pp. 8577–8582, 2006
2006
Earlier work this paper cites.
M. Sales-Pardo, R. Guimerá, A. A. Moreira, and L. A. N. Amaral, “Extracting the hierarchical organization of complex systems,” Proc. Natl. Acad. Sci. USA , vol. 104, pp. 15 224–15 229, 2007
2007
Earlier work this paper cites.
S. Fortunato and M. Barthelemy, “Resolution limit in community detection,” Proc. Natl. Acad. Sci. USA , vol. 104, no. 1, pp. 36–41, 2007
2007
Earlier work this paper cites.
J. M. Kumpula, J. Saramäki, K. Kaski, and J. Kertész, “Limited resolution in complex network community detection with Potts model approach,” Eur. Phys. J. B , vol. 56, no. 1, pp. 41–45, 2007
2007
Earlier work this paper cites.
J. M. Hofman and C. H. Wiggins, “Bayesian approach to network modularity,” Phys. Rev. Lett. , vol. 100, no. 25, p. 258701, 2008
2008
Earlier work this paper cites.
J.-J. Daudin, F. Picard, and S. Robin, “A mixture model for random graphs,” Stat. Comput. , vol. 18, no. 2, pp. 173–183, 2008
2008
Earlier work this paper cites.
M. Rosvall and C. T. Bergstrom, “Maps of random walks on complex networks reveal community structure,” Proc. Natl. Acad. Sci. USA , vol. 105, no. 4, pp. 1118–1123, 2008
2008
Earlier work this paper cites.
P. Hoff, “Modeling homophily and stochastic equivalence in symmetric relational data,” in Adv. Neural Info. Proc. Sys. , 2008, pp. 657–664
2008
Earlier work this paper cites.
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of statistical mechanics: theory and experiment , vol. 2008, no. 10, p. P10008, 2008
2008
Earlier work this paper cites.
A. Clauset, C. Moore, and M. E. J. Newman, “Hierarchical structure and the prediction of missing links in networks,” Nature , vol. 453, pp. 98–101, 2008
2008
Earlier work this paper cites.
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing, “Mixed membership stochastic blockmodels,” J. Mach. Learn. Res. , vol. 9, no. Sep, pp. 1981–2014, 2008
2008
Earlier work this paper cites.
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, “Statistical properties of community structure in large social and information networks,” in Proceedings of the 17th International Conference on World Wide Web . ACM, 2008, pp. 695–704
2008
Earlier work this paper cites.
M. A. Porter, J.-P. Onnela, and P. J. Mucha, “Communities in networks,” Notices of the American Mathematical Society , vol. 56, no. 9, pp. 1082–1097, 1164–1166, 2009
2009
Earlier work this paper cites.
R. Guimerà and M. Sales-Pardo, “Missing and spurious interactions and the reconstruction of complex networks,” Proc. Natl. Acad. Sci. USA , vol. 106, no. 52, pp. 22 073–22 078, 2009
2009
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,” Physics Reports , vol. 486, pp. 75–174, 2010
2010
Earlier work this paper cites.
N. X. Vinh, J. Epps, and J. Bailey, “Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance,” J. Mach. Learn. Res. , vol. 11, no. Oct, pp. 2837–2854, 2010
2010
Earlier work this paper cites.
B. Karrer and M. E. J. Newman, “Stochastic blockmodels and community structure in networks,” Phys. Rev. E , vol. 83, no. 1, p. 016107, 2011
2011
Earlier work this paper cites.
A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato, “Finding statistically significant communities in networks,” PloS one , vol. 6, no. 4, p. e18961, 2011
2011
Cited alongside, same era.
M. Rosvall and C. T. Bergstrom, “Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems,” PloS one , vol. 6, no. 4, p. e18209, 2011
2011
Cited alongside, same era.
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, “Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications,” Phys. Rev. E , vol. 84, no. 6, p. 066106, 2011
2011
Cited alongside, same era.
L. Lü and T. Zhou, “Link prediction in complex networks: A survey,” Physica A , vol. 390, no. 6, pp. 1150–1170, 2011
2011
Cited alongside, same era.
A. V. Esquivel and M. Rosvall, “Compression of flow can reveal overlapping-module organization in networks,” Phys. Rev. X , vol. 1, no. 2, p. 021025, 2011
C. Aicher, A. Z. Jacobs, and A. Clauset, “Learning latent block structure in weighted networks,” J. Complex Networks , vol. 3, no. 2, pp. 221–248, 2015
2015
Later among the works it cites.
T. P. Peixoto, “Model selection and hypothesis testing for large-scale network models with overlapping groups,” Phys. Rev. X , vol. 5, no. 1, p. 011033, 2015
2015
Later among the works it cites.
K. Hayashi, S.-i. Maeda, and R. Fujimaki, “Rebuilding factorized information criterion: Asymptotically accurate marginal likelihood,” in Int. Conf. on Mach. Learn. , 2015
2015
Later among the works it cites.
X. Yan, “Bayesian model selection of stochastic block models,” in IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) . IEEE, 2016, pp. 323–328
2016
Later among the works it cites.
K. Chen and J. Lei, “Network cross-validation for determining the number of communities in network data,” J. Am. Stat. Assoc. , no. just-accepted, 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
P. Zhang, F. Krzakala, J. Reichardt, and L. Zdeborová, “Comparative study for inference of hidden classes in stochastic block models,” J. Stat. Mech. Theor. Exp. , vol. 2012, no. 12, p. P12021, 2012
2012
Cited alongside, same era.
M. Mørup and M. N. Schmidt, “Bayesian community detection,” Neural computation , vol. 24, no. 9, pp. 2434–2456, 2012
2012
Cited alongside, same era.
D. S. Choi, P. J. Wolfe, and E. M. Airoldi, “Stochastic blockmodels with a growing number of classes,” Biometrika , p. asr053, 2012
2012
Cited alongside, same era.
P. Latouche, E. Birmele, and C. Ambroise, “Variational bayesian inference and complexity control for stochastic block models,” Statistical Modelling , vol. 12, no. 1, pp. 93–115, 2012
2012
Cited alongside, same era.
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, “Spectral redemption in clustering sparse networks,” Proc. Natl. Acad. Sci. , vol. 110, no. 52, pp. 20 935–20 940, 2013
2013
Cited alongside, same era.
T. P. Peixoto, “Parsimonious module inference in large networks,” Phys. Rev. Lett. , vol. 110, no. 14, p. 148701, 2013
2013
Cited alongside, same era.
B. D. Fulcher, M. A. Little, and N. S. Jones, “Highly comparative time-series analysis: the empirical structure of time series and their methods,” J. Royal Soc. Interface , vol. 10, no. 83, p. 20130048, 2013
2013
Cited alongside, same era.
2016
Later among the works it cites.
S. Fortunato and D. Hric, “Community detection in networks: A user guide,” Physics Reports , vol. 659, pp. 1–44, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. E. J. Newman and G. Reinert, “Estimating the number of communities in a network,” Phys. Rev. Lett. , vol. 117, no. 7, p. 078301, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Montanari and S. Sen, “Semidefinite programs on sparse random graphs and their application to community detection,” in Proceedings of the forty-eighth annual ACM Symposium on Theory of Computing . ACM, 2016, pp. 814–827
2016
Later among the works it cites.
A. Clauset, E. Tucker, and M. Sainz, “The Colorado Index of Complex Networks.” https://icon.colorado.edu/ , 2016
2016
Later among the works it cites.
Y. Chen and J. Xu, “Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices,” J. Mach. Learn. Res. , vol. 17, no. 27, pp. 1–57, 2016
2016
Later among the works it cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . ACM, 2016, pp. 855–864
2016
Later among the works it cites.
P. J. Bickel and P. Sarkar, “Hypothesis testing for automated community detection in networks,” J. R. Stat. Soc. Series B Stat. Methodol. , vol. 78, no. 1, pp. 253–273, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
T. P. Peixoto, “Bayesian stochastic blockmodeling,” arXiv:1705.10225 , 2017
2017
Later among the works it cites.
Y. R. Wang, P. J. Bickel et al. , “Likelihood-based model selection for stochastic block models,” Ann. Stat. , vol. 45, no. 2, pp. 500–528, 2017
2017
Later among the works it cites.
T. Kawamoto and Y. Kabashima, “Cross-validation estimate of the number of clusters in a network,” Sci. Rep. , vol. 7, 2017
2017
Later among the works it cites.
L. Peel, D. B. Larremore, and A. Clauset, “The ground truth about metadata and community detection in networks,” Sci. Adv. , vol. 3, no. 5, p. e1602548, 2017
2017
Later among the works it cites.
T. P. Peixoto, “Nonparametric bayesian inference of the microcanonical stochastic block model,” Phys. Rev. E , vol. 95, no. 1, p. 012317, 2017
2017
Later among the works it cites.
T. Kawamoto and Y. Kabashima, “Comparative analysis on the selection of number of clusters in community detection,” Phys. Rev. E , vol. 97, no. 2, p. 022315, 2018
2018
Closest in time.
T. Vallés-Catalá, T. P. Peixoto, R. Guimerà, and M. Sales-Pardo, “Consistencies and inconsistencies between model selection and link prediction in networks,” Phys. Rev. E , vol. 97, p. 062316, 2018
2018
Closest in time.
P.-Y. Chen and A. O. Hero, “Phase transitions and a model order selection criterion for spectral graph clustering,” IEEE Trans. Signal Process. , vol. 66, no. 13, pp. 3407–3420, 2018
2018
Closest in time.