Sparse learning of the disease severity score for high-dimensional data
Summary: Learning disease severity scores automatically from collected measurements may aid in the quality of both healthcare and scientific understanding. Some steps in that direction have been taken and machine learning algorithms for extracting scoring functions from data have been proposed. Given the rapid increase in both quantity and diversity of data measured and stored, the large amount of information is becoming one of the challenges for learning algorithms. In this work, we investigate the direction of the problem where the dimensionality of measured variables is large. Learning the severity score in such cases brings the issue of which of measured features are relevant. We propose a novel approach by combining desirable properties of existing formulations, which compares favorably to alternatives in accuracy and especially in the robustness of the learned scoring function. The proposed formulation has a nonsmooth penalty that induces sparsity. This problem is solved by addressing a dual formulation which is smooth and allows an efficient optimization. The proposed approach might be used as an effective and reliable tool for both scoring function learning and biomarker discovery, as demonstrated by identifying a stable set of genes related to influenza symptoms' severity, which are enriched in immune-related processes.
- Elastic-net regularization in learning theory
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Regularization and Variable Selection Via the Elastic Net
- Statistical challenges of high-dimensional data
- Statistics for high-dimensional data. Methods, theory and applications.
This page was built for publication: Sparse learning of the disease severity score for high-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693802)
