R.I.P.
👻
Ghosted
Spectral Clustering and Block Models: A Review And A New Algorithm
August 07, 2015 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Sharmodeep Bhattacharyya, Peter J. Bickel
arXiv ID
1508.01819
Category
math.ST
Cross-listed
cs.SI,
stat.ML
Citations
9
Venue
arXiv.org
Last Checked
2 months ago
Abstract
We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to perform optimally both theoretically using asymptotic theory and empirically.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — math.ST
R.I.P.
👻
Ghosted
An introduction to Topological Data Analysis: fundamental and practical aspects for data scientists
R.I.P.
👻
Ghosted
Minimax Optimal Procedures for Locally Private Estimation
R.I.P.
👻
Ghosted
Optimal Best Arm Identification with Fixed Confidence
R.I.P.
👻
Ghosted
Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees
R.I.P.
👻
Ghosted
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted