Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lianyan Li

dblp:258/7869 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-6472-7001ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 56% Data integration and cleaning · 44%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph representation learning
0.712023
DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation · Proc. ACM Manag. Data 2023
Data integration and cleaning › missing data
missing value imputation
0.712023
DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation · Proc. ACM Manag. Data 2023
Data mining › time series analysis
multivariate time series imputation
0.712023
DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation · Proc. ACM Manag. Data 2023

Methods — techniques the papers use, named apart from their topics

graph neural network · 1.3adjacency matrix representation learning · 1.3
YearPublicationVenuePosition
2024 Periormer: Periodic Transformer for Seasonal and Irregularly Sampled Time Series
abstract
Time series prediction presents a significant challenge across various domains, such as transportation systems, environmental science, and multiple industrial sectors. Real-world time series data commonly exhibit periodic patterns and irregular sampling rates. Recent advancements in long sequence time series forecasting have made significant progress in adopting deep neural networks, particularly the Transformers, renowned for their robust representational capabilities. However, current Transformer-based models consider time steps as discrete tokens, thereby failing to account for periodicity and temporal intervals when selecting relevant time steps in the past. To address this limitation, we propose an end-to-end framework called Periormer for forecasting irregularly sampled time series. Periormer comprises three key components: (1) a novel input embedding layer that encodes the periodicity and time interval information, analogous to positional encoding in Transformers; (2) a feature-wise periodic attention mechanism that selects essential data points considering the periods and amplitudes of the periodic signals; and (3) a cross-feature periodic attention mechanism that identifies essential features relevant to the prediction. Experiments on four real-world datasets and one synthetic dataset demonstrate that Periormer reduces the mean squared error by 14.9% compared to state-of-the-art models.
Kaiqi Zhao 0001, Katerina Tashkova, Patricia J. Riddle, Lianyan Li
CIKM5
2023 DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation
abstract
Missing data imputation for location-based sensor data has attracted much attention in recent years. The state-of-the-art imputation methods based on graph neural networks have a priori assumption that the spatial correlations between sensor locations are static. However, real-world data sets often exhibit dynamic spatial correlations. This paper proposes a novel approach to capturing the dynamics of spatial correlations between geographical locations as a composition of the constant, long-term trends and periodic patterns. To this end, we design a new method called Dynamic Adjacency Matrix Representation (DAMR) that extracts various dynamic patterns of spatial correlations and represents them as adjacency matrices. The adjacency matrices are then aggregated and fed into a well-designed graph representation learning layer for predicting the missing values. Through extensive experiments on six real-world data sets, we demonstrate that DAMR reduces the MAE by up to 19.4% compared with the state-of-the-art methods for the missing value imputation task
Kaiqi Zhao 0001, Patricia J. Riddle, Katerina Tashkova, Qingyi Pan, Lianyan Li
Proc. ACM Manag. Data6