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

Lianglong Li

dblp:293/0581 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 54% Graph learning · 46%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.812024
CUTS+: High-Dimensional Causal Discovery from Irregular Time-Series · AAAI 2024
Machine learning › Graph learning
graph neural network
0.812024
CUTS+: High-Dimensional Causal Discovery from Irregular Time-Series · AAAI 2024
Machine learning › Graph learning › graph neural network
message passing
0.812024
CUTS+: High-Dimensional Causal Discovery from Irregular Time-Series · AAAI 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
time series causal discovery
0.812024
CUTS+: High-Dimensional Causal Discovery from Irregular Time-Series · AAAI 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
granger causality
0.212024
CUTS+: High-Dimensional Causal Discovery from Irregular Time-Series · AAAI 2024

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

graph neural network · 0.8granger causality · 0.8coarse-to-fine discovery · 0.8
YearPublicationVenuePosition
2024 CUTS+: High-Dimensional Causal Discovery from Irregular Time-Series
abstract
Causal discovery in time-series is a fundamental problem in the machine learning community, enabling causal reasoning and decision-making in complex scenarios. Recently, researchers successfully discover causality by combining neural networks with Granger causality, but their performances degrade largely when encountering high-dimensional data because of the highly redundant network design and huge causal graphs. Moreover, the missing entries in the observations further hamper the causal structural learning. To overcome these limitations, We propose CUTS+, which is built on the Granger-causality-based causal discovery method CUTS and raises the scalability by introducing a technique called Coarse-to-fine-discovery (C2FD) and leveraging a message-passing-based graph neural network (MPGNN). Compared to previous methods on simulated, quasi-real, and real datasets, we show that CUTS+ largely improves the causal discovery performance on high-dimensional data with different types of irregular sampling.
Yuxiao Cheng, Lianglong Li, Tingxiong Xiao, Zongren Li, Jin-Li Suo, Kunlun He, Qionghai Dai
AAAI2