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.

Lanlan Yu

dblp:88/7650 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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 · 100%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph representation learning
0.512021
Succinct Representation of Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2021
Data mining › time series analysis
change point detection
0.512021
Succinct Representation of Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2021
Data mining › structured data mining › graph mining
dynamic network analysis
0.512021
Succinct Representation of Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2021
Data mining
network analysis
0.512021
Succinct Representation of Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2021

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

matrix factorization · 1.0encoding-decoding · 1.0
YearPublicationVenuePosition
2026 CasAD: Adaptive irregular events modeling and temporal dynamics disentangling for information popularity prediction
Haoyue Zheng, Lanlan Yu, Shudong Huang, Tao Zhou 0001, Jiancheng Lv 0001, Quanhui Liu
Knowl. Based Syst.2
2025 Epidemic Informed Co-Evolution of Nodes and Edges with Graph Neural Networks for Source Detection
abstract
Accurate identification of the epidemic source is crucial for controlling the spread of infectious disease. During the spread of an epidemic, transmission occurs through the edges, which represent the contact relationship between individuals. Source detection, as a reverse problem, should be significantly benefited by leveraging the epidemic state of edges, as it entails both the direction of transmission and the likelihood of disease spreading through the edges. Although Graph Neural Network (GNN)-based methods have been developed for source detection, their performance is limited due to overlooking the epidemic state of edges. Here, we propose a novel GNN-based model, Adaptive Node and Edge Co-evolution Source Detection graph neural network (ANEC-SD), which utilizes the epidemic state of edges and optimizes the node representations individually to enhance prediction performance. In specific, the ANEC-SD consists of two innovative components, where the Co-evolution of Node and Edge Representations Layer is designed to refine the message aggregation mechanism for effectively characterizing the heterogeneous impact from a node to its neighbors by leveraging the epidemic state of edges. While the Propagation Controller determines the optimal number of propagation layers for each node according to node centrality within the infected subgraph, thereby mitigating the issue of over-smoothing. Experiments on six real-world networks demonstrate that our model significantly outperforms existing methods, achieving a 30% improvement on four out of six networks. Further analysis highlights the pivotal role of epidemic state of edges in message passing.
Ruixiao Wang 0003, Lanlan Yu, Xinfu Yang, Quanhui Liu, Tao Zhou 0001, Jiancheng Lv 0001
SMC2
2024 Estimating the time-varying effective reproduction number via Cycle Threshold-based Transformer
abstract
Monitoring the spread of infectious disease is essential to design and adjust the interventions timely for the prevention of the epidemic outbreak and safeguarding the public health. The governments have generally adopted the incidence-based statistical method to estimate the time-varying effective reproduction number Rt and evaluate the transmission ability of epidemics. However, this method exhibits biases arising from the reported incidence data and assumes the generation interval distribution which is not available at the early stage of epidemic. Recent studies showed that the viral loads characterized by cycle threshold (Ct) of the infected populations evolving throughout the course of epidemic and providing a possibility to infer the epidemic trajectory. In this work, we propose the Cycle Threshold-based Transformer (Ct-Transformer) to estimate Rt. We find the supervised learning of Ct-Transformer outperforms the traditional incidence-based statistic and Ct-based Rt estimating methods, and more importantly Ct-Transformer is robust to the detection resources. Further, we apply the proposed model to self-supervised pre-training tasks and obtain excellent fine-tuned performance, which attains comparable performance with the supervised Ct-Transformer, verified by both the synthetic and real-world datasets. We demonstrate that the Ct-based deep learning method can improve the real-time estimates of Rt, enabling more easily adapted to the track of the newly emerged epidemic.
Lanlan Yu, Wei-Yi Wang, Gui-Quan Sun, Jian-Cheng Lv, Tao Zhou 0001, Quanhui Liu
PLoS Comput. Biol.2
2022 Boosting semi-supervised network representation learning with pseudo-multitasking
Deshun Kong, Lanlan Yu, Ping Li 0024
Appl. Intell.4
2021 Succinct Representation of Dynamic Networks
abstract
Many network analysis tasks like classification over nodes require careful efforts in engineering features used by learning algorithms. Most of recent studies have been made and succeeded in the field of static network representation learning. However, real-world networks are often dynamic and little work has been done on how to describe dynamic networks. In this work, we pose the problem of condensing dynamic networks and introduce SuRep, an encoding-decoding framework which utilizes matrix factorization technique to derive a succinct representation of a dynamic network in any stationary phase. We show that the succinct representation method can uncover the invariant structural properties in the network evolution and derive dense feature representations of the nodes as the byproduct. This method can be easily extended to dynamic attribute networks. For experiments on detecting change points in dynamic networks and network classification with real-world datasets we demonstrate SuRep's potential for capturing latent patterns among nodes.
Lanlan Yu, Ping Li 0024, Jürgen Kurths
IEEE Trans. Knowl. Data Eng.2