Graph-Sparse Logistic Regression
Alexander LeNail, Ludwig Schmidt, Johnathan Li et al. · arXiv (Cornell University) · 2017
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.
Cited by 1 works. doi:10.48550/arxiv.1712.05510 Open-access PDF
Authors
- Alexander LeNail
- Ludwig Schmidt
- Johnathan Li
- Tobias Ehrenberger
- Karen Sachs
- Stefanie Jegelka
- Ernest Fraenkel
References
- Regression Shrinkage and Selection Via the Lasso
- Scikit-learn: Machine Learning in Python
- Model Selection and Estimation in Regression with Grouped Variables
- Group lasso with overlap and graph lasso
- A Sparse-Group Lasso
- Most Random Gene Expression Signatures Are Significantly Associated with Breast Cancer Outcome
- A scored human protein–protein interaction network to catalyze genomic interpretation
- Learning with Structured Sparsity
- Network-Based Interpretation of Diverse High-Throughput Datasets through the Omics Integrator Software Package
- A Nearly-Linear Time Framework for Graph-Structured Sparsity