Zhichao Feng

Zhichao Feng

Auto-generated profile, based on publicly available information

Zhichao Feng

Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
21 December 2022 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
WZWayne Xin Zhao
Wayne Xin Zhao
ZLZihan Lin
Zihan Lin
ZFZhichao Feng
Zhichao Feng
PWPengfei Wang
Pengfei Wang
JWJi-Rong Wen
Ji-Rong Wen
In recommender systems, top- N recommendation is an important task with implicit feedback data. Although the recent success of deep learning largely pushes forward the research on top- N recommendation, there are increasing concerns on appropriate evaluation of recommendation algorithms. It therefore is important to study how recommendation algorithms can be reliably evaluated and thoroughly verified. This work presents a large-scale, systematic study on six important factors from three aspects for evaluating recommender systems. We carefully select 12 top- N recommendation algorithms and eight recommendation datasets. Our experiments are carefully designed and extensively conducted with these algorithms and datasets. In particular, all the experiments in our work are implemented based on an open sourced recommendation library, Recbole [ 139 ], which ensures the reproducibility and reliability of our results. Based on the large-scale experiments and detailed analysis, we derive several key findings on the experimental settings for evaluating recommender systems. Our findings show that some settings can lead to substantial or significant differences in performance ranking of the compared algorithms. In response to recent evaluation concerns, we also provide several suggested settings that are specially important for performance comparison.

14 September 2023
Verified
Conference Paper
Open access
BYBin Yin
Bin Yin
JXJunjie Xie
Junjie Xie
YQYu Qin
Yu Qin
ZDZixiang Ding
Zixiang Ding
ZFZhichao Feng
Zhichao Feng
WLWei Lin
Wei Lin

13 May 2024
Verified
Conference Paper
Open access
ZFZhichao Feng
Zhichao Feng
JXJunJie Xie
JunJie Xie
KLKaiyuan Li
Kaiyuan Li
YQYu Qin
Yu Qin
PWPengfei Wang
Pengfei Wang
SWShangguang Wang
Shangguang Wang

21 October 2023
Verified
Conference Paper
Open access
PWPengfei Wang
Pengfei Wang
CLChenliang Li
Chenliang Li
LZLixin Zou
Lixin Zou
ZFZhichao Feng
Zhichao Feng
KLKaiyuan Li
Kaiyuan Li
SWShangguang Wang
Shangguang Wang
Recommender systems play a pivotal role in navigating users through vast reservoirs of information. However, data sparseness can compromise recommendation accuracy, making it challenging to improve recommendation performance. To address this issue, researchers have explored incorporating multiple data types. Yet, this approach can introduce noise that impairs the recommendations' accuracy. Therefore, it is crucial to denoise the data to enhance recommendation quality. This tutorial highlights the importance of data denoising metrics for improving the accuracy and quality of recommendations. Four groups of data denoising metrics are introduced: feature, item, pattern, and modality level. For each group, various denoising methods are presented. The tutorial emphasizes the significance of selecting the right data denoising methods to enhance recommendation quality. It provides valuable guidance for practitioners and researchers implementing reliable data denoising metrics in recommender systems. Finally, the tutorial proposes open research questions for future studies, making it a valuable resource for the research community.

4 March 2024
Verified
Conference Paper
Open access
ZFZhichao Feng
Zhichao Feng
PWPengfei Wang
Pengfei Wang
KLKaiyuan Li
Kaiyuan Li
CLChenliang Li
Chenliang Li
SWShangguang Wang
Shangguang Wang
Deep neural networks now have become the de-facto standard for sequential recommendation. In the existing techniques, an embedding vector is assigned for each item, encoding all the characteristics of the latter in latent space. Then, the recommendation is transferred to devising a similarity metric to recommend user's next behavior. Here, we consider each dimension of an embedding vector as a (latent) feature. Though effective, it is unknown which feature carries what semantics toward the item. Actually, in reality, this merit is highly preferable since a specific group of features could induce a particular relation among the items while the others are in vain. Unfortunately, the previous treatment overlooks the feature semantic learning at such a fine-grained level. When each item contains multiple latent aspects, which however is prevalent in real-world, the relations between items are very complex. The existing solutions are easy to fail on better recommendation performance. It is necessary to disentangle the item embeddings and extract credible features in a context-aware manner. To address this issue, in this work, we present a novel Co ntextual M AB based E mbedding D enoising model~(COMED for short) to adaptively identify relevant dimension-level features for a better recommendation. Specifically, COMED formulates the embedding denoising task as a Contextual Multi-armed Bandit problem. For each feature of the item embedding, we assign a two-armed neural bandit to determine whether the constituent semantics should be preserved, rendering the whole process as embedding denoising. By aggregating the denoised embeddings as contextual information, a reward function deduced by the similarity between the historical interaction sequence and the target item is further designed to approximate the maximum expected payoffs of bandits for efficient learning. Considering the possible inefficiency of training the serial operating mechanism, we also design a swift learning strategy to accelerate the co-guidance between the renovated sequential embedding and the parallel actions of neural bandits for a better recommendation. Comprehensive trials conducted on four widely recognized benchmarks substantiate the efficiency and efficacy of our framework.