Fetching the paper…
Reading the bibliography…
We establish sufficient conditions of exact and almost full recovery of the node partition in Bipartite Stochastic Block Model (BSBM) using polynomial time algorithms.
1910
Earlier work this paper cites.
1911
Earlier work this paper cites.
[author] Holland, Paul WP. W., Laskey, Kathryn BlackmondK. B. and Leinhardt, SamuelS. (1983). Stochastic blockmodels: First steps. Social networks 5 109–137
1983
Earlier work this paper cites.
Dhillon, I. S
2001
Earlier work this paper cites.
[author] Tropp, Joel AJ. A. (2012). User-friendly tail bounds for sums of random matrices. Foundations of computational mathematics 12 389–434
2012
Earlier work this paper cites.
[author] Eren, KemalK., Deveci, MehmetM., Küçüktunç, OnurO. and Çatalyürek, Ümit VÜ. V. (2013). A comparative analysis of biclustering algorithms for gene expression data. Briefings in bioinformatics 14 279–292
2013
Earlier work this paper cites.
[author] Larremore, Daniel BD. B., Clauset, AaronA. and Buckee, Caroline OC. O. (2013). A network approach to analyzing highly recombinant malaria parasite genes. PLoS Comput Biol 9 e1003268
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
Massoulié, L
2014
Earlier work this paper cites.
[author] Abbe, EmmanuelE., Bandeira, Afonso SA. S. and Hall, GeorginaG. (2015). Exact recovery in the stochastic block model. IEEE Transactions on Information Theory 62 471–487
2015
Cited alongside, same era.
[author] Bandeira, Afonso SA. S. (2015). Concentration Inequalities, Scalar and Matrix Versions. Lectures notes. http://math.mit.edu/~bandeira/2015_18.S096_4_Concentration_Inequalities.pdf
2015
Cited alongside, same era.
Bordenave, C
2015
Cited alongside, same era.
Feldman, V
2015
Cited alongside, same era.
[author] Bandeira, Afonso SA. S. and Van Handel, RamonR. (2016). Sharp nonasymptotic bounds on the norm of random matrices with independent entries. The Annals of Probability 44 2479–2506
2016
Cited alongside, same era.
Florescu, L
[author] Feldman, VitalyV., Perkins, WillW. and Vempala, SantoshS. (2018). On the complexity of random satisfiability problems with planted solutions. SIAM Journal on Computing 47 1294–1338
2018
Later among the works it cites.
[author] Mossel, ElchananE., Neeman, JoeJ. and Sly, AllanA. (2018). A proof of the block model threshold conjecture. Combinatorica 38 665–708
2018
Later among the works it cites.
2018
Later among the works it cites.
Neumann, S
2018
Later among the works it cites.
[author] Vershynin, RomanR. (2018). High-dimensional probability: An introduction with applications in data science 47. Cambridge University Press
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Cited alongside, same era.
Royer, M
2017
Cited alongside, same era.
[author] Jang, Se WonS. W., Kim, SimonS. and Ha, JJ. Graph-based recommendation systems: Comparison analysis between traditional clustering techniques and neural embedding
Cited in the paper.
[author] Giraud, ChristopheC. and Verzelen, NicolasN. (2019). Partial recovery bounds for clustering with the relaxed K K -means. Mathematical Statistics and Learning 1 317–374
2019
Closest in time.
[author] Zhou, ZhixinZ. and Amini, Arash AA. A. (2019). Analysis of spectral clustering algorithms for community detection: the general bipartite setting. J. Mach. Learn. Res. 20 47–1
2019
Closest in time.
[author] Abbe, EmmanuelE., Fan, JianqingJ. and Wang, KaizhengK. (2020). An ℓ p \ell_{p} theory of PCA and spectral clustering
2020
Closest in time.
[author] Zhou, ZhixinZ. and Amini, Arash AA. A. (2020). Optimal Bipartite Network Clustering. Journal of Machine Learning Research 21 1–68
2020
Closest in time.