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

Ruixuan Zhao

dblp:15/8188 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.612022
Learning linear non-Gaussian directed acyclic graph with diverging number of nodes · J. Mach. Learn. Res. 2022
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
linear non-gaussian acyclic model
0.612022
Learning linear non-Gaussian directed acyclic graph with diverging number of nodes · J. Mach. Learn. Res. 2022
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.612022
Learning linear non-Gaussian directed acyclic graph with diverging number of nodes · J. Mach. Learn. Res. 2022
YearPublicationVenuePosition
2024 Neural ODE-Guided Imputation Computing for Building IoT Time Series with High Missing Gaps
abstract
Imputing missing data in Building Internet of Things (BIoT) poses a significant challenge due to the complex multi-dimensional variations and the inevitable occurrence of long-span missing gaps during maintenance or repair periods. In this paper, we introduce ODE-MI, a novel neural ODE-guided Multiple Imputation framework tailored for BIoT time series with high missing gaps. ODE-MI integrates shapelet-wise convolution, node embeddings, and dynamic graph embeddings with transfer delay to capture compound spatio-temporal (ST) volatilities, trends, and high-order impact transfer. Our contributions include the design of a multi-faceted backbone network capable of capturing long-distance ST characteristics in BIoT, and the development of the ODE-MI framework to handle long-term missing data within networked dynamic attributes. Empirical assessments using open datasets demonstrate that ODE-MI outperforms existing imputation methods, especially in scenarios involving continuous long-span missing gaps.
Ruixuan Zhao, Chuyi Chen, Shenghang Liu, Jie Liu 0029, Hongan Wang
CSCWD1
2024 REHG: A Recommender Engine Based on Heterogeneous Graph
Xiaoyang Xin, Zesheng Cheng, Tiankuan Wang, Mengqiu Yan, Ruixuan Zhao
WASA (1)5
2022 Learning linear non-Gaussian directed acyclic graph with diverging number of nodes
abstract
An acyclic model, often depicted as a directed acyclic graph (DAG), has been widely employed to represent directional causal relations among collected nodes. In this article, we propose an efficient method to learn linear non-Gaussian DAG in high dimensional cases, where the noises can be of any continuous non-Gaussian distribution. The proposed method leverages the concept of topological layer to facilitate the DAG learning, and its theoretical justification in terms of exact DAG recovery is also established under mild conditions. Particularly, we show that the topological layers can be exactly reconstructed in a bottom-up fashion, and the parent-child relations among nodes can also be consistently established. The established asymptotic DAG recovery is in sharp contrast to that of many existing learning methods assuming parental faithfulness or ordered noise variances. The advantage of the proposed method is also supported by the numerical comparison against some popular competitors in various simulated examples as well as a real application on the global spread of COVID-19.
Ruixuan Zhao
J. Mach. Learn. Res.1