VLDB 2026 Research / reviewers in the wild / expert
Keqi Han
dblp:266/6204
· DBLP profile ↗
6ranked-venue papers
1as first author
5since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 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
4 papers |
Data mining · 52% Web and social media mining · 35% Data integration and cleaning · 12% | |
| Artificial intelligence
5 papers |
Graph learning · 61% Probabilistic and Bayesian machine learning · 23% Learning theory · 11% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph diffusion › information diffusion
diffusion network inference |
1.9 | 3 | 2024 | Learning Diffusions under Uncertainty · AAAI 2024 Multi-aspect Diffusion Network Inference · WWW 2023 Diffusion Network Inference from Partial Observations · AAAI 2021 |
Web and social media mining › information diffusion
diffusion network inference |
1.2 | 2 | 2023 | Multi-aspect Diffusion Network Inference · WWW 2023 Reconstructing Diffusion Networks from Incomplete Data · IJCAI 2022 |
Data mining
network inference |
0.9 | 2 | 2024 | Multi-aspect Diffusion Network Inference · WWW 2023 Learning Diffusions under Uncertainty · AAAI 2024 |
Data mining
anomaly detection |
0.6 | 1 | 2022 | Reconstructing Diffusion Networks from Incomplete Data · IJCAI 2022 |
Data integration and cleaning › missing data
missing value imputation |
0.6 | 1 | 2022 | Reconstructing Diffusion Networks from Incomplete Data · IJCAI 2022 |
Data mining
network analysis |
0.6 | 1 | 2022 | Reconstructing Diffusion Networks from Incomplete Data · IJCAI 2022 |
Machine learning › Graph learning › graph inference
network structure inference |
0.5 | 1 | 2021 | Diffusion Network Inference from Partial Observations · AAAI 2021 |
Machine learning › Learning theory
statistical estimation |
0.4 | 1 | 2020 | Statistical Estimation of Diffusion Network Topologies · ICDE 2020 |
Web and social media mining › information diffusion
diffusion network |
0.4 | 1 | 2020 | Statistical Estimation of Diffusion Network Topologies · ICDE 2020 |
Data mining › structured data mining
graph mining |
0.4 | 1 | 2020 | Statistical Estimation of Diffusion Network Topologies · ICDE 2020 |
Machine learning › Generative modeling › generative model
probabilistic generative model |
0.2 | 1 | 2023 | Multi-aspect Diffusion Network Inference · WWW 2023 |
Machine learning › Probabilistic and Bayesian machine learning
probabilistic inference |
0.2 | 1 | 2022 | Reconstructing Diffusion Networks from Incomplete Data · IJCAI 2022 |
Methods — techniques the papers use, named apart from their topics
constrained nonlinear regression · 1.5alternating maximization · 1.5probabilistic generative model · 1.3posterior inference · 1.3expectation-maximization · 1.1correlation analysis · 1.1decomposable local search · 0.9correlation-based pruning · 0.9maximum likelihood estimation · 0.5iterative imputation · 0.5scoring criterion · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Causal Brain Connectivity: Integrating Granger Directed Graphs in fMRI Analysis
Keqi Han, Jiawei Nie, Chenyu You, Sanne J. H. van Rooij, Jennifer S. Stevens, Boadie Dunlop, Charles Gillespie, Carl Yang 0001 |
AIME (2) | 2 |
| 2024 | Learning Diffusions under UncertaintyabstractTo infer a diffusion network based on observations from historical diffusion processes, existing approaches assume that observation data contain exact occurrence time of each node infection, or at least the eventual infection statuses of nodes in each diffusion process. They determine potential influence relationships between nodes by identifying frequent sequences, or statistical correlations, among node infections. In some real-world settings, such as the spread of epidemics, tracing exact infection times is often infeasible due to a high cost; even obtaining precise infection statuses of nodes is a challenging task, since observable symptoms such as headache only partially reveal a node’s true status. In this work, we investigate how to effectively infer a diffusion network from observation data with uncertainty. Provided with only probabilistic information about node infection statuses, we formulate the problem of diffusion network inference as a constrained nonlinear regression w.r.t. the probabilistic data. An alternating maximization method is designed to solve this regression problem iteratively, and the improvement of solution quality in each iteration can be theoretically guaranteed. Empirical studies are conducted on both synthetic and real-world networks, and the results verify the effectiveness and efficiency of our approach. Hao Huang 0001, Qian Yan 0001, Keqi Han, Ting Gan, Jiawei Jiang 0001, Quanqing Xu, Chuanhui Yang |
AAAI | 3 |
| 2023 | Multi-aspect Diffusion Network InferenceabstractTo learn influence relationships between nodes in a diffusion network, most existing approaches resort to precise timestamps of historical node infections. The target network is customarily assumed as an one-aspect diffusion network, with homogeneous influence relationships. Nonetheless, tracing node infection timestamps is often infeasible due to high cost, and the type of influence relationships may be heterogeneous because of the diversity of propagation media. In this work, we study how to infer a multi-aspect diffusion network with heterogeneous influence relationships, using only node infection statuses that are more readily accessible in practice. Equipped with a probabilistic generative model, we iteratively conduct a posteriori, quantitative analysis on historical diffusion results of the network, and infer the structure and strengths of homogeneous influence relationships in each aspect. Extensive experiments on both synthetic and real-world networks are conducted, and the results verify the effectiveness and efficiency of our approach. Hao Huang 0001, Keqi Han, Beicheng Xu, Ting Gan |
WWW | 2 |
| 2022 | Reconstructing Diffusion Networks from Incomplete DataabstractTo reconstruct the topology of a diffusion network, existing approaches customarily demand not only eventual infection statuses of nodes, but also the exact times when infections occur. In real-world settings, such as the spread of epidemics, tracing the exact infection times is often infeasible; even obtaining the eventual infection statuses of all nodes is a challenging task. In this work, we study topology reconstruction of a diffusion network with incomplete observations of the node infection statuses. To this end, we iteratively infer the network topology based on observed infection statuses and estimated values for unobserved infection statuses by investigating the correlation of node infections, and learn the most probable probabilities of the infection propagations among nodes w.r.t. current inferred topology, as well as the corresponding probability distribution of each unobserved infection status, which in turn helps update the estimate of unobserved data. Extensive experimental results on both synthetic and real-world networks verify the effectiveness and efficiency of our approach. Hao Huang 0001, Keqi Han, Beicheng Xu, Ting Gan |
IJCAI | 2 |
| 2021 | Diffusion Network Inference from Partial ObservationsabstractTo infer the structure of a diffusion network from observed diffusion results, existing approaches customarily assume that observed data are complete and contain the final infection status of each node, as well as precise timestamps of node infections. Due to high cost and uncertainties in the monitoring of node infections, exact timestamps are often unavailable in practice, and even the final infection statuses of nodes are sometimes missing. In this work, we study how to carry out diffusion network inference without infection timestamps, using only partial observations of the final infection statuses of nodes. To this end, we iteratively infer the structure of the target diffusion network with observed data and imputed values for missing data, and learn the most likely infection transmission probabilities between nodes w.r.t. current inferred structure, which then help us update the imputation of missing data in turn. Extensive experimental results on both synthetic and real-world networks show that our approach can properly handle missing data and accurately uncover diffusion network structures. Ting Gan, Keqi Han, Hao Huang 0001, Yunjun Gao, Zongpeng Li |
AAAI | 2 |
| 2020 | Statistical Estimation of Diffusion Network TopologiesabstractReconstructing the topology of a diffusion network based on observed diffusion results is an open challenge in data mining. Existing approaches mostly assume that the observed diffusion results are available and consist of not only the final infection statuses of nodes, but also the exact timestamps that pinpoint when infections occur. Nonetheless, the exact infection timestamps are often unavailable in practice, due to a high cost and uncertainties in the monitoring of node infections. In this work, we investigate the problem of how to infer the topology of a diffusion network from only the final infection statuses of nodes. To this end, we propose a new scoring criterion for diffusion network reconstruction, which is able to estimate the likelihood of potential topologies of the objective diffusion network based on infection status results with a relatively low statistical error. As the proposed scoring criterion is decomposable, our problem is transformed into finding for each node in the network a set of most probable parent nodes that maximizes the value of a local score. Furthermore, to eliminate redundant computations during the search of most probable parent nodes, we identify insignificant candidate parent nodes by checking whether their infections have negative or extremely low positive correlations with the infections of a corresponding child node, and exclude them from the search space. Extensive experiments on both synthetic and real-world networks are conducted, and the results verify the effectiveness and efficiency of our approach. Keqi Han, Hao Huang 0001, Yunjun Gao |
ICDE | 1 |