Yuntao Du

Yuntao Du

Auto-generated profile, based on publicly available information

Yuntao Du

College of Computer Science, Zhejiang University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 April 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YDYuntao Du
Yuntao Du
XZXinjun Zhu
Xinjun Zhu
LCLu Chen
Lu Chen
ZFZiquan Fang
Ziquan Fang
YGYunjun Gao
Yunjun Gao
Recently, knowledge graphs (KGs) are popularly used as the auxiliary information to enable more accurate, explainable, and diverse user preference recommendations. Specifically, existing KG-based recommendation methods target modeling high-order relations/dependencies from long connectivity user-item interactions hidden in KG. However, most of them ignore the cold-start problems (i.e., user cold-start and item cold-start) of recommendation analytics, which restricts their performance in scenarios when involving new users or new items. Inspired by the success of meta-learning on scarce training samples, we propose a novel meta-learning based framework called MetaKG, which encompasses a collaborative-aware meta learner and a knowledge-aware meta learner, to capture meta users' preference and entities' knowledge for cold-start recommendations. The collaborative-aware meta learner aims to locally aggregate user preferences for each user preference learning task. In contrast, the knowledge-aware meta learner is to globally generalize knowledge representation across different user preference learning tasks. Guided by two meta learners, MetaKG can effectively capture the high-order collaborative relations and semantic representations, which could be easily adapted to cold-start scenarios. Extensive experiments on various cold-start scenarios using three real datasets demonstrate that our presented MetaKG outperforms all the existing state-of-the-art competitors in terms of effectiveness, efficiency, and scalability.

1 April 2021
Verified
Conference Paper
Closed access
ZFZiquan Fang
Ziquan Fang
YDYuntao Du
Yuntao Du
Chen LuChen Lu
Chen Lu
YHYujia Hu
Yujia Hu
YGYunjun Gao
Yunjun Gao
GCGang Chen
Gang Chen
Trajectory clustering has played an essential role in trajectory mining tasks. It serves in a wide range of real-life applications, including transportation, location-based services, behavioral study, and so on. To support trajectory clustering analytics, a plethora of trajectory clustering methods have been proposed, which mainly extend traditional clustering algorithms by using spatio-temporal characteristics of trajectories. However, existing traditional trajectory clustering approaches based on raw trajectory representation highly rely on hand-craft similarity metrics, and can not capture hidden spatial dependencies in trajectory data, which is inefficient and inflexible for clustering analysis. To this end, we propose an end-to-end deep trajectory clustering framework via self-training, termed as E 2 DTC, inspired by the data-driven capabilities of deep neural networks. E 2 DTC does not require any additional manual feature extraction operations, and can be easily adapted for trajectory clustering analytics on any trajectory dataset. Extensive experimental evaluations on three real-life datasets show that our framework E2DTC achieves superior accuracy and efficiency, compared with classical clustering methods (i.e., K-Medoids) and state-of-the-art neural-network based approaches (i.e., t2vec).

18 July 2023
Verified
Conference Paper
Open access
XZXinjun Zhu
Xinjun Zhu
YDYuntao Du
Yuntao Du
YMYuren Mao
Yuren Mao
LCLu Chen
Lu Chen
YHYujia Hu
Yujia Hu
YGYunjun Gao
Yunjun Gao

30 April 2023
Verified
Conference Paper
Open access
YDYuntao Du
Yuntao Du
JLJianxun Lian
Jianxun Lian
JYJing Yao
Jing Yao
XWXiting Wang
Xiting Wang
MWMingqi Wu
Mingqi Wu
XXXing Xie
Xing Xie
Collaborative Filtering (CF) is a widely used and effective technique for recommender systems. In recent decades, there have been significant advancements in latent embedding-based CF methods for improved accuracy, such as matrix factorization, neural collaborative filtering, and LightGCN. However, the explainability of these models has not been fully explored. Adding explainability to recommendation models can not only increase trust in the decision-making process, but also have multiple benefits such as providing persuasive explanations for item recommendations, creating explicit profiles for users and items, and assisting item producers in design improvements. In this paper, we propose a neat and effective Explainable Collaborative Filtering (ECF) model that leverages interpretable cluster learning to achieve the two most demanding objectives: (1) Precise - the model should not compromise accuracy in the pursuit of explainability; and (2) Self-explainable - the model’s explanations should truly reflect its decision-making process, not generated from post-hoc methods. The core of ECF is mining taste clusters from user-item interactions and item profiles. We map each user and item to a sparse set of taste clusters, and taste clusters are distinguished by a few representative tags. The user-item preference, users/items’ cluster affiliations, and the generation of taste clusters are jointly optimized in an end-to-end manner. Additionally, we introduce a forest mechanism to ensure the model’s accuracy, explainability, and diversity. To comprehensively evaluate the explainability quality of taste clusters, we design several quantitative metrics, including in-cluster item coverage, tag utilization, silhouette, and informativeness. Our model’s effectiveness is demonstrated through extensive experiments on three real-world datasets.

19 November 2025
Verified
Conference Paper
Open access
YDYuntao Du
Yuntao Du
NLNinghui Li
Ninghui Li

27 April 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MZMinjun Zhao
Minjun Zhao
LCLu Chen
Lu Chen
KYKeyu Yang
Keyu Yang
YDYuntao Du
Yuntao Du
YGYunjun Gao
Yunjun Gao
Materialized model query aims to find the most appropriate materialized model as the initial model for model reuse. It is the precondition of model reuse, and has recently attracted much attention. Nonetheless, the existing methods suffer from the need to provide source data, limited range of applications, and inefficiency since they do not construct a suitable metric to measure the target-related knowledge of materialized models. To address this, we present ${\sf MMQ}$ , a source-data free, general, efficient, and effective materialized model query framework. It uses a Gaussian mixture-based metric called separation degree to rank materialized models. For each materialized model, ${\sf MMQ}$ first vectorizes the samples in the target dataset into probability vectors by directly applying this model, then utilizes Gaussian distribution to fit for each class of probability vectors, and finally uses separation degree on the Gaussian distributions to measure the target-related knowledge of the materialized model. Moreover, we propose an improved ${\sf MMQ}$ ( ${\sf I-MMQ}$ ), which significantly reduces the query time while retaining the query performance of ${\sf MMQ}$ . Extensive experiments on a range of practical model reuse workloads demonstrate the effectiveness and efficiency of ${\sf MMQ}$ .