Feature selection schema based on game theory and biology migration algorithm for regression problems

被引:5
作者
Javidi, Mohammad Masoud [1 ]
机构
[1] Shahid Bahonar Univ Kerman, Dept Comp Sci, Kerman, Iran
关键词
Feature selection; Nash equilibrium; Multi-objective optimization; Biology migration algorithm; Game theory; PARTICLE SWARM OPTIMIZATION; ARTIFICIAL BEE COLONY; FEATURE-EXTRACTION; CLASSIFICATION; PREDICTION; MANAGEMENT; SYSTEM;
D O I
10.1007/s13042-020-01174-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many real-world datasets nowadays are of regression type, while only a few dimensionality reduction methods have been developed for regression problems. On the other hand, most existing regression methods are based on the computation of the covariance matrix, rendering them inefficient in the reduction process. Therefore, a BMA-based multi-objective feature selection method, GBMA, is introduced by incorporating the Nash equilibrium approach. GBMA is intended to maximize model accuracy and minimize the number of features through a less complex procedure. The proposed method is composed of four steps. The first step involves defining three players, each of which is trying to improve its objective function (i.e., model error, number of features, and precision adjustment). The second step includes clustering features based on the correlation therebetween and detecting the most appropriate ordering of features to enhance cluster efficiency. The third step comprises extracting a new feature from each cluster based on various weighting methods (i.e., moderate, strict, and hybrid). Finally, the fourth step encompasses updating players based on stochastic search operators. The proposed GBMA strategy explores the search space and finds optimal solutions in an acceptable amount of time without examining every possible solution. The experimental results and statistical tests based on ten well-known datasets from the UCI repository proved the high performance of GBMA in selecting features for solving regression problems.
引用
收藏
页码:303 / 342
页数:40
相关论文
共 59 条
[11]   Semi-supervised network embedding with text information [J].
Gong, Maoguo ;
Yao, Chuanyu ;
Xie, Yu ;
Xu, Mingliang .
PATTERN RECOGNITION, 2020, 104
[12]   Feature Selection Using Cooperative Game Theory and Relief Algorithm [J].
Gore, Shounak ;
Govindaraju, Venu .
KNOWLEDGE, INFORMATION AND CREATIVITY SUPPORT SYSTEMS: RECENT TRENDS, ADVANCES AND SOLUTIONS, KICSS 2013, 2016, 364 :401-412
[13]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864
[14]  
Hall M. A., 1999, Proceedings of the Twelfth International Florida AI Research Society Conference, P235
[15]   Pareto front feature selection based on artificial bee colony optimization [J].
Hancer, Emrah ;
Xue, Bing ;
Zhang, Mengjie ;
Karaboga, Dervis ;
Akay, Bahriye .
INFORMATION SCIENCES, 2018, 422 :462-479
[16]   Prediction of hydroxyapatite crystallite size prepared by sol-gel route: gene expression programming approach [J].
Jafari, Mehrdad Mahdavi ;
Khayati, Gholam Reza .
JOURNAL OF SOL-GEL SCIENCE AND TECHNOLOGY, 2018, 86 (01) :112-125
[17]   The prevention and handling of the missing data [J].
Kang, Hyun .
KOREAN JOURNAL OF ANESTHESIOLOGY, 2013, 64 (05) :402-406
[18]  
KIRA K, 1992, AAAI-92 PROCEEDINGS : TENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, P129
[19]  
Kwak N, 2006, LECT NOTES COMPUT SC, V4131, P1
[20]   Feature extraction based on subspace methods for regression problems [J].
Kwak, Nojun ;
Lee, Jung-Won .
NEUROCOMPUTING, 2010, 73 (10-12) :1740-1751