Graph-Sparse Logistic Regression
Not on the map. Why?
Abstract (arXiv)
We introduce Graph-Sparse Logistic Regression, a new algorithm for classification for the case in which the support should be sparse but connected on a graph. We val- idate this algorithm against synthetic data and benchmark it against L1-regularized Logistic Regression. We then explore our technique in the bioinformatics context of proteomics data on the interactome graph. We make all our experimental code public and provide GSLR as an open source package.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 15 Dec 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023On Regularized Sparse Logistic Regressioncited by 1
- 2023On Regularized Sparse Logistic Regression12 Sep 2023