arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.4539stat.MLcs.LGmath.OC
收藏

具有路径编码惩罚和网络流的图的有监督特征选择

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

INRIA Grenoble Rhône-Alpes(法国国立信息与自动化研究院格勒诺布尔罗讷-阿尔卑斯中心)

Julien Mairal, Bin Yu

摘要:

我们考虑监督学习问题,其中特征嵌入在图中,例如基因网络中的基因表达。在这种情况下,它是非常感兴趣的自动选择一个子图与几个连接组件;通过利用先验知识,确实可以提高预测性能或获得更容易解释的结果。最近提出了用于选择图中特征的正则化或惩罚函数,但它们提出了新的算法挑战。例如,它们通常需要解决所有连通子图之间的组合硬选择问题。在本文中,我们提出了计算上可行的策略来选择一个稀疏和良好连接的功能子集坐在一个有向无环图(DAG)。我们引入结构化稀疏惩罚路径上的DAG称为“路径编码”的处罚。与现有的正则化函数不同,这些正则化函数对图中特征之间的远程交互进行建模,路径编码惩罚是易于处理的。惩罚及其邻近算子涉及路径选择问题,我们利用网络流优化有效地解决了这个问题。我们在合成,图像和基因组数据上的实验表明,我们的方法是可扩展的,并且比图的其他正则化函数导致更多的连接子图。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑