Demo Data from EDBT 2026 / reviewers in the wild / expert
Wangtao Zhou
dblp:254/2137 · also Wang-Tao Zhou
· DBLP profile ↗
6ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0002-3252-6408ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging 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.
| Artificial intelligence
2 papers |
Probabilistic and Bayesian machine learning · 45% Deep learning architectures and training · 45% Graph learning · 10% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
attention mechanism |
1.0 | 1 | 2026 | ITPP: Learning Disentangled Event Dynamics in Marked Temporal Point Processes · AAAI 2026 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process › temporal point process
marked temporal point process |
1.0 | 1 | 2026 | ITPP: Learning Disentangled Event Dynamics in Marked Temporal Point Processes · AAAI 2026 |
Machine learning › Deep learning architectures and training › attention mechanism
self-attention |
1.0 | 1 | 2026 | ITPP: Learning Disentangled Event Dynamics in Marked Temporal Point Processes · AAAI 2026 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
temporal point process |
1.0 | 1 | 2026 | ITPP: Learning Disentangled Event Dynamics in Marked Temporal Point Processes · AAAI 2026 |
Machine learning › Graph learning › graph construction
anchor graph |
0.4 | 1 | 2020 | Large-Scale Multi-View Subspace Clustering in Linear Time · AAAI 2020 |
Data mining
clustering |
0.4 | 1 | 2020 | Large-Scale Multi-View Subspace Clustering in Linear Time · AAAI 2020 |
Data mining › clustering › high-dimensional clustering › subspace clustering
multi-view subspace clustering |
0.4 | 1 | 2020 | Large-Scale Multi-View Subspace Clustering in Linear Time · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
neural ODE · 1.0inverted self-attention · 1.0encoder-decoder · 1.0spectral clustering · 0.9anchor graph · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ITPP: Learning Disentangled Event Dynamics in Marked Temporal Point ProcessesabstractMarked Temporal Point Processes (MTPPs) provide a principled framework for modeling asynchronous event sequences by conditioning on the history of past events. However, most existing MTPP models rely on channel-mixing strategies that encode information from different event types into a single, fixed-size latent representation. This entanglement can obscure type-specific dynamics, leading to performance degradation and increased risk of overfitting. In this work, we introduce ITPP, a novel channel-independent architecture for MTPP modeling that decouples event type information using an encoder-decoder framework with an ODE-based backbone. Central to ITPP is a type-aware inverted self-attention mechanism, designed to explicitly model inter-channel correlations among heterogeneous event types. This architecture enhances effectiveness and robustness while reducing overfitting. Comprehensive experiments on multiple real-world and synthetic datasets demonstrate that ITPP consistently outperforms state-of-the-art MTPP models in both predictive accuracy and generalization. Wangtao Zhou, Zhao Kang 0001, Ke Yan 0002, Ling Tian |
AAAI | 1 |
| 2025 | Gradual Social Network Alignment with Relation Augmentation and Multi-view Embedding
Jingyuan Duan, Wangtao Zhou, Zhao Kang 0001, Ke Yan 0002 |
ICIC (8) | 2 |
| 2025 | Fine-grained Spatio-temporal Event Prediction with Self-adaptive Anchor GraphabstractEvent prediction tasks often handle spatio-temporal data distributed in a large spatial area. Different regions in the area exhibit different characteristics while having latent correlations. This spatial heterogeneity and correlations greatly affect the spatio-temporal distributions of event occurrences, which has not been addressed by state-of-the-art models. Learning spatial dependencies of events in a continuous space is challenging due to its fine granularity and a lack of prior knowledge. In this work, we propose a novel Graph Spatio-Temporal Point Process (GSTPP) model for fine-grained event prediction. It adopts an encoder-decoder architecture that jointly models the state dynamics of spatially localized regions using neural Ordinary Differential Equations (ODEs). The state evolution is built on the foundation of a novel Self-Adaptive Anchor Graph (SAAG) that captures spatial dependencies. By adaptively localizing the anchor nodes in the space and jointly constructing the correlation edges between them, the SAAG enhances the model’s ability of learning complex spatial event patterns. The proposed GSTPP model greatly improves the accuracy of fine-grained event prediction. Extensive experimental results show that our method greatly improves the prediction accuracy over existing spatio-temporal event prediction approaches. Wangtao Zhou, Zhao Kang 0001, Lizong Zhang, Ling Tian |
SDM | 1 |
| 2025 | Non-autoregressive diffusion-based temporal point processes for continuous-time long-term event prediction
Wangtao Zhou, Zhao Kang 0001, Ling Tian |
Expert Syst. Appl. | 1 |
| 2023 | Intensity-free convolutional temporal point process: Incorporating local and global event contexts
Wangtao Zhou, Zhao Kang 0001, Ling Tian |
Inf. Sci. | 1 |
| 2020 | Large-Scale Multi-View Subspace Clustering in Linear TimeabstractA plethora of multi-view subspace clustering (MVSC) methods have been proposed over the past few years. Researchers manage to boost clustering accuracy from different points of view. However, many state-of-the-art MVSC algorithms, typically have a quadratic or even cubic complexity, are inefficient and inherently difficult to apply at large scales. In the era of big data, the computational issue becomes critical. To fill this gap, we propose a large-scale MVSC (LMVSC) algorithm with linear order complexity. Inspired by the idea of anchor graph, we first learn a smaller graph for each view. Then, a novel approach is designed to integrate those graphs so that we can implement spectral clustering on a smaller graph. Interestingly, it turns out that our model also applies to single-view scenario. Extensive experiments on various large-scale benchmark data sets validate the effectiveness and efficiency of our approach with respect to state-of-the-art clustering methods. Zhao Kang 0001, Wangtao Zhou, Zhitong Zhao, Junming Shao, Zenglin Xu |
AAAI | 2 |