Giovanni Iacca

Prof. Dr. Giovanni Iacca

University of Trento, Trento, Trentino-Alto Adige, Italy
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 August 2013 in Information Sciences
Verified
Journal Article
Closed access
FNFerrante Neri
Ferrante Neri
EMErnesto Mininno
Ernesto Mininno
Giovanni IaccaGiovanni Iacca
Giovanni Iacca

1 January 2017 in Information Fusion
Verified
Journal Article
Open access
HBHedde Hwj Bosman
Hedde Hwj Bosman
Giovanni IaccaGiovanni Iacca
Giovanni Iacca
ATArturo Tejada
Arturo Tejada
HWHeinrich J. Wörtche
Heinrich J. Wörtche
ALAntonio Liotta
Antonio Liotta
The field of wireless sensor networks (WSNs), embedded systems with sensing and networking capability, has now matured after a decade-long research effort and technological advances in electronics and networked systems. An important remaining challenge now is to extract meaningful information from the ever-increasing amount of sensor data collected by WSNs. In particular, there is strong interest in algorithms capable of automatic detection of patterns, events or other out-of-the order, anomalous system behavior. Data anomalies may indicate states of the system that require further analysis or prompt actions. Traditionally, anomaly detection techniques are executed in a central processing facility, which requires the collection of all measurement data at a central location, an obvious limitation for WSNs due to the high data communication costs involved. In this paper we explore the extent by which one may depart from this classical centralized paradigm, looking at decentralized anomaly detection based on unsupervised machine learning. Our aim is to detect anomalies at the sensor nodes, as opposed to centrally, to reduce energy and spectrum consumption. We study the information gain coming from aggregate neighborhood data, in comparison to performing simple, in-node anomaly detection. We evaluate the effects of neighborhood size and spatio-temporal correlation on the performance of our new neighborhood-based approach using a range of real-world network deployments and datasets. We find the conditions that make neighborhood data fusion advantageous, identifying also the cases in which this approach does not lead to detectable improvements. Improvements are linked to the diffusive properties of data (spatio-temporal correlations) but also to the type of sensors, anomalies and network topological features. Overall, when a dataset stems from a similar mixture of diffusive processes precision tends to benefit, particularly in terms of recall. Our work paves the way towards understanding how distributed data fusion methods may help managing the complexity of wireless sensor networks, for instance in massive Internet of Things scenarios

1 April 2012 in Information Sciences
Verified
Journal Article
Closed access
Giovanni IaccaGiovanni Iacca
Giovanni Iacca
FNFerrante Neri
Ferrante Neri
EMErnesto Mininno
Ernesto Mininno
YOYew-Soon Ong
Yew-Soon Ong
MLMeng-Hiot Lim
Meng-Hiot Lim

1 June 2011 in Information Sciences
Verified
Journal Article
Closed access
FNFerrante Neri
Ferrante Neri
Giovanni IaccaGiovanni Iacca
Giovanni Iacca
EMErnesto Mininno
Ernesto Mininno

1 April 2013 in Information Sciences
Verified
Journal Article
Closed access
Fabio CaraffiniFabio Caraffini
Fabio Caraffini
FNFerrante Neri
Ferrante Neri
Giovanni IaccaGiovanni Iacca
Giovanni Iacca
AMAran Mol
Aran Mol

11 January 2023 in IEEE Access
Verified
Journal Article
Open access
LCLeonardo L. Custode
Leonardo L. Custode
Giovanni IaccaGiovanni Iacca
Giovanni Iacca
In the last decade, reinforcement learning (RL) has been used to solve several tasks with human-level performance. However, there is a growing demand for interpretable RL, i.e., there is the need to understand how a RL agent works and the rationale of its decisions. Not only do we need interpretability to assess the safety of such agents, but also we may need it to gain insights into unknown problems. In this work, we propose a novel optimization approach to interpretable RL that builds decision trees. While techniques that optimize decision trees for RL do exist, they usually employ greedy algorithms or do not exploit the rewards given by the environment. For these reasons, these techniques may either get stuck in local optima or be inefficient. On the contrary, our approach is based on a two-level optimization scheme that combines the advantages of evolutionary algorithms with the benefits of Q -learning. This method allows decomposing the problem into two sub-problems: the problem of finding a meaningful decomposition of the state space, and the problem of associating an action to each subspace. We test the proposed method on three well-known RL benchmarks, as well as on a pandemic control task, on which it results competitive with the state-of-the-art in both performance and interpretability.