4.7 Article

Graph Structured Sparse Subset Selection

Journal

INFORMATION SCIENCES
Volume 518, Issue -, Pages 71-94

Publisher

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

Keywords

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

Funding

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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available