A Kernel Partial least square based feature selection method

Upasana Talukdar

doi:10.1016/j.patcog.2018.05.012

A Kernel Partial least square based feature selection method

2018-11-01

32

OA

AI

U

Upasana Talukdar *

S

Shyamanta M. Hazarika

J

John Q. Gan

DOI：10.1016/j.patcog.2018.05.012

Original

Save

View PDF

Abstract

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.

Keywords:

Feature selection

Kernel partial least square

Regression coefficients

Relevance

Classification

A Kernel Partial least square based feature selection method

Abstract

AI Summary

Journal

Organization