4.7 Article

A Kernel Partial least square based feature selection method

期刊

PATTERN RECOGNITION
卷 83, 期 -, 页码 91-106

出版社

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

关键词

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

资金

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据