Xianyu Chen

Xianyu Chen

Auto-generated profile, based on publicly available information

Xianyu Chen

Shanghai Jiao Tong University, Shanghai, 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

4 August 2023
Verified
Conference Paper
Open access
LZLei Zheng
Lei Zheng
NLNing Li
Ning Li
XCXianyu Chen
Xianyu Chen
QGQuan Gan
Quan Gan
WZWeinan Zhang
Weinan Zhang

31 July 2024 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
LZLei Zheng
Lei Zheng
HCHuacan Chai
Huacan Chai
XCXianyu Chen
Xianyu Chen
JJJiarui Jin
Jiarui Jin
WZWeinan Zhang
Weinan Zhang
ZFZiming Feng
Ziming Feng
Extending from sequential recommendation models, in this article, we present a novel framework named Search-based Time-Aware Recommendation (STARec), which first retrieves the historical behaviors of the given user through a search-based retriever and then captures the user’s evolving demands over time through a time-aware sequential network. We notice that the key insight of STARec is to use the feature and labels to augment the representations, and thus the effectiveness of STARec relies on the acquisition of rich browsing records of the target user and powerful representation of each browsed item and thus its performance could heavily drop regarding long-tail users and items. To this end, we extend STARec by constructing a graph upon the user–item interactions and leveraging the graph structure to enhance the representation learning. We call this extended version Search-based Time-Aware Graph-Enhanced Recommendation (STAGE). We conduct extensive experiments on three real-world datasets and STARec achieves consistent superiority. We further compare STAGE against STARec long-tail users and our results demonstrate that STAGE could outperform STARec at most cases. Results of online A/B tests show that STARec and STAGE achieve an average click-through rate improvement of around 6% and 1.5% in the two main item recommendation scenarios, respectively. 1

21 October 2023
Verified
Conference Paper
Open access
JJJiarui Jin
Jiarui Jin
XCXianyu Chen
Xianyu Chen
WZWeinan Zhang
Weinan Zhang
MYMengyue Yang
Mengyue Yang
YWYang Wang
Yang Wang
JWJun Wang
Jun Wang

20 July 2025
Verified
Conference Paper
Open access
JJJiarui Jin
Jiarui Jin
XCXianyu Chen
Xianyu Chen
WZWeinan Zhang
Weinan Zhang
YYYong Yu
Yong Yu
JWJun Wang
Jun Wang

25 February 2022 in arXiv
Verified
Preprint
Open access
PDF file
TLTing Long
Ting Long
YXYutong Xie
Yutong Xie
XCXianyu Chen
Xianyu Chen
WZWeinan Zhang
Weinan Zhang
QCQinxiang Cao
Qinxiang Cao
YYYong Yu
Yong Yu
Program representation, which aims at converting program source code into vectors with automatically extracted features, is a fundamental problem in programming language processing (PLP). Recent work tries to represent programs with neural networks based on source code structures. However, such methods often focus on the syntax and consider only one single perspective of programs, limiting the representation power of models. This paper proposes a multi-view graph (MVG) program representation method. MVG pays more attention to code semantics and simultaneously includes both data flow and control flow as multiple views. These views are then combined and processed by a graph neural network (GNN) to obtain a comprehensive program representation that covers various aspects. We thoroughly evaluate our proposed MVG approach in the context of algorithm detection, an important and challenging subfield of PLP. Specifically, we use a public dataset POJ-104 and also construct a new challenging dataset ALG-109 to test our method. In experiments, MVG outperforms previous methods significantly, demonstrating our model's strong capability of representing source code.