The ability to simulate gene expression and infer gene regulatory networks has vast potential applications in various fields, including medicine, agriculture, and environmental science. In recent years, machine learning approaches to simulate gene expression and infer gene regulatory networks have gained significant attention as a promising area of research. By simulating gene expression, we can gain insights into the complex mechanisms that control gene expression and how they are affected by various environmental factors. This knowledge can be used to develop new treatments for genetic diseases, improve crop yields, and better understand the evolution of species. In this article, we address this issue by focusing on a novel method capable of simulating the gene expression regulation of a group of genes and their mutual interactions. Our framework enables us to simulate the regulation of gene expression in response to alterations or perturbations that can affect the expression of a gene. We use both artificial and real benchmarks to empirically evaluate the effectiveness of our methodology. Furthermore, we compare our method with existing ones to understand its advantages and disadvantages. We also present future ideas for improvement to enhance the effectiveness of our method. Overall, our approach has the potential to greatly improve the field of gene expression simulation and gene regulatory network inference, possibly leading to significant advancements in genetics.
With the increase in available data from computer systems and their security threats, interest in anomaly detection has increased as well in recent years. The need to diagnose faults and cyberattacks has also focused scientific research on the automated classification of outliers in big data, as manual labeling is difficult in practice due to their huge volumes. The results obtained from data analysis can be used to generate alarms that anticipate anomalies and thus prevent system failures and attacks. Therefore, anomaly detection has the purpose of reducing maintenance costs as well as making decisions based on reports. During the last decade, the approaches proposed in the literature to classify unknown anomalies in log analysis, process analysis, and time series have been mainly based on machine learning and deep learning techniques. In this study, we provide an overview of current state-of-the-art methodologies, highlighting their advantages and disadvantages and the new challenges. In particular, we will see that there is no absolute best method, i.e., for any given dataset a different method may achieve the best result. Finally, we describe how the use of metaheuristics within machine learning algorithms makes it possible to have more robust and efficient tools.
6 May 2025 in Engineering Applications of Artificial Intelligence
This paper introduces an agent-based model grounded in the ACO algorithm to investigate the impact of partitioning ant colonies on algorithmic performance. The exploration focuses on understanding the roles of group size and number within a multi-objective optimization context. The model consists of a colony of memory-enhanced ants (ME-ANTS) which, starting from a given position, must collaboratively discover the optimal path to the exit point within a grid network. The colony can be divided into groups of different sizes and its objectives are maximizing the number of ants that exit the grid while minimizing path costs. Three distinct analyses were conducted: an overall analysis assessing colony performance across different-sized groups, a group analysis examining the performance of each partitioned group, and a pheromone distribution analysis discerning correlations between temporal pheromone distribution and ant navigation. From the results, a dynamic correlation emerged between the degree of colony partitioning and solution quality within the ACO algorithm framework.