4.7 Article

Graph Structured Sparse Subset Selection

期刊

INFORMATION SCIENCES
卷 518, 期 -, 页码 71-94

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2019.12.086

关键词

Variable subset selection; Graph structure; Constrained regression; Discrete optimization

资金

  1. Korea Institute for Advancement of Technology (KIAT) - Korea Government (MOTIE) [P0008691]
  2. National Research Foundation of Korea - Korea government (MSIT) [NRF-2019R1A4A1024732]

向作者/读者索取更多资源

We propose a new method for variable subset selection and regression coefficient estimation in linear regression models that incorporates a graph structure of the predictor variables. The proposed method is based on the cardinality constraint that controls the number of selected variables and the graph structured subset constraint that encourages the predictor variables adjacent in the graph to be simultaneously selected or eliminated from the model. Moreover, we develop an efficient discrete projected gradient descent method to handle the NP-hardness of the problem originating from the discrete constraints. Numerical experiments on simulated and real-world data are conducted to demonstrate the usefulness and applicability of the proposed method by comparing it with existing graph regularization methods in terms of the predictive accuracy and variable selection performance. The results confirm that the proposed method outperforms the existing methods. (C) 2020 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据