pith. sign in

arxiv: 1712.05510 · v1 · pith:INV7AO7Tnew · submitted 2017-12-15 · 💻 cs.LG · stat.ML

Graph-Sparse Logistic Regression

classification 💻 cs.LG stat.ML
keywords logisticregressionalgorithmdatagraphgraph-sparsebenchmarkbioinformatics
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.