Search Results for author: Francesco Piccialli

Found 7 papers, 2 papers with code

DeepVATS: Deep Visual Analytics for Time Series

1 code implementation8 Feb 2023 Victor Rodriguez-Fernandez, David Montalvo, Francesco Piccialli, Grzegorz J. Nalepa, David Camacho

DeepVATS trains, in a self-supervised way, a masked time series autoencoder that reconstructs patches of a time series, and projects the knowledge contained in the embeddings of that model in an interactive plot, from which time series patterns and anomalies emerge and can be easily spotted.

Time Series Time Series Analysis

A Deep Learning Approach for Predicting Two-dimensional Soil Consolidation Using Physics-Informed Neural Networks (PINN)

no code implementations9 Apr 2022 Yue Lu, Gang Mei, Francesco Piccialli

To address the above problem, in this paper, we propose a deep learning method using physics-informed neural networks (PINN) to predict the excess pore water pressure of two-dimensional soil consolidation.

Scientific Machine Learning through Physics-Informed Neural Networks: Where we are and What's next

2 code implementations14 Jan 2022 Salvatore Cuomo, Vincenzo Schiano di Cola, Fabio Giampaolo, Gianluigi Rozza, Maziar Raissi, Francesco Piccialli

Physics-Informed Neural Networks (PINN) are neural networks (NNs) that encode model equations, like Partial Differential Equations (PDE), as a component of the neural network itself.

Multi-Task Learning

Heterogeneous Data Fusion Considering Spatial Correlations using Graph Convolutional Networks and its Application in Air Quality Prediction

no code implementations24 May 2021 Zhengjing Ma, Gang Mei, Salvatore Cuomo, Francesco Piccialli

In the proposed method, first, we assemble a fusion matrix using the proposed RBF-based fusion approach; second, based on the fused data, we construct spatially and temporally correlated data as inputs for the predictive model; finally, we employ the spatiotemporal graph convolutional network (STGCN) to predict the future trends of some observations.

KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

no code implementations21 Aug 2020 Gang Mei, Jingzhi Tu, Lei Xiao, Francesco Piccialli

Comparative results demonstrate that the proposed graph clustering algorithm is accurate yet efficient for large networks, which also means that it can be further used to evaluate the intra-cluster and inter-cluster trusts on large networks.

Clustering Graph Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.