arrow
Return

Identifying the most informative features using a structurally interacting elastic net

delete2019-04-01
delete16
delete
OA
AI
崔丽欣 cover
崔丽欣 (Lixin Cui)
白璐 (Lu Bai) *
Z
Zhihong Zhang
Y
Yue Wang
E
Edwin R. Hancock
DOI:10.1016/j.neucom.2018.06.081delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Feature selection can efficiently identify the most informative features with respect to the target feature used in training. However, state-of-the-art vector-based methods are unable to encapsulate the relationships between feature samples into the feature selection process, thus leading to significant information loss. To address this problem, we propose a new graph-based structurally interacting elastic net method for feature selection. Specifically, we commence by constructing feature graphs that can incorporate pair-wise relationship between samples. With the feature graphs to hand, we propose a new information theoretic criterion to measure the joint relevance of different pairwise feature combinations with respect to the target feature graph representation. This measure is used to obtain a structural interaction matrix where the elements represent the proposed information theoretic measure between feature pairs. We then formulate a new optimization model through the combination of the structural interaction matrix and an elastic net regression model for the feature subset selection problem. This allows us to (a) preserve the information of the original vectorial space, (b) remedy the information loss of the original feature space caused by using graph representation, and (c) promote a sparse solution and also encourage correlated features to be selected. Because the proposed optimization problem is non-convex, we develop an efficient alternating direction multiplier method (ADMM) to locate the optimal solutions. Extensive experiments on various datasets demonstrate the effectiveness of the proposed method. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Feature selection
Graph
Interacting elastic net
Sparse
ADMM
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

U
university of york - uk
Scholars:
1.5W
Papers: 1.5W
Citations: 15
C
central university of finance & economics
Scholars:
1.8K
Papers: 2.0K
Citations: 2
X
xiamen university
Scholars:
5.8W
Papers: 3.8W
Citations: 67
researcher View more organizations