scholarly journals A novel sensitivity-based method for feature selection

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Dayakar L. Naik ◽  
Ravi kiran
Keyword(s):  
Sensitivity Analysis ◽  
Feature Selection ◽  
Feature Selection Method ◽  
Feature Ranking ◽  
Ranking Methods ◽  
Novel Approach ◽  
Machine Learning Model ◽  
Real World Datasets ◽  
Perturbation Parameters ◽  
Feature Selection Approach

AbstractSensitivity analysis is a popular feature selection approach employed to identify the important features in a dataset. In sensitivity analysis, each input feature is perturbed one-at-a-time and the response of the machine learning model is examined to determine the feature's rank. Note that the existing perturbation techniques may lead to inaccurate feature ranking due to their sensitivity to perturbation parameters. This study proposes a novel approach that involves the perturbation of input features using a complex-step. The implementation of complex-step perturbation in the framework of deep neural networks as a feature selection method is provided in this paper, and its efficacy in determining important features for real-world datasets is demonstrated. Furthermore, the filter-based feature selection methods are employed, and the results obtained from the proposed method are compared. While the results obtained for the classification task indicated that the proposed method outperformed other feature ranking methods, in the case of the regression task, it was found to perform more or less similar to that of other feature ranking methods.

Detection of Automobile Insurance Fraud Using Feature Selection and Data Mining Techniques

2018 ◽  
Vol 5 (3) ◽  
pp. 1-20 ◽  
Author(s):  
Sharmila Subudhi ◽  
Suvasini Panigrahi
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Feature Selection Method ◽  
Automobile Insurance ◽  
Test Set ◽  
Data Mining Techniques ◽  
Weighted Extreme Learning Machine ◽  
Original Dataset ◽  
Novel Approach ◽  
Learning Machine

This article presents a novel approach for fraud detection in automobile insurance claims by applying various data mining techniques. Initially, the most relevant attributes are chosen from the original dataset by using an evolutionary algorithm based feature selection method. A test set is then extracted from the selected attribute set and the remaining dataset is subjected to the Possibilistic Fuzzy C-Means (PFCM) clustering technique for the undersampling approach. The 10-fold cross validation method is then used on the balanced dataset for training and validating a group of Weighted Extreme Learning Machine (WELM) classifiers generated from various combinations of WELM parameters. Finally, the test set is applied on the best performing model for classification purpose. The efficacy of the proposed system is illustrated by conducting several experiments on a real-world automobile insurance defraud dataset. Besides, a comparative analysis with another approach justifies the superiority of the proposed system.

A NEW ENSEMBLE METHOD FOR FEATURE RANKING IN TEXT MINING

2013 ◽  
Vol 22 (03) ◽  
pp. 1350010 ◽  
Author(s):  
SABEREH SADEGHI ◽  
HAMID BEIGY
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Dimensionality Reduction ◽  
Ensemble Methods ◽  
Ease Of Use ◽  
Convergence Time ◽  
Feature Ranking ◽  
Initial Population ◽  
Feature Subset ◽  
Ranking Methods

Dimensionality reduction is a necessary task in data mining when working with high dimensional data. A type of dimensionality reduction is feature selection. Feature selection based on feature ranking has received much attention by researchers. The major reasons are its scalability, ease of use, and fast computation. Feature ranking methods can be divided into different categories and may use different measures for ranking features. Recently, ensemble methods have entered in the field of ranking and achieved more accuracy among others. Accordingly, in this paper a Heterogeneous ensemble based algorithm for feature ranking is proposed. The base ranking methods in this ensemble structure are chosen from different categories like information theoretic, distance based, and statistical methods. The results of the base ranking methods are then fused into a final feature subset by means of genetic algorithm. The diversity of the base methods improves the quality of initial population of the genetic algorithm and thus reducing the convergence time of the genetic algorithm. In most of ranking methods, it's the user's task to determine the threshold for choosing the appropriate subset of features. It is a problem, which may cause the user to try many different values to select a good one. In the proposed algorithm, the difficulty of determining a proper threshold by the user is decreased. The performance of the algorithm is evaluated on four different text datasets and the experimental results show that the proposed method outperforms all other five feature ranking methods used for comparison. One advantage of the proposed method is that it is independent to the classification method used for classification.

scholarly journals Machine Learning Based Clinical Diagnosis of Liver Patients with Instance Replacement

2021 ◽  
Author(s):  
J. V. D. Prasad ◽  
A. Raghuvira Pratap ◽  
Babu Sallagundla
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Research Work ◽  
Feature Selection Method ◽  
Learning Model ◽  
Disease Classification ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Huge Data ◽  
Machine Learning Model

With the rapid increase in number of clinical data and hence the prediction and analysing data becomes very difficult. With the help of various machine learning models, it becomes easy to work on these huge data. A machine learning model faces lots of challenges; one among the challenge is feature selection. In this research work, we propose a novel feature selection method based on statistical procedures to increase the performance of the machine learning model. Furthermore, we have tested the feature selection algorithm in liver disease classification dataset and the results obtained shows the efficiency of the proposed method.

scholarly journals Effective Evolutionary Multilabel Feature Selection under a Budget Constraint

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Jaesung Lee ◽  
Wangduk Seo ◽  
Dae-Won Kim
Keyword(s):  
Feature Selection ◽  
Empirical Studies ◽  
Feature Selection Method ◽  
Budget Constraint ◽  
Feature Subset ◽  
Evolutionary Search ◽  
Selection Methods ◽  
Multilabel Classification ◽  
Genetic Search ◽  
Real World Datasets

Multilabel feature selection involves the selection of relevant features from multilabeled datasets, resulting in improved multilabel learning accuracy. Evolutionary search-based multilabel feature selection methods have proved useful for identifying a compact feature subset by successfully improving the accuracy of multilabel classification. However, conventional methods frequently violate budget constraints or result in inefficient searches due to ineffective exploration of important features. In this paper, we present an effective evolutionary search-based feature selection method for multilabel classification with a budget constraint. The proposed method employs a novel exploration operation to enhance the search capabilities of a traditional genetic search, resulting in improved multilabel classification. Empirical studies using 20 real-world datasets demonstrate that the proposed method outperforms conventional multilabel feature selection methods.

scholarly journals A Mixed Feature Selection Method Considering Interaction

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zilin Zeng ◽  
Hongjun Zhang ◽  
Rui Zhang ◽  
Youliang Zhang
Keyword(s):  
Feature Selection ◽  
Rough Sets ◽  
Feature Selection Method ◽  
Feature Space ◽  
Feature Interaction ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Neighborhood Rough Sets ◽  
Real World Datasets ◽  
Neighborhood Interaction

Feature interaction has gained considerable attention recently. However, many feature selection methods considering interaction are only designed for categorical features. This paper proposes a mixed feature selection algorithm based on neighborhood rough sets that can be used to search for interacting features. In this paper, feature relevance, feature redundancy, and feature interaction are defined in the framework of neighborhood rough sets, the neighborhood interaction weight factor reflecting whether a feature is redundant or interactive is proposed, and a neighborhood interaction weight based feature selection algorithm (NIWFS) is brought forward. To evaluate the performance of the proposed algorithm, we compare NIWFS with other three feature selection algorithms, including INTERACT, NRS, and NMI, in terms of the classification accuracies and the number of selected features with C4.5 and IB1. The results from ten real world datasets indicate that NIWFS not only deals with mixed datasets directly, but also reduces the dimensionality of feature space with the highest average accuracies.

scholarly journals An Improved Feature Selection Based on Effective Range for Classification

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jianzhong Wang ◽  
Shuang Zhou ◽  
Yugen Yi ◽  
Jun Kong
Keyword(s):  
Feature Selection ◽  
Gene Selection ◽  
State Of The Art ◽  
Feature Selection Method ◽  
Selection Method ◽  
Effective Range ◽  
Inclusion Relation ◽  
Statistical Feature ◽  
Selection Approach ◽  
Feature Selection Approach

Feature selection is a key issue in the domain of machine learning and related fields. The results of feature selection can directly affect the classifier’s classification accuracy and generalization performance. Recently, a statistical feature selection method named effective range based gene selection (ERGS) is proposed. However, ERGS only considers the overlapping area (OA) among effective ranges of each class for every feature; it fails to handle the problem of the inclusion relation of effective ranges. In order to overcome this limitation, a novel efficient statistical feature selection approach called improved feature selection based on effective range (IFSER) is proposed in this paper. In IFSER, an including area (IA) is introduced to characterize the inclusion relation of effective ranges. Moreover, the samples’ proportion for each feature of every class in both OA and IA is also taken into consideration. Therefore, IFSER outperforms the original ERGS and some other state-of-the-art algorithms. Experiments on several well-known databases are performed to demonstrate the effectiveness of the proposed method.

scholarly journals Ensemble feature selection approach based on feature ranking for rice seed images classification

2020 ◽  
Vol 18 (3) ◽  
Author(s):  
Dzi Lam Tran Tuan ◽  
Thongchai Surinwarangkoon ◽  
Kittikhun Meethongjan ◽  
Vinh Truong Hoang
Keyword(s):  
Feature Selection ◽  
Feature Ranking ◽  
Rice Seed ◽  
Selection Approach ◽  
Feature Selection Approach
Sign in / Sign up

Export Citation Format

Share Document