4.7 Article

A Kernel Partial least square based feature selection method

Journal

PATTERN RECOGNITION
Volume 83, Issue -, Pages 91-106

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2018.05.012

Keywords

Feature selection; Kernel partial least square; Regression coefficients; Relevance; Classification

Funding

  1. MHRD as Centre of Excellence on Machine Learning Research and Big Data Analysis
  2. DST-UKEIRI Project [DST/INT/UK/P-91/2014]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available