Improved Differential Evolution based Feature Selection through Quantum, Chaos, and Lasso
Modern deep learning continues to achieve outstanding performance on an astounding variety of high-dimensional tasks. In practice, this is obtained by fitting deep neural models to all the input data with minimal feature engineering, thus sacrificing interpretability in many cases. However, in applications such as medicine, where interpretability is crucial, feature subset selection becomes an important problem. Metaheuristics such as Binary Differential Evolution are a popular approach to feature selection, and the research literature continues to introduce novel ideas, drawn from quantum computing and chaos theory, for instance, to improve them. In this paper, we demonstrate that introducing chaos-generated variables, generated from considerations of the Lyapunov time, in place of random variables in quantum-inspired metaheuristics significantly improves their performance on high-dimensional medical classification tasks and outperforms other approaches. We show that this chaos-induced improvement is a general phenomenon by demonstrating it for multiple varieties of underlying quantum-inspired metaheuristics. Performance is further enhanced through Lasso-assisted feature pruning. At the implementation level, we vastly speed up our algorithms through a scalable island-based computing cluster parallelization technique.
Code (0)
등록된 구현이 없습니다.
Tasks
Feature Engineeringfeature selectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Online Sparse Feature Selection in Data Streams via Differential Evolution
The processing of high-dimensional streaming data commonly utilizes online streaming feature selection (OSFS) techniques. However, practical implementations often face challenges with data incompleteness due to equipment…
Feature ImportanceA novel mutation operator based on the union of fitness and design spaces information for Differential Evolution
Differential Evolution (DE) is one of the most successful and powerful evolutionary algorithms for global optimization problem. The most important operator in this algorithm is mutation operator which parents are selecte…
Evolutionary Algorithmsglobal-optimizationDifferential Evolution with Generalized Mutation Operator for Parameters Optimization in Gene Selection for Cancer Classification
Differential Evolution (DE) proved to be one of the most successful evolutionary algorithms for global optimization purposes in continuous problems. The core operator in DE is mutation which can provide the algorithm wit…
Cancer ClassificationEvolutionary Algorithmsfeature selectionGeneral Classification+1Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution
Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating …
Deep Reinforcement LearningEvolutionary AlgorithmsSchedulingFeature subset selection for Big Data via Chaotic Binary Differential Evolution under Apache Spark
Feature subset selection (FSS) using a wrapper approach is essentially a combinatorial optimization problem having two objective functions namely cardinality of the selected-feature-subset, which should be minimized and …
Combinatorial Optimization