Demo Data from EDBT 2026 / reviewers in the wild / expert
Zizhuo Meng
dblp:292/1458
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0002-1934-5362ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers |
Probabilistic and Bayesian machine learning · 72% Learning theory · 22% Graph learning · 6% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
point process |
1.5 | 2 | 2024 | Is Score Matching Suitable for Estimating Point Processes? · NeurIPS 2024 Interpretable Transformer Hawkes Processes: Unveiling Complex Interactions in Social Networks · KDD 2024 |
Machine learning › Learning theory › statistical estimation › statistical consistency
estimator consistency |
0.8 | 1 | 2024 | Is Score Matching Suitable for Estimating Point Processes? · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process › temporal point process
hawkes process |
0.8 | 1 | 2024 | Interpretable Transformer Hawkes Processes: Unveiling Complex Interactions in Social Networks · KDD 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
maximum likelihood estimation |
0.2 | 1 | 2024 | Is Score Matching Suitable for Estimating Point Processes? · NeurIPS 2024 |
Machine learning › Graph learning
social network analysis |
0.2 | 1 | 2024 | Interpretable Transformer Hawkes Processes: Unveiling Complex Interactions in Social Networks · KDD 2024 |
Methods — techniques the papers use, named apart from their topics
weighted score matching · 0.8transformer · 0.8score matching · 0.8attention mechanism · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | TransFeat-TPP: An Interpretable Deep Covariate Temporal Point ProcessesabstractThe classical temporal point process (TPP) constructs an intensity function by taking the occurrence times into account. Nevertheless, occurrence time may not be the only relevant factor, other contextual data, termed covariates, may also impact the event evolution. Incorporating such covariates into the model is beneficial, while distinguishing their relevance to the event dynamics is of great practical significance. In this work, we propose a Transformer-based covariate temporal point process (TransFeat-TPP) model to improve the interpretability of deep covariate-TPPs while maintaining powerful expressiveness. TransFeat-TPP can effectively model complex relationships between events and covariates, and provide enhanced interpretability by discerning the importance of various covariates. Experimental results on synthetic and real datasets demonstrate improved prediction accuracy and consistently interpretable feature importance when compared to existing deep covariate-TPPs. Our code is available at https://github.com/waystogetthere/TransFeat.git. Zizhuo Meng, Boyu Li 0003, Xuhui Fan 0001, Zhidong Li, Yang Wang 0002, Fang Chen 0001, Feng Zhou 0011 |
ECAI | 1 |
| 2024 | Interpretable Transformer Hawkes Processes: Unveiling Complex Interactions in Social NetworksabstractSocial networks represent complex ecosystems where the interactions between users or groups play a pivotal role in information dissemination, opinion formation, and social interactions.Effectively harnessing event sequence data within social networks to unearth interactions among users or groups has persistently posed a challenging frontier within the realm of point processes.Current deep point process models face inherent limitations within the context of social networks, constraining both their interpretability and expressive power.These models encounter challenges in capturing interactions among users or groups and often rely on parameterized extrapolation methods when modeling intensity over non-event intervals, limiting their capacity to capture complex intensity patterns beyond observed events.To address these challenges, this study proposes modifications to Transformer Hawkes processes (THP), leading to the development of interpretable Transformer Hawkes processes (ITHP).ITHP inherits the strengths of THP while aligning with statistical nonlinear Hawkes processes, thereby enhancing its interpretability and providing valuable insights into interactions between users or groups.Additionally, ITHP enhances the flexibility of the intensity function over non-event intervals, making it better suited to capture complex event propagation patterns in social networks.Experimental results, both on synthetic and real data, demonstrate the effectiveness of ITHP in overcoming the identified limitations.Moreover, they highlight ITHP's applicability in the context of exploring the complex impact Zizhuo Meng, Ke Wan 0002, Yadong Huang, Zhidong Li, Yang Wang 0002, Feng Zhou 0011 |
KDD | 1 |
| 2024 | Is Score Matching Suitable for Estimating Point Processes?abstractScore matching estimators for point processes have gained widespread attention in recent years because they do not require the calculation of intensity integrals, thereby effectively addressing the computational challenges in maximum likelihood estimation (MLE). Some existing works have proposed score matching estimators for point processes. However, this work demonstrates that the incompleteness of the estimators proposed in those works renders them applicable only to specific problems, and they fail for more general point processes. To address this issue, this work introduces the weighted score matching estimator to point processes. Theoretically, we prove the consistency of the estimator we propose. Experimental results indicate that our estimator accurately estimates model parameters on synthetic data and yields results consistent with MLE on real data. In contrast, existing score matching estimators fail to perform effectively. Codes are publicly available at \url{https://github.com/KenCao2007/WSM_TPP}. Haoqun Cao, Zizhuo Meng, Tianjun Ke |
NeurIPS | 2 |
| 2021 | A Multi-task Kernel Learning Algorithm for Survival Analysis
Zizhuo Meng, Jie Xu 0008, Zhidong Li, Yang Wang 0002, Fang Chen 0001, Zhiyong Wang 0001 |
PAKDD (3) | 1 |