Claudia Cavallaro

Ms. Claudia Cavallaro

Dipartimento di Matematica e Informatica, Università di Catania
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 November 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
Claudia CavallaroClaudia Cavallaro
Claudia Cavallaro
VCVincenzo Cutello
Vincenzo Cutello
MPMario Pavone
Mario Pavone
FZFrancesco Zito
Francesco Zito

17 August 2023 in Frontiers in Big Data
Verified
Journal Article
Open access
Claudia CavallaroClaudia Cavallaro
Claudia Cavallaro
VCVincenzo Cutello
Vincenzo Cutello
MPMario Pavone
Mario Pavone
FZFrancesco Zito
Francesco Zito
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.


26 July 2022 in Computers
Verified
Journal Article
Open access
PDF file
LVLaura Viola
Laura Viola
ERElisabetta Ronchieri
Elisabetta Ronchieri
Claudia CavallaroClaudia Cavallaro
Claudia Cavallaro
Context—Anomaly detection in a data center is a challenging task, having to consider different services on various resources. Current literature shows the application of artificial intelligence and machine learning techniques to either log files or monitoring data: the former created by services at run time, while the latter produced by specific sensors directly on the physical or virtual machine. Objectives—We propose a model that exploits information both in log files and monitoring data to identify patterns and detect anomalies over time both at the service level and at the machine level. Methods—The key idea is to construct a specific dictionary for each log file which helps to extract anomalous n-grams in the feature matrix. Several techniques of Natural Language Processing, such as wordclouds and Topic modeling, have been used to enrich such dictionary. A clustering algorithm was then applied to the feature matrix to identify and group the various types of anomalies. On the other side, time series anomaly detection technique has been applied to sensors data in order to combine problems found in the log files with problems stored in the monitoring data. Several services (i.e., log files) running on the same machine have been grouped together with the monitoring metrics. Results—We have tested our approach on a real data center equipped with log files and monitoring data that can characterize the behaviour of physical and virtual resources in production. The data have been provided by the National Institute for Nuclear Physics in Italy. We have observed a correspondence between anomalies in log files and monitoring data, e.g., a decrease in memory usage or an increase in machine load. The results are extremely promising. Conclusions—Important outcomes have emerged thanks to the integration between these two types of data. Our model requires to integrate site administrators’ expertise in order to consider all critical scenarios in the data center and understand results properly.

1 February 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
Claudia CavallaroClaudia Cavallaro
Claudia Cavallaro
CCCarolina Crespi
Carolina Crespi
VCVincenzo Cutello
Vincenzo Cutello
MPMario Pavone
Mario Pavone
FZFrancesco Zito
Francesco Zito
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.

21 July 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Claudia CavallaroClaudia Cavallaro
Claudia Cavallaro
JVJordi Vitrià
Jordi Vitrià
Given the widespread use of mobile devices that track their geographical location, it has become increasingly easy to acquire information related to users’ trips in real time. This availability has triggered several studies based on user’s position, such as the analysis of flows of people in cities, and also new applications, such as route recommendation systems. Given a dataset of geographical trajectories in an urban metropolitan area, we propose a new algorithm to detect corridors. Corridors can be defined as geographical paths, with a minimum length, that are commonly traversed by a minimum number of different users. We propose an efficient strategy based on the Apriori algorithm to extract frequent trajectory patterns from the geo-spatial dataset. By discretizing the data and adapting the roles of itemsets and baskets of this algorithm to our context, we find the longest corridors formed by cells shared by a minimum number of trajectories. After that, we refine the results obtained with a subsequent filtering step, by using a Radius Neighbors Graph. To illustrate the algorithm, the GeoLife dataset is analyzed by following the proposed method. Our approach is relevant for transportation analytics because it is the base to detect lacking lines in public transportation systems and also to recommend to private users which route to take when moving from one part of the city to another on the basis of behavior of the users who provided their logs.