arrow
Return

High-dimensional supervised feature selection via optimized kernel mutual information

delete2018-10-01
delete16
PRE
AI
N
Ning Bi
J
Jun Tan *
J
Jianhuang Lai
C
Ching Y. Suen
DOI:10.1016/j.eswa.2018.04.037delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Feature selection is very important for pattern recognition to reduce the dimensions of data and to improve the efficiency of learning algorithms. Recent research on new approaches has focused mostly on improving accuracy and reducing computing time. This paper presents a flexible feature-selection method based on an optimized kernel mutual information (OKMI) approach. Mutual information (MI) has been applied successfully in decision trees to rank variables; its aim is to connect class labels with the distribution of experimental data. The use of MI removes irrelevant features and decreases redundant features. However, MI is usually less robust when the data distribution is not centralized. To overcome this problem, we propose to use the OKMI approach, which combines MI and a kernel function. This approach may be used for feature selection with nonlinear models by defining kernels for feature vectors and class-label vectors. By optimizing the objection equations, we develop a new feature-selection algorithm that combines both Ml and kernel learning, we discuss the relationship among various kernel-selection methods. Experiments were conducted to compare the new technique applied to various data sets with other methods, and in each case the OKMI approach performs better than the other methods in terms of feature-classification accuracy and computing time. OKMI method solves the problem of computation complexity in the probability of distribution, and avoids this problem by finding the optimal features at very low computational cost. As a result, the OKMI method with the proposed algorithm is effective and robust over a wide range of real applications on expert systems. Crown Copyright (C) 2018 Published by Elsevier Ltd. All rights reserved.
Keywords:
Feature selection
Kernel method
Mutual information
Classification
Optimize function
Machine learning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Expert Systems with Applications cover
Expert Systems with Applications
IF:
7.5
Papers:
3.0W
Citations:
10.2W

Organization

S
Sun Yat Sen University
Scholars:
9.9W
Papers: 7.2W
Citations: 95
C
concordia university - canada
Scholars:
8.0K
Papers: 8.9K
Citations: 4
Cited Papers

Cited Papers

Subspace learning for unsupervised feature selection via matrix factorization
err2015-01-01
err142
PREAI
errWang, Shiping; Pedrycz, Witold; Zhu, Qingxin; Zhu, William
errShare
errSave
errShare
errSave
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
err1998-07-01
err0
errOAAI
errBernhard Schölkopf; Alexander Smola; Klaus-Robert Müller
errShare
errSave
Choosing multiple parameters for support vector machines
err2002-01-01
err2.0K
errOAAI
errChapelle, O; Vapnik, V; Bousquet, O; Mukherjee, S
errShare
errSave
An energy-aware routing protocol for wireless sensor network based on genetic algorithm
err2017-06-22
err0
PREAI
errLingping Kong; Jeng-Shyang Pan; Václav Snášel; Pei-Wei Tsai; Tien-Wen Sung
errShare
errSave
errShare
errSave
errShare
errSave
researcher View more