The application of Evolutionary and Nature Inspired Algorithms in Data Science and Data Analytics

• URL: http://arxiv.org/abs/2202.03859v1
• Date: Sun, 6 Feb 2022 21:22:41 GMT
• Title: The application of Evolutionary and Nature Inspired Algorithms in Data Science and Data Analytics
• Authors: Farid Ghareh Mohammadi, Farzan Shenavarmasouleh, Khaled Rasheed, Thiab Taha, M. Hadi Amini, and Hamid R. Arabnia
• Abstract summary: We present our discovery of evolutionary and nature-inspired algorithms applications in Data Science and Data Analytics. In this study, we aim to investigate four optimization algorithms that have been performed using the evolutionary and nature-inspired algorithms within data science and analytics.
• Score: 2.1704774442395465
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the past 30 years, scientists have searched nature, including animals and insects, and biology in order to discover, understand, and model solutions for solving large-scale science challenges. The study of bionics reveals that how the biological structures, functions found in nature have improved our modern technologies. In this study, we present our discovery of evolutionary and nature-inspired algorithms applications in Data Science and Data Analytics in three main topics of pre-processing, supervised algorithms, and unsupervised algorithms. Among all applications, in this study, we aim to investigate four optimization algorithms that have been performed using the evolutionary and nature-inspired algorithms within data science and analytics. Feature selection optimization in pre-processing section, Hyper-parameter tuning optimization, and knowledge discovery optimization in supervised algorithms, and clustering optimization in the unsupervised algorithms.

Related papers

• AlphaEvolve: A coding agent for scientific and algorithmic discovery [63.13852052551106]
  We present AlphaEvolve, an evolutionary coding agent that substantially enhances capabilities of state-of-the-art LLMs.<n>AlphaEvolve orchestrates an autonomous pipeline of LLMs, whose task is to improve an algorithm by making direct changes to the code.<n>We demonstrate the broad applicability of this approach by applying it to a number of important computational problems.
  arXiv  Detail & Related papers  (2025-06-16T06:37:18Z)
• Equation discovery framework EPDE: Towards a better equation discovery [50.79602839359522]
  We enhance the EPDE algorithm -- an evolutionary optimization-based discovery framework. Our approach generates terms using fundamental building blocks such as elementary functions and individual differentials. We validate our algorithm's noise resilience and overall performance by comparing its results with those from the state-of-the-art equation discovery framework SINDy.
  arXiv  Detail & Related papers  (2024-12-28T15:58:44Z)
• Frog-Snake prey-predation Relationship Optimization (FSRO) : A novel nature-inspired metaheuristic algorithm for feature selection [0.0]
  This study proposes the Frog-Snake prey-predation Relationship Optimization (FSRO) algorithm. It is inspired by the prey-predation relationship between frogs and snakes for application to discrete optimization problems. The proposed algorithm conducts computational experiments on feature selection using 26 types of machine learning datasets.
  arXiv  Detail & Related papers  (2024-02-13T06:39:15Z)
• Nature Inspired Evolutionary Swarm Optimizers for Biomedical Image and Signal Processing -- A Systematic Review [0.0]
  The paper reviews 28 latest peer-reviewed relevant articles and 26 nature-inspired algorithms. It segregates them into thoroughly explored, lesser explored and unexplored categories intending to help readers understand the reliability and exploration stage of each of these algorithms.
  arXiv  Detail & Related papers  (2023-10-02T04:52:46Z)
• An automatic selection of optimal recurrent neural network architecture for processes dynamics modelling purposes [0.0]
  The research has included four original proposals of algorithms dedicated to neural network architecture search. Algorithms have been based on well-known optimisation techniques such as evolutionary algorithms and gradient descent methods. The research involved an extended validation study based on data generated from a mathematical model of the fast processes occurring in a pressurised water nuclear reactor.
  arXiv  Detail & Related papers  (2023-09-25T11:06:35Z)
• Discovering Attention-Based Genetic Algorithms via Meta-Black-Box Optimization [13.131971623143622]
  We discover entirely new genetic algorithms in a data-driven fashion. We parametrize selection and mutation rate adaptation as cross- and self-attention modules. The learned algorithm can be applied to previously unseen optimization problems, search dimensions & evaluation budgets.
  arXiv  Detail & Related papers  (2023-04-08T12:14:15Z)
• Introductory Studies of Swarm Intelligence Techniques [1.2930503923129208]
  Swarm intelligence involves the collective study of individuals and their mutual interactions leading to intelligent behavior of the swarm. The chapter presents various population-based SI algorithms, their fundamental structures along with their mathematical models.
  arXiv  Detail & Related papers  (2022-09-26T16:29:55Z)
• Research Trends and Applications of Data Augmentation Algorithms [77.34726150561087]
  We identify the main areas of application of data augmentation algorithms, the types of algorithms used, significant research trends, their progression over time and research gaps in data augmentation literature. We expect readers to understand the potential of data augmentation, as well as identify future research directions and open questions within data augmentation research.
  arXiv  Detail & Related papers  (2022-07-18T11:38:32Z)
• Neural Combinatorial Optimization: a New Player in the Field [69.23334811890919]
  This paper presents a critical analysis on the incorporation of algorithms based on neural networks into the classical optimization framework. A comprehensive study is carried out to analyse the fundamental aspects of such algorithms, including performance, transferability, computational cost and to larger-sized instances.
  arXiv  Detail & Related papers  (2022-05-03T07:54:56Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• On the Exploitation of Neuroevolutionary Information: Analyzing the Past for a More Efficient Future [60.99717891994599]
  We propose an approach that extracts information from neuroevolutionary runs, and use it to build a metamodel. We inspect the best structures found during neuroevolutionary searches of generative adversarial networks with varying characteristics.
  arXiv  Detail & Related papers  (2021-05-26T20:55:29Z)
• AdaLead: A simple and robust adaptive greedy search algorithm for sequence design [55.41644538483948]
  We develop an easy-to-directed, scalable, and robust evolutionary greedy algorithm (AdaLead) AdaLead is a remarkably strong benchmark that out-competes more complex state of the art approaches in a variety of biologically motivated sequence design challenges.
  arXiv  Detail & Related papers  (2020-10-05T16:40:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.