# Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows

20 Apr 2012Julien MairalBin Yu

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... (read more)

PDF Abstract