MRMR-SSA: a hybrid approach for optimal feature selection

被引:0
|
作者
Monalisha Mahapatra
Santosh Kumar Majhi
Sunil Kumar Dhal
机构
[1] Veer Surendra Sai University of Technology,Department of Computer Science and Engineering
[2] Sri Sri University,Faculty of Management Studies
来源
Evolutionary Intelligence | 2022年 / 15卷
关键词
Feature selection; Salp swarm algorithm (SSA); XGBoost; AdaBoost; forests; Logistic ;
D O I
暂无
中图分类号
学科分类号
摘要
A critical issue in data mining and machine learning is feature selection. The crucial part is how to specify the eminent problem-relevant features out of a collection of features contained in a dataset. Feature selection process goes with the pre processing steps in knowledge revelation (KDD process). It aids in eliminating the unnecessary (redundant) and unrelated (irrelevant) features in order to improve the fulfillment of classifying algorithms. It chooses the most optimal count of features that is best suited to classification model which in turn advance the learning process. As such, the correctness (accuracy) of classification increases. Thus, in this paper we have proposed a two-staged hybrid arrangement of model that contains filter-based approach in the first stage to filter out the unnecessary and unrelated features and then providing these acquired features as input to the next stage that is the wrapper method by availing the recent swarm based algorithm, namely, salp swarm algorithm or SSA. The proposed model is named as MRMR-SSA. The binary version of SSA is utilized to evaluate the features that can either take the feature as 1 or discard it as 0. Specific classifiers like XGBoost, AdaBoost, Random forests and Logistic Regression are made in use in this paper. Accuracy is considered to measure the performance of each classifier. An analogy is made for the proposed hybrid feature selection approach with a few familiar algorithms specifically MRMR-PSO, MRMR-GA, MRMR-ALO and MRMR-ACO. The proposed hybrid approach leaves behind other given hybrid methods.
引用
收藏
页码:2017 / 2036
页数:19
相关论文
共 50 条
  • [41] A novel hybrid BPSO-SCA approach for feature selection
    Kumar, Lalit
    Bharti, Kusum Kumari
    NATURAL COMPUTING, 2021, 20 (01) : 39 - 61
  • [42] A Hybrid Feature Selection Approach Based on Statistical and Wrapper Methods
    Kaya, Mahmut
    Bilge, Basalt Sakir
    2016 24TH SIGNAL PROCESSING AND COMMUNICATION APPLICATION CONFERENCE (SIU), 2016, : 2101 - 2104
  • [43] EDDE–LNS: a new hybrid ensemblist approach for feature selection
    Wassila Guendouzi
    Abdelmadjid Boukra
    Memetic Computing, 2018, 10 : 63 - 79
  • [44] Feature Selection Algorithm for Multiple Classifier Systems: A Hybrid Approach
    Delimata, Pawel
    Suraj, Zbigniew
    FUNDAMENTA INFORMATICAE, 2008, 85 (1-4) : 97 - 110
  • [45] A feature selection approach to find optimal feature subsets for the network intrusion detection system
    Kang, Seung-Ho
    Kim, Kuinam J.
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2016, 19 (01): : 325 - 333
  • [46] A feature selection approach to find optimal feature subsets for the network intrusion detection system
    Seung-Ho Kang
    Kuinam J. Kim
    Cluster Computing, 2016, 19 : 325 - 333
  • [47] A Hybrid Bat Based Feature Selection Approach for Intrusion Detection
    Laamari, Mohamed Amine
    Kamel, Nadjet
    BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2014, 2014, 472 : 230 - 238
  • [48] Mrmr+ and Cfs+ feature selection algorithms for high-dimensional data
    Adrian Pino Angulo
    Kilho Shin
    Applied Intelligence, 2019, 49 : 1954 - 1967
  • [49] A Hybrid mRMR-Genetic Based Selection Method For The Prediction Of Epileptic Seizures
    Assi, E. Bou
    Sawan, M.
    Nguyen, D. K.
    Rihana, S.
    2015 IEEE BIOMEDICAL CIRCUITS AND SYSTEMS CONFERENCE (BIOCAS), 2015, : 326 - 329
  • [50] An Optimize Gene Selection Approach for Cancer Classification Using Hybrid Feature Selection Methods
    Dass, Sayantan
    Mistry, Sujoy
    Sarkar, Pradyut
    Paik, Pradip
    ADVANCED NETWORK TECHNOLOGIES AND INTELLIGENT COMPUTING, ANTIC 2021, 2022, 1534 : 751 - 764