arrow
返回

Non-Negative Spectral Learning and Sparse Regression-Based Dual-Graph Regularized Feature Selection

delete2018-02-01
delete115
PRE
AI
R
Ronghua Shang *
W
Wenbing Wang
R
Rustam Stolkin
L
Licheng Jiao
DOI:10.1109/TCYB.2017.2657007delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Feature selection is an important approach for reducing the dimension of high-dimensional data. In recent years, many feature selection algorithms have been proposed, but most of them only exploit information from the data space. They often neglect useful information contained in the feature space, and do not make full use of the characteristics of the data. To overcome this problem, this paper proposes a new unsupervised feature selection algorithm, called non-negative spectral learning and sparse regression-based dual-graph regularized feature selection (NSSRD). NSSRD is based on the feature selection framework of joint embedding learning and sparse regression, but extends this framework by introducing the feature graph. By using low dimensional embedding learning in both data space and feature space, NSSRD simultaneously exploits the geometric information of both spaces. Second, the algorithm uses non-negative constraints to constrain the low-dimensional embedding matrix of both feature space and data space, ensuring that the elements in the matrix are non-negative. Third, NSSRD unifies the embedding matrix of the feature space and the sparse transformation matrix. To ensure the sparsity of the feature array, the sparse transformation matrix is constrained using the L-2,L-1-norm. Thus feature selection can obtain accurate discriminative information from these matrices. Finally, NSSRD uses an iterative and alternative updating rule to optimize the objective function, enabling it to select the representative features more quickly and efficiently. This paper explains the objective function, the iterative updating rules and a proof of convergence. Experimental results show that NSSRD is significantly more effective than several other feature selection algorithms from the literature, on a variety of test data.
Keyword:
Dual-graph
feature selection
non-negative spectral learning
sparse regression
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

U
University of Birmingham
学者数:
4.1W
论文数: 3.8W
被引数: 5.0W
X
Xidian University
学者数:
2.4W
论文数: 1.9W
被引数: 9.7K
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
A root cause analysis toolkit for TCP
err2008-06-01
err0
PREAI
errMatti Siekkinen; Guillaume Urvoy-Keller; Ernst W. Biersack; Denis Collange
err分享
err收藏
Incremental learning for ν-Support Vector RegressionΝ-支持向量回归的增量学习
err2015-07-01
err432
PREAI
errGu, Bin; Sheng, Victor S.; Wang, Zhijie; Ho, Derek; Osman, Said; Li, Shuo
err分享
err收藏
Evolution of structural and optical properties of photocatalytic Fe doped TiO2 thin films prepared by RF magnetron sputtering
err2014-01-01
err0
PREAI
errPrabitha B. Nair; L. V. Maneeshya; V. B. Justinvictor; Georgi P. Daniel; K. Joy; P. V. Thomas
err分享
err收藏
Soft Robotics: A Review of Recent Developments of Pneumatic Soft Actuators
err2020-01-10
err0
errOAAI
errJames Walker; Thomas Zidek; Cory Harbel; Sanghyun Yoon; F. Sterling Strickland; Srinivas Kumar; Minchul Shin
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容