Fetching the paper…
Reading the bibliography…
In this paper, we investigate community detection in networks in the presence of node covariates.
Rohe, K., Chatterjee, S. & Yu, B. (2011), ‘Spectral clustering and the high-dimensional stochastic blockmodel’, The Annals of Statistics
1915
Earlier work this paper cites.
Verzelen, N., Arias-Castro, E. et al. (2017), ‘Detection and feature selection in sparse mixture models’, The Annals of Statistics
1950
Earlier work this paper cites.
Holland, P. W., Laskey, K. B. & Leinhardt, S. (1983), ‘Stochastic blockmodels: First steps’, Social networks
1983
Earlier work this paper cites.
Gil-Mendieta, J. & Schmidt, S. (1996), ‘The political network in mexico’, Social Networks
1996
Earlier work this paper cites.
Vempala, S. & Wang, G. (2004), ‘A spectral algorithm for learning mixture models’, Journal of Computer and System Sciences
2004
Earlier work this paper cites.
Dasgupta, S. & Schulman, L. (2007), ‘A probabilistic analysis of em for mixtures of separated, spherical gaussians’, The Journal of Machine Learning Research
2007
Earlier work this paper cites.
Peng, J. & Wei, Y. (2007), ‘Approximating k-means-type clustering via semidefinite programming’, SIAM Journal on Optimization
2007
Earlier work this paper cites.
Von Luxburg, U., Belkin, M. & Bousquet, O. (2008), ‘Consistency of spectral clustering’, The Annals of Statistics
2008
Earlier work this paper cites.
Chaudhuri, K., Kakade, S. M., Livescu, K. & Sridharan, K. (2009), Multi-view clustering via canonical correlation analysis, in
2009
Earlier work this paper cites.
Shi, T., Belkin, M. & Yu, B. (2009), ‘Data spectroscopy: Eigenspaces of convolution operators and clustering’, The Annals of Statistics
2009
Earlier work this paper cites.
2010
Earlier work this paper cites.
Zhang, Y., Levina, E. & Zhu, J. (2016), ‘Community detection in networks with node features’, Electron. J. Statist
2010
Earlier work this paper cites.
Boyd, S., Parikh, N., Chu, E., Peleato, B. & Eckstein, J. (2011), ‘Distributed optimization and statistical learning via the alternating direction method of multipliers’, Foundations and Trends® in Machine Learning
2011
Earlier work this paper cites.
Jacob, U., Thierry, A., Brose, U., Arntz, W. E., Berg, S., Brey, T., Fetzer, I., Jonsson, T., Mintenbeck, K., Mollmann, C. et al. (2011), ‘The role of body size in complex food webs: A cold case’, Advances In Ecological Research
2011
Cited alongside, same era.
Kumar, A., Rai, P. & Daume, H. (2011), Co-regularized multi-view spectral clustering, in
2011
Cited alongside, same era.
Hsu, D., Kakade, S. M. & Zhang, T. (2012), ‘A tail inequality for quadratic forms of subgaussian random vectors’, Electron. Commun. Probab
2012
Cited alongside, same era.
Braverman, M., Makarychev, K., Makarychev, Y. & Naor, A. (2013), The grothendieck constant is strictly smaller than krivine’s bound, in
2013
Cited alongside, same era.
Liu, J., Wang, C., Gao, J. & Han, J. (2013), Multi-view clustering via joint nonnegative matrix factorization, in
2013
Montanari, A. & Sen, S. (2016), Semidefinite programs on sparse random graphs and their application to community detection, in
2016
Closest in time.
Newman, M. E. & Clauset, A. (2016), ‘Structure and inference in annotated networks’, Nature Communications
2016
Closest in time.
2016
Closest in time.
Yan, B. & Sarkar, P. (2016), On robustness of kernel clustering, in
2016
Closest in time.
Balakrishnan, S., Wainwright, M. J. & Yu, B. (2017), ‘Statistical guarantees for the em algorithm: From population to sample-based analysis’, Ann. Statist
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Airoldi, E. M., Blei, D. M., Fienberg, S. E. & Xing, E. P. (2008), ‘Mixed membership stochastic blockmodels’, J. Mach. Learn. Res
2014
Cited alongside, same era.
Yu, Y., Wang, T. & Samworth, R. J. (2014), ‘A useful variant of the davis–kahan theorem for statisticians’, Biometrika
2014
Cited alongside, same era.
Cai, T. T. & Li, X. (2015), ‘Robust and computationally feasible community detection in the presence of arbitrary outlier nodes’, Ann. Statist
2015
Cited alongside, same era.
Guédon, O. & Vershynin, R. (2015), ‘Community detection in sparse networks via grothendieck’s inequality’, Probability Theory and Related Fields
2015
Cited alongside, same era.
2015
Cited alongside, same era.
Yang, L., Sun, D. & Toh, K.-C. (2015), ‘Sdpnal + +: a majorized semismooth newton-cg augmented lagrangian method for semidefinite programming with nonnegative constraints’, Mathematical Programming Computation
2015
Cited alongside, same era.
Chen, Y. & Xu, J. (2016), ‘Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices’, Journal of Machine Learning Research
2016
Cited alongside, same era.
Binkiewicz, N., Vogelstein, J. T. & Rohe, K. (2017), ‘Covariate-assisted spectral clustering’, Biometrika
2017
Closest in time.
Jin, J., Ke, Z. T., Wang, W. et al. (2017), ‘Phase transitions for high dimensional clustering and related problems’, The Annals of Statistics
2017
Closest in time.
Mixon, D. G., Villar, S. & Ward, R. (2017), ‘Clustering subgaussian mixtures by semidefinite programming’, Information and Inference: A Journal of the IMA
2017
Closest in time.
Perry, A. & Wein, A. S. (2017), A semidefinite program for unbalanced multisection in the stochastic block model, in
2017
Closest in time.
2017
Closest in time.
Yan, B., Yin, M. & Sarkar, P. (2017), Convergence of gradient em on multi-component mixture of gaussians, in
2017
Closest in time.
Amini, A. A., Levina, E. et al. (2018), ‘On semidefinite relaxations for the block model’, The Annals of Statistics
2018
Closest in time.
Amini, A. A., Chen, A., Bickel, P. J., Levina, E. et al. (2013), ‘Pseudo-likelihood methods for community detection in large sparse networks’, Ann. Statist
2097
Closest in time.