arrow
Return

Multi-view feature selection via Nonnegative Structured Graph Learning

delete2020-04-01
delete50
PRE
AI
X
Xiangpin Bai
L
Lei Zhu *
C
Cheng Liang
J
Jingjing Li
X
Xiushan Nie
Xiaojun Chang cover
Xiaojun Chang (Xiaojun Chang)
DOI:10.1016/j.neucom.2020.01.044delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Graph-based solutions have achieved state-of-the-art performance on unsupervised multi-view feature selection. However, existing methods generally characterize the sample similarities first by constructing multiple fixed graphs with manually determined parameters, and then perform the feature selection on a composite one. They will suffer from two severe problems: (1) The fixed graphs may be unreliable as the raw multi-view features usually contain adverse noises and cannot accurately capture the intrinsic sample relations. (2) The graph construction and feature selection are separate and independent, the two-step learning may lead to sub-optimal performance. To tackle these problems, in this paper, we propose an effective unsupervised multi-view feature selection method, dubbed as Nonnegative Structured Graph Learning (NSGL). Specifically, we develop a unified learning framework, which directly learns the structured graph from the raw features by imposing a rank constraint, and simultaneously performs adaptive feature selection with exploiting the complementarity of multi-view features. Besides, we introduce the pseudo label learning to extract the discriminative semantic information in unsupervised scenarios and steer the graph learning process. The informative features are finally selected by forcing the feature selection matrix to be sparse in rows with sparse regression. To solve the challenging optimization problem, we first transform the formulated problem into an equivalent one that can be tackled more easily, and then develop an efficient alternate optimization algorithm guaranteed with convergence to calculate the solution iteratively. Extensive experiments on several widely tested benchmarks demonstrate the superiority of NSGL compared with several state-of-the-art approaches. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Unsupervised multi-view feature selection
Structured graph
Pseudo label learning
Alternate optimization
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

M
Monash University
Scholars:
5.4W
Papers: 5.4W
Citations: 79
S
shandong jianzhu university
Scholars:
4.3K
Papers: 3.1K
Citations: 3
S
shandong normal university
Scholars:
1.0W
Papers: 8.2K
Citations: 3
researcher View more organizations
Cited Papers

Cited Papers

Heterogeneous Domain Adaptation Through Progressive Alignment
err2019-05-01
err169
PREAI
errLi, Jingjing; Lu, Ke; Huang, Zi; Zhu, Lei; Shen, Heng Tao
errShare
errSave
errShare
errSave
PAP Inhibitor with In Vivo Efficacy Identified by Candida albicans Genetic Profiling of Natural Products
err2008-04-01
err0
errOAAI
errBo Jiang; Deming Xu; John Allocco; Craig Parish; John Davison; Karynn Veillette; Susan Sillaots; Wenqi Hu; Roberto Rodriguez-Suarez; Steve Trosok; Li Zhang; Yang Li; Fariba Rahkhoodaee; Tara Ransom; Nick Martel; Hao Wang; Daniel Gauvin; Judyann Wiltsie; Douglas Wisniewski; Scott Salowe; Jennifer Nielsen Kahn; Ming-Jo Hsu; Robert Giacobbe; George Abruzzo; Amy Flattery; Charles Gill; Phil Youngman; Ken Wilson; Gerald Bills; Gonzalo Platas; Fernando Pelaez; Maria Teresa Diez; Sarah Kauffman; Jeff Becker; Guy Harris; Paul Liberator; Terry Roemer
errShare
errSave
errShare
errSave
Intrinsically Bayesian robust Karhunen-Loeve compression
err2018-03-01
err12
PREAI
errDehghannasiri, Roozbeh; Qian, Xiaoning; Dougherty, Edward R.
errShare
errSave
researcher View more