A Noise-Aware Feature Selection Approach for Classification
No Thumbnail Available
Date
2021
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
A noise-aware version of support vector machines is utilized for feature selection in this paper. Combining this method and sequential backward search (SBS), a new algorithm for removing irrelevant features is proposed. Although feature selection methods in the literature which utilize support vector machines have provided acceptable results, noisy samples and outliers may affect the performance of SVM and feature selections method, consequently. Recently, we have proposed relaxed constrains SVM (RSVM) which handles noisy data and outliers. Each training sample in RSVM is associated with a degree of importance utilizing the fuzzy c-means clustering method. Therefore, a less importance degree is assigned to noisy data and outliers. Moreover, RSVM has more relaxed constraints that can reduce the effect of noisy samples. Feature selection increases the accuracy of different machine learning applications by eliminating noisy and irrelevant features. In the proposed RSVM-SBS feature selection algorithm, noisy data have small effect on eliminating irrelevant features. Experimental results using real-world data verify that RSVM-SBS has better results in comparison with other feature selection approaches utilizing support vector machines.
Description
Sabzekar, Mostafa/0000-0002-6886-1240;
ORCID
Keywords
Feature Selection, Noisy Data, Importance Degree, Sequential Backward Search
Turkish CoHE Thesis Center URL
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Q3
Scopus Q
Q1

OpenCitations Citation Count
8
Source
Soft Computing
Volume
25
Issue
8
Start Page
6391
End Page
6400
PlumX Metrics
Citations
Scopus : 13
Captures
Mendeley Readers : 8
SCOPUS™ Citations
13
checked on Feb 03, 2026
Web of Science™ Citations
10
checked on Feb 03, 2026
Page Views
2
checked on Feb 03, 2026
Google Scholar™


