Demo Data from EDBT 2026 / reviewers in the wild / expert
Tianqi He
dblp:278/5117
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 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
3 papers |
Recommender systems · 52% Data mining · 31% Machine learning and data management · 17% | |
| Artificial intelligence
2 papers |
Representation and self-supervised learning · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning
contrastive learning |
1.0 | 2 | 2024 | Disentangled Contrastive Hypergraph Learning for Next POI Recommendation · SIGIR 2024 DMBIN: A Dual Multi-behavior Interest Network for Click-Through Rate Prediction via Contrastive Learning · SIGIR 2023 |
Data mining › feature engineering
automated feature engineering |
0.9 | 1 | 2025 | Fastft: Accelerating Reinforced Feature Transformation via Advanced Exploration Strategies · ICDE 2025 |
Machine learning and data management
feature transformation |
0.9 | 1 | 2025 | Fastft: Accelerating Reinforced Feature Transformation via Advanced Exploration Strategies · ICDE 2025 |
Data mining › structured data mining › graph mining › graph learning
hypergraph learning |
0.8 | 1 | 2024 | Disentangled Contrastive Hypergraph Learning for Next POI Recommendation · SIGIR 2024 |
Recommender systems
point-of-interest recommendation |
0.8 | 1 | 2024 | Disentangled Contrastive Hypergraph Learning for Next POI Recommendation · SIGIR 2024 |
Recommender systems
click-through rate prediction |
0.7 | 1 | 2023 | DMBIN: A Dual Multi-behavior Interest Network for Click-Through Rate Prediction via Contrastive Learning · SIGIR 2023 |
Recommender systems › implicit feedback learning
multi-behavior recommendation |
0.7 | 1 | 2023 | DMBIN: A Dual Multi-behavior Interest Network for Click-Through Rate Prediction via Contrastive Learning · SIGIR 2023 |
Recommender systems
user interest modeling |
0.7 | 1 | 2023 | DMBIN: A Dual Multi-behavior Interest Network for Click-Through Rate Prediction via Contrastive Learning · SIGIR 2023 |
Methods — techniques the papers use, named apart from their topics
disentangled representation learning · 2.8contrastive learning · 2.8hypergraph convolutional network · 1.5reinforcement learning · 0.9prioritized memory buffer · 0.9novelty-based reward · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Fastft: Accelerating Reinforced Feature Transformation via Advanced Exploration StrategiesabstractFeature Transformation is crucial for classic machine learning that aims to generate feature combinations to enhance the performance of downstream tasks from a data-centric perspective. Current methodologies, such as manual expert-driven processes, iterative-feedback techniques, and exploration-generative tactics, have shown promise in automating such data engineering workflow by minimizing human involvement. However, three challenges remain in those frameworks: (1) It predominantly depends on downstream task performance metrics, as assessment is time-consuming, especially for large datasets. (2) The diversity of feature combinations will hardly be guaranteed after random exploration ends. (3) Rare significant transformations lead to sparse valuable feedback that hinders the learning processes or leads to less effective results. In response to these challenges, we introduce FASTFT, an innovative framework that leverages a trio of advanced strategies. We first decouple the feature transformation evaluation from the outcomes of the generated datasets via the performance predictor. To address the issue of reward sparsity, we developed a method to evaluate the novelty of generated transformation sequences. Incorporating this novelty into the reward function accelerates the model's exploration of effective transformations, thereby improving the search productivity. Additionally, we combine novelty and performance to create a prioritized memory buffer, ensuring that essential experiences are effectively revisited during exploration. Our extensive experimental evaluations validate the performance, efficiency, and traceability of our proposed framework, showcasing its superiority in handling complex feature transformation tasks11The code and data are publicly accessible via Github.. Tianqi He, Xiaohan Huang 0003, Yi Du 0010, Qingqing Long, Ziyue Qiao, Min Wu 0008, Yanjie Fu, Yuanchun Zhou, Meng Xiao 0001 |
ICDE | 1 |
| 2024 | Disentangled Contrastive Hypergraph Learning for Next POI RecommendationabstractNext point-of-interest (POI) recommendation has been a prominent and trending task to provide next suitable POI suggestions for users. Most existing sequential-based and graph neural network-based methods have explored various approaches to modeling user visiting behaviors and have achieved considerable performances. However, two key issues have received less attention: i) Most previous studies have ignored the fact that user preferences are diverse and constantly changing in terms of various aspects, leading to entangled and suboptimal user representations. ii) Many existing methods have inadequately modeled the crucial cooperative associations between different aspects, hindering the ability to capture complementary recommendation effects during the learning process. To tackle these challenges, we propose a novel framework Disentangled Contrastive Hypergraph Learning (DCHL) for next POI recommendation. Specifically, we design a multi-view disentangled hypergraph learning component to disentangle intrinsic aspects among collaborative, transitional and geographical views with adjusted hypergraph convolutional networks. Additionally, we propose an adaptive fusion method to integrate multi-view information automatically. Finally, cross-view contrastive learning is employed to capture cooperative associations among views and reinforce the quality of user and POI representations based on self-discrimination. Extensive experiments on three real-world datasets validate the superiority of our proposal over various state-of-the-arts. To facilitate future research, our code is available at https://github.com/icmpnorequest/SIGIR2024_DCHL. Yantong Lai, Yijun Su, Lingwei Wei, Tianqi He, Gaode Chen, Daren Zha |
SIGIR | 4 |
| 2023 | DMBIN: A Dual Multi-behavior Interest Network for Click-Through Rate Prediction via Contrastive LearningabstractClick-through rate (CTR) prediction plays a critical role in various online applications, aiming to estimate the user's click probability. User interest modeling from various interactive behaviors(e.g., click, add-to-cart, order) is becoming a mainstream approach to CTR prediction. We argue that the various user behaviors contain two important intrinsic characteristics: 1) The discrepancy in various behaviors reveals different aspects of user's behavior-specific interests. For example, one may click out of need but pay more attention to the rating when purchasing. 2) The consistency of various behaviors contains user's behavior-invariant interest. For example, the user prefers interacted items rather than other items. Therefore, it is necessary to disentangle the discrepancy and consistency signals from the massive behavior information. Unfortunately, previous methods have yet to study this phenomenon well, which limits the recommendation performance. Tianqi He, Dong Wang 0022 |
SIGIR | 1 |