Giacomo Chiarot
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Giacomo Chiarot has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Emanuele Cinà
University of Genoa
1 shared publication Claudio Silvestri
Department of Environmental Sciences, Informatics, and Statistics, Ca Foscari University, Venice, Italy
1 shared publication- Claudio Silvestri
Università Ca’ Foscari Venezia
1 shared publication - Guglielmo Beretta
Università Ca' Foscari Venezia Italy
1 shared publication - Idoia Ochoa
Instituto de Ciencia de los Datos e Inteligencia Artificial (DATAI), University of Navarra, Pamplona, Spain
1 shared publication - Marcello Pelillo
Università Ca' Foscari Venezia, Venice, Italy and Zhejiang Normal University, Jinhua, China
1 shared publication
Latest Publications
- Open Access
- 21 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 51693-51701
RAT-CC: A Recurrent Autoencoder for Time-Series Compression and Classification
The growth of interconnected devices has led to an enormous volume of temporal data that requires specialized compression models for efficient storage. Besides this, most applications need to classify these data efficiently, and having to reconstruct the original data from the compressed representation to then classify them is not optimal. For this reason, we propose a Recurrent Autoencoder for Timeseries Compression and Classification, termed RAT-CC, that allows to perform any classification task on the compressed representation without needing to reconstruct the original time-series data. RAT-CC leverages a Long Short-Term Memory (LSTM) recurrent autoencoder with a dual-loss function: the standard reconstruction loss to minimize reconstruction error; and an embedding loss to preserve relative distances in the compressed embedding space. This combined loss ensures that the learned embeddings remain meaningful for classification tasks while preserving the necessary information for reconstruction. We assess the compression and classification performance of RAT-CC on four datasets taken from different domains. RAT-CC is implemented in Keras and freely available at https://github.com/ChJ4m3s/RAT-CC.
- 21 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 51693-51701
Open AccessRAT-CC: A Recurrent Autoencoder for Time-Series Compression and Classification
The growth of interconnected devices has led to an enormous volume of temporal data that requires specialized compression models for efficient storage. Besides this, most applications need to classify these data efficiently, and having to reconstruct the original data from the compressed representation to then classify them is not optimal. For this reason, we propose a Recurrent Autoencoder for Timeseries Compression and Classification, termed RAT-CC, that allows to perform any classification task on the compressed representation without needing to reconstruct the original time-series data. RAT-CC leverages a Long Short-Term Memory (LSTM) recurrent autoencoder with a dual-loss function: the standard reconstruction loss to minimize reconstruction error; and an embedding loss to preserve relative distances in the compressed embedding space. This combined loss ensures that the learned embeddings remain meaningful for classification tasks while preserving the necessary information for reconstruction. We assess the compression and classification performance of RAT-CC on four datasets taken from different domains. RAT-CC is implemented in Keras and freely available at https://github.com/ChJ4m3s/RAT-CC.
- 26 February 2025
- Published by Springer Nature
- p. 119-128
Computing the Capacity of Discrete Channels Using Vector Flows
- 26 February 2025
- Published by Springer Nature
- p. 119-128
Computing the Capacity of Discrete Channels Using Vector Flows
- 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.