arrow
返回

A Kernel Partial least square based feature selection method

delete2018-11-01
delete32
delete
OA
AI
U
Upasana Talukdar *
S
Shyamanta M. Hazarika
J
John Q. Gan
DOI:10.1016/j.patcog.2018.05.012delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Maximum relevance and minimum redundancy (mRMR) has been well recognised as one of the best feature selection methods. This paper proposes a Kernel Partial Least Square (KPLS) based mRMR method, aiming for easy computation and improving classification accuracy for high-dimensional data. Experiments with this approach have been conducted on seven real-life datasets of varied dimensionality and number of instances, with performance measured on four different classifiers: Naive Bayes, Linear Discriminant Analysis, Random Forest and Support Vector Machine. Experimental results have exhibited the advantage of the proposed method over several competing feature selection techniques. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Feature selection
Kernel partial least square
Regression coefficients
Relevance
Classification
AI总结

AI总结

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

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

I
indian institute of technology (iit) - guwahati
学者数:
3.3K
论文数: 3.2K
被引数: 2
T
Tezpur University
学者数:
2.2K
论文数: 1.9K
被引数: 2.4K
I
indian institute of technology system (iit system)
学者数:
9.5W
论文数: 9.9W
被引数: 93
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Weighted Multi-view Clustering with Feature. Selection
err2016-05-01
err157
PREAI
errXu, Yu-Meng; Wang, Chang-Dong; Lai, Jian-Huang
err分享
err收藏
学者 查看更多内容