paper-with-me

Papers

Matrix Completion With Variational Graph Autoencoders: Application in Hyperlocal Air Quality Inference

2018-11-05 · Tien Huu Do, Duc Minh Nguyen, Evaggelia Tsiligianni, Angel Lopez Aguirre, Valerio Panzica La Manna, Frank Pasveer, Wilfried Philips, Nikos Deligiannis

Inferring air quality from a limited number of observations is an essential task for monitoring and controlling air pollution. Existing inference methods typically use low spatial resolution data collected by fixed monitoring stations and infer the concentration of air pollutants using additional types of data, e.g., meteorological and traffic information. In this work, we focus on street-level air quality inference by utilizing data collected by mobile stations. We formulate air quality inference in this setting as a graph-based matrix completion problem and propose a novel variational model based on graph convolutional autoencoders. Our model captures effectively the spatio-temporal correlation of the measurements and does not depend on the availability of additional information apart from the street-network topology. Experiments on a real air quality dataset, collected with mobile stations, shows that the proposed model outperforms state-of-the-art approaches.

📄 PDF Abstract BibTeX arXiv:1811.01662

Code (0)

등록된 구현이 없습니다.

Tasks

Air Quality InferenceMatrix Completion

Similar Papers 제목 키워드 기반

1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation

2016-04-14 · Vincent Cottet, Pierre Alquier

Due to challenging applications such as collaborative filtering, the matrix completion problem has been widely studied in the past few years. Different approaches rely on different structure assumptions on the matrix in …

Collaborative FilteringLearning TheoryMatrix Completion

Approximate Method of Variational Bayesian Matrix Factorization/Completion with Sparse Prior

2018-03-14 · Ryota Kawasumi, Koujin Takeda

We derive analytical expression of matrix factorization/completion solution by variational Bayes method, under the assumption that observed matrix is originally the product of low-rank dense and sparse matrices with addi…

Matrix Completion

Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks

2019-10-02 · Guillaume Salha, Romain Hennequin, Michalis Vazirgiannis

Graph autoencoders (AE) and variational autoencoders (VAE) recently emerged as powerful node embedding methods, with promising performances on challenging tasks such as link prediction and node clustering. Graph AE, VAE …

ClusteringLink PredictionNode Clustering

Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion

2020-08-11 · Rui Liu, Alex Olshevsky

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational ch…

Matrix Completion

The advantage of using Student's t-priors in variational autoencoders

2019-09-25 · Najmeh Abiri, Mattias Ohlsson

Is it optimal to use the standard Gaussian prior in variational autoencoders? With Gaussian distributions, which are not weakly informative priors, variational autoencoders struggle to reconstruct the actual data. We pro…