VLDB 2026 Research / reviewers in the wild / expert
Ting-Ting Su
dblp:342/7471
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2024
0009-0000-4540-9131ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Hierarchical Alignment With Polar Contrastive Learning for Next-Basket RecommendationabstractNext-basket recommendation methods focus on the inference of the next basket by considering the corresponding basket sequence. Although many methods have been developed for the task, they usually suffer from data sparsity. The number of interactions between entities is relatively small compared to their huge bases, so it is crucial to mine as much hidden information as possible from the limited historical interactions for prediction. However, the existing methods mainly just treat the next-basket recommendation task as a single-view sequential prediction problem, which leads to the inadequate mining of the information hidden in multiple views, and the mining of other patterns in the historical interactions is neglected, thus making it difficult to learn high-quality representations and limiting the recommendation effect. To alleviate the above issues, we propose a novel method named HapCL for next-basket recommendation, which mines information from multiple views and patterns with the help of polar contrastive learning. A hierarchical module is designed to mine multiple patterns of historical interactions from different views at two levels. In order to mine self-supervised signals, we design a polar contrastive learning module with a novel graph-based augmentation approach. Experiments on three real-world datasets validate the effectiveness of HapCL. Ting-Ting Su, Chang-Dong Wang 0001, Wudong Xi, Jian-Huang Lai, Philip S. Yu |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2023 | MCRec: Multi-channel Gated Gifts RecommendationabstractIn recent years, various recommendation methods are proposed to capture user preferences more accurately, with the assumption that different types of records reflects the positive intention of users to buy items in different degree. However, the records of different channels may denote positive or negative impacts on users’ willingness to buy items in multi-channel scenario, which is a salient features of games. Making recommendation only with the records of buy channel makes it difficult to capture cross-channel impact of items. To solve the issue, this paper proposes a multi-channel gated gifts recommendation method, named MCRec, which is able to mine the impact of acquisition in different channels on buy channel from multi-channel records and generate personalized gifts for users. The MCRec method extracts channel-aware correlation of items from channel-aware item-item graphs. The contribution of different items in various sessions is distinguished with item gate, and the impact of the context of different channels on buy channel is measured with channel gate. Finally, personalized gifts will be generated hierarchically with different purposes. Extensive experiments are conducted on two datasets that are constructed with the data collected from two massively multiplayer online (MMO) games. The results demonstrate the superiority of our MCRec over state-of-the-art recommendation methods in gifts recommendation. Further ablation studies validate the effectiveness of the design of MCRec in modeling cross-channel impact of items. Ting-Ting Su, Wudong Xi, Xing-Xing Xing, Chang-Dong Wang 0001 |
ICDM | 1 |
| 2022 | Basket Booster for Prototype-based Contrastive Learning in Next Basket Recommendation
Ting-Ting Su, Zhenyu He 0009, Man-Sheng Chen, Chang-Dong Wang 0001 |
ECML/PKDD (1) | 1 |