Claudio Silvestri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Claudio Silvestri has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Salvatore Orlando
Ca' Foscari University of Venice, Venice, Italy
16 shared publications Maria Luisa Damiani
10 shared publicationsElisa Bertino
Purdue University
7 shared publications- Alessandra Raffaetà
Ca’ Foscari University of Venice, Venice, Italy
5 shared publications - Francesco Lettich
ISTI - CNR, Pisa, Italy
4 shared publications - Elisabetta Russo
Università Ca’ Foscari Venezia, Venezia, Italy
3 shared publications
Latest Publications
- Open Access
- 30 March 2024
- Published by Springer Nature
- p. 298-308
Exploiting the Potential of Bayesian Networks in Deriving New Insight into Diabetic Kidney Disease (DKD)
Diabetic kidney disease is a serious complication of diabetes and one of the leading causes of chronic and end-stage kidney disease worldwide. The clinical course and response to therapy is complex and heterogeneous both between and over time within individuals. Therefore it is extremely important to derive even more in-depth information on what characterizes its pathophysiology and pattern of disease progression. Statistical models can help in this task by understanding the interconnections among variables clinically considered to characterize the disease. In this work we propose to use Bayesian networks, a class of probabilistic graphical models, able to identify robust relationships among a set of variables. Furthermore, Bayesian networks are able to include expert knowledge in the modeling phase to reduce the uncertainty on the phenomenon under study. We provide some evidence that the synergy between data and expert prior information is a great source of valuable help in gaining new knowledge about Diabetic Kidney Disease.
- 30 March 2024
- Published by Springer Nature
- p. 298-308
Open AccessExploiting the Potential of Bayesian Networks in Deriving New Insight into Diabetic Kidney Disease (DKD)
Diabetic kidney disease is a serious complication of diabetes and one of the leading causes of chronic and end-stage kidney disease worldwide. The clinical course and response to therapy is complex and heterogeneous both between and over time within individuals. Therefore it is extremely important to derive even more in-depth information on what characterizes its pathophysiology and pattern of disease progression. Statistical models can help in this task by understanding the interconnections among variables clinically considered to characterize the disease. In this work we propose to use Bayesian networks, a class of probabilistic graphical models, able to identify robust relationships among a set of variables. Furthermore, Bayesian networks are able to include expert knowledge in the modeling phase to reduce the uncertainty on the phenomenon under study. We provide some evidence that the synergy between data and expert prior information is a great source of valuable help in gaining new knowledge about Diabetic Kidney Disease.
- Top Cited PapersOpen Access
- 2 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (10) , 1-32
Time Series Compression Survey
Smart objects are increasingly widespread and their ecosystem, also known as the Internet of Things (IoT), is relevant in many application scenarios. The huge amount of temporally annotated data produced by these smart devices demands efficient techniques for the transfer and storage of time series data. Compression techniques play an important role toward this goal and, even though standard compression methods could be used with some benefit, there exist several ones that specifically address the case of time series by exploiting their peculiarities to achieve more effective compression and more accurate decompression in the case of lossy compression techniques. This article provides a state-of-the-art survey of the principal time series compression techniques, proposing a taxonomy to classify them considering their overall approach and their characteristics. Furthermore, we analyze the performances of the selected algorithms by discussing and comparing the experimental results that were provided in the original articles. The goal of this article is to provide a comprehensive and homogeneous reconstruction of the state-of-the-art, which is currently fragmented across many articles that use different notations and where the proposed methods are not organized according to a classification.
- 2 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (10) , 1-32
Top Cited PapersOpen AccessTime Series Compression Survey
Smart objects are increasingly widespread and their ecosystem, also known as the Internet of Things (IoT), is relevant in many application scenarios. The huge amount of temporally annotated data produced by these smart devices demands efficient techniques for the transfer and storage of time series data. Compression techniques play an important role toward this goal and, even though standard compression methods could be used with some benefit, there exist several ones that specifically address the case of time series by exploiting their peculiarities to achieve more effective compression and more accurate decompression in the case of lossy compression techniques. This article provides a state-of-the-art survey of the principal time series compression techniques, proposing a taxonomy to classify them considering their overall approach and their characteristics. Furthermore, we analyze the performances of the selected algorithms by discussing and comparing the experimental results that were provided in the original articles. The goal of this article is to provide a comprehensive and homogeneous reconstruction of the state-of-the-art, which is currently fragmented across many articles that use different notations and where the proposed methods are not organized according to a classification.
- Open Access
- 1 January 2023
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 20 (4) , III-V
Guest editorial: Management of digital ecosystems - recent trends, and open issues
- 1 January 2023
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 20 (4) , III-V
Open AccessGuest editorial: Management of digital ecosystems - recent trends, and open issues
- Open Access
- 31 March 2022
- Published by Springer Nature in GeoInformatica
- Vol. 26 (4) , 551-579
From multiple aspect trajectories to predictive analysis: a case study on fishing vessels in the Northern Adriatic sea
In this paper we model spatio-temporal data describing the fishing activities in the Northern Adriatic Sea over four years. We build, implement and analyze a database based on the fusion of two complementary data sources: trajectories from fishing vessels (obtained from terrestrial Automatic Identification System, or AIS, data feed) and fish catch reports (i.e., the quantity and type of fish caught) of the main fishing market of the area. We present all the phases of the database creation, starting from the raw data and proceeding through data exploration, data cleaning, trajectory reconstruction and semantic enrichment. We implement the database by using MobilityDB, an open source geospatial trajectory data management and analysis platform. Subsequently, we perform various analyses on the resulting spatio-temporal database, with the goal of mapping the fishing activities on some key species, highlighting all the interesting information and inferring new knowledge that will be useful for fishery management. Furthermore, we investigate the use of machine learning methods for predicting the Catch Per Unit Effort (CPUE), an indicator of the fishing resources exploitation in order to drive specific policy design. A variety of prediction methods, taking as input the data in the database and environmental factors such as sea temperature, waves height and Clorophill-a, are put at work in order to assess their prediction ability in this field. To the best of our knowledge, our work represents the first attempt to integrate fishing ships trajectories derived from AIS data, environmental data and catch data for spatio-temporal prediction of CPUE – a challenging task.
- 31 March 2022
- Published by Springer Nature in GeoInformatica
- Vol. 26 (4) , 551-579
Open AccessFrom multiple aspect trajectories to predictive analysis: a case study on fishing vessels in the Northern Adriatic sea
In this paper we model spatio-temporal data describing the fishing activities in the Northern Adriatic Sea over four years. We build, implement and analyze a database based on the fusion of two complementary data sources: trajectories from fishing vessels (obtained from terrestrial Automatic Identification System, or AIS, data feed) and fish catch reports (i.e., the quantity and type of fish caught) of the main fishing market of the area. We present all the phases of the database creation, starting from the raw data and proceeding through data exploration, data cleaning, trajectory reconstruction and semantic enrichment. We implement the database by using MobilityDB, an open source geospatial trajectory data management and analysis platform. Subsequently, we perform various analyses on the resulting spatio-temporal database, with the goal of mapping the fishing activities on some key species, highlighting all the interesting information and inferring new knowledge that will be useful for fishery management. Furthermore, we investigate the use of machine learning methods for predicting the Catch Per Unit Effort (CPUE), an indicator of the fishing resources exploitation in order to drive specific policy design. A variety of prediction methods, taking as input the data in the database and environmental factors such as sea temperature, waves height and Clorophill-a, are put at work in order to assess their prediction ability in this field. To the best of our knowledge, our work represents the first attempt to integrate fishing ships trajectories derived from AIS data, environmental data and catch data for spatio-temporal prediction of CPUE – a challenging task.
- 1 July 2020
- Published by Elsevier in Ocean & Coastal Management
- Vol. 192
Temporal and spatial patterns of trawl fishing activities in the Adriatic Sea (Central Mediterranean Sea, GSA17)
- 1 July 2020
- Published by Elsevier in Ocean & Coastal Management
- Vol. 192
Temporal and spatial patterns of trawl fishing activities in the Adriatic Sea (Central Mediterranean Sea, GSA17)
- Open Access
- 4 January 2020
- Published by Springer Nature
- p. 83-99
Predicting Fishing Effort and Catch Using Semantic Trajectories and Machine Learning
- 4 January 2020
- Published by Springer Nature
- p. 83-99
Open AccessPredicting Fishing Effort and Catch Using Semantic Trajectories and Machine Learning
- 31 May 2017
- Published by Springer Nature
- p. 407-421
Analysing Trajectories of Mobile Users: From Data Warehouses to Recommender Systems
- 31 May 2017
- Published by Springer Nature
- p. 407-421
Analysing Trajectories of Mobile Users: From Data Warehouses to Recommender Systems
- 1 March 2016
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 102, 22-41
Detecting avoidance behaviors between moving object trajectories
- 1 March 2016
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 102, 22-41
Detecting avoidance behaviors between moving object trajectories
- Open Access
Manycore processing of repeated k-NN queries over massive moving objects observations
The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. In this paper we focus on a specific data-intensive problem concerning the repeated processing of huge amounts of k nearest neighbours (k-NN) queries over massive sets of moving objects, where the spatial extents of queries and the position of objects are continuously modified over time. In particular, we propose a novel hybrid CPU/GPU pipeline that significantly accelerate query processing thanks to a combination of ad-hoc data structures and non-trivial memory access patterns. To the best of our knowledge this is the first work that exploits GPUs to efficiently solve repeated k-NN queries over massive sets of continuously moving objects, even characterized by highly skewed spatial distributions. In comparison with state-of-the-art sequential CPU-based implementations, our method highlights significant speedups in the order of 10x-20x, depending on the datasets, even when considering cheap GPUs.
Open AccessManycore processing of repeated k-NN queries over massive moving objects observations
The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. In this paper we focus on a specific data-intensive problem concerning the repeated processing of huge amounts of k nearest neighbours (k-NN) queries over massive sets of moving objects, where the spatial extents of queries and the position of objects are continuously modified over time. In particular, we propose a novel hybrid CPU/GPU pipeline that significantly accelerate query processing thanks to a combination of ad-hoc data structures and non-trivial memory access patterns. To the best of our knowledge this is the first work that exploits GPUs to efficiently solve repeated k-NN queries over massive sets of continuously moving objects, even characterized by highly skewed spatial distributions. In comparison with state-of-the-art sequential CPU-based implementations, our method highlights significant speedups in the order of 10x-20x, depending on the datasets, even when considering cheap GPUs.
- Open Access
Manycore processing of repeated range queries over massive moving objects observations
The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. Parallelism enables such applications to face this data-intensive challenge and allows the devised systems to feature low latency and high scalability. In this paper we focus on a specific data-intensive problem, concerning the repeated processing of huge amounts of range queries over massive sets of moving objects, where the spatial extents of queries and objects are continuously modified over time. To tackle this problem and significantly accelerate query processing we devise a hybrid CPU/GPU pipeline that compresses data output and save query processing work. The devised system relies on an ad-hoc spatial index leading to a problem decomposition that results in a set of independent data-parallel tasks. The index is based on a point-region quadtree space decomposition and allows to tackle effectively a broad range of spatial object distributions, even those very skewed. Also, to deal with the architectural peculiarities and limitations of the GPUs, we adopt non-trivial GPU data structures that avoid the need of locked memory accesses and favour coalesced memory accesses, thus enhancing the overall memory throughput. To the best of our knowledge this is the first work that exploits GPUs to efficiently solve repeated range queries over massive sets of continuously moving objects, characterized by highly skewed spatial distributions. In comparison with state-of-the-art CPU-based implementations, our method highlights significant speedups in the order of 14x-20x, depending on the datasets, even when considering very cheap GPUs.
Open AccessManycore processing of repeated range queries over massive moving objects observations
The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. Parallelism enables such applications to face this data-intensive challenge and allows the devised systems to feature low latency and high scalability. In this paper we focus on a specific data-intensive problem, concerning the repeated processing of huge amounts of range queries over massive sets of moving objects, where the spatial extents of queries and objects are continuously modified over time. To tackle this problem and significantly accelerate query processing we devise a hybrid CPU/GPU pipeline that compresses data output and save query processing work. The devised system relies on an ad-hoc spatial index leading to a problem decomposition that results in a set of independent data-parallel tasks. The index is based on a point-region quadtree space decomposition and allows to tackle effectively a broad range of spatial object distributions, even those very skewed. Also, to deal with the architectural peculiarities and limitations of the GPUs, we adopt non-trivial GPU data structures that avoid the need of locked memory accesses and favour coalesced memory accesses, thus enhancing the overall memory throughput. To the best of our knowledge this is the first work that exploits GPUs to efficiently solve repeated range queries over massive sets of continuously moving objects, characterized by highly skewed spatial distributions. In comparison with state-of-the-art CPU-based implementations, our method highlights significant speedups in the order of 14x-20x, depending on the datasets, even when considering very cheap GPUs.