Sparse generalized linear model with L 0 approximation for feature selection and prediction with big omics data

Zhenqiu Liu, Fengzhu Sun, Dermot P. McGovern

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Background: Feature selection and prediction are the most important tasks for big data mining. The common strategies for feature selection in big data mining are L 1, SCAD and MC+. However, none of the existing algorithms optimizes L 0, which penalizes the number of nonzero features directly. Results: In this paper, we develop a novel sparse generalized linear model (GLM) with L 0 approximation for feature selection and prediction with big omics data. The proposed approach approximate the L 0 optimization directly. Even though the original L 0 problem is non-convex, the problem is approximated by sequential convex optimizations with the proposed algorithm. The proposed method is easy to implement with only several lines of code. Novel adaptive ridge algorithms (L 0ADRIDGE) for L 0 penalized GLM with ultra high dimensional big data are developed. The proposed approach outperforms the other cutting edge regularization methods including SCAD and MC+ in simulations. When it is applied to integrated analysis of mRNA, microRNA, and methylation data from TCGA ovarian cancer, multilevel gene signatures associated with suboptimal debulking are identified simultaneously. The biological significance and potential clinical importance of those genes are further explored. Conclusions: The developed Software L 0ADRIDGE in MATLAB is available at https://github.com/liuzqx/L0adridge.

Original languageEnglish (US)
Article number39
JournalBioData Mining
Volume10
Issue number1
DOIs
Publication statusPublished - Dec 19 2017

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Biochemistry
  • Molecular Biology
  • Genetics
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this