Supervised feature selection in graphs with path coding penalties and network flows
From MaRDI portal
Abstract: We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph with few connected components; by exploiting prior knowledge, one can indeed improve the prediction performance or obtain results that are easier to interpret. Regularization or penalty functions for selecting features in graphs have recently been proposed, but they raise new algorithmic challenges. For example, they typically require solving a combinatorially hard selection problem among all connected subgraphs. In this paper, we propose computationally feasible strategies to select a sparse and well-connected subset of features sitting on a directed acyclic graph (DAG). We introduce structured sparsity penalties over paths on a DAG called "path coding" penalties. Unlike existing regularization functions that model long-range interactions between features in a graph, path coding penalties are tractable. The penalties and their proximal operators involve path selection problems, which we efficiently solve by leveraging network flow optimization. We experimentally show on synthetic, image, and genomic data that our approach is scalable and leads to more connected subgraphs than other regularization functions for graphs.
Recommendations
- Simultaneous supervised clustering and feature selection over a graph
- Graph structured sparse subset selection
- Variable selection and regression analysis for graph-structured covariates with an application to genomics
- Supervised learning via the “hubNet” procedure
- Convex optimization for group feature selection in networked data
Cited in
(7)- Finding the best not the most: regularized loss minimization subgraph selection for graph classification
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- Minimum distance Lasso for robust high-dimensional regression
- Simultaneous supervised clustering and feature selection over a graph
- Graph-based regularization for regression problems with alignment and highly correlated designs
- Convex relaxations of penalties for sparse correlated variables with bounded total variation
- Network assisted analysis to reveal the genetic basis of autism
This page was built for publication: Supervised feature selection in graphs with path coding penalties and network flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933903)
