Yuxiao Duan

Ms. Yuxiao Duan


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
25 July 2025 in Decision Support Systems
Verified
Journal Article
Closed access
YDYuxiao Duan
Yuxiao Duan
XZXiang Zhao
Xiang Zhao
HGHao Guo
Hao Guo

27 February 2026 in Advanced Engineering Informatics
Verified
Journal Article
Closed access
YDYuzhuo Dang
Yuzhuo Dang
WCWanyu Chen
Wanyu Chen
ZPZhiqiang Pan
Zhiqiang Pan
XZXin Zhang
Xin Zhang
YDYuxiao Duan
Yuxiao Duan
HCHonghui Chen
Honghui Chen

19 July 2026
Verified
Conference Paper
Open access
YDYuzhuo Dang
Yuzhuo Dang
XZXin Zhang
Xin Zhang
ZPZhiqiang Pan
Zhiqiang Pan
YDYuxiao Duan
Yuxiao Duan
WCWanyu Chen
Wanyu Chen
HCHonghui Chen
Honghui Chen

13 May 2024
Verified
Conference Paper
Open access
CZChenxi Zhu
Chenxi Zhu
HGHaotian Gao
Haotian Gao
YDYuxiao Duan
Yuxiao Duan
GHGuo Hao
Guo Hao
MLMinnan Luo
Minnan Luo
XZXiang Zhao
Xiang Zhao
Harmful memes refer to the memes which contain social bias towards a certain group, such as gender, race, disabilities and so on. Detecting these harmful memes requires the model to have both visual and linguistic understanding of memes and some external knowledge about the culture and morality. This technical report summarises the fourth place solution of the Online Safety Prize Challenge, which enhances a visual language model (VLM) by integrating external Optical Character Recognition (OCR) tools, employs prompt engineering and manual resource management to optimize performance within limited resource constraints. This strategy achieved a score of 0.723/0.643(AUROC/ACC) in this challenge with one single submission

29 February 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YDYuxiao Duan
Yuxiao Duan
JTJiuyang Tang
Jiuyang Tang
HXHao Xu
Hao Xu
CLChangsen Liu
Changsen Liu
WZWeixin Zeng
Weixin Zeng
The inductive relation prediction of knowledge graphs, as an important research topic, aims at predicting the missing relation between unknown entities with many real-world applications. Existing approaches toward this problem mostly use enclosing subgraphs to extract the features of target nodes to make predictions; however, there is a tendency to ignore the neighboring relations outside the enclosing subgraph, thus leading to inaccurate predictions. In addition, they also neglect the rich commonsense information that can help filter out less convincing results. In order to address the above issues, this paper proposes a commonsense-guided inductive relation prediction method with a dual attention mechanism called CNIA. Specifically, in addition to the enclosing subgraph, we added the multi-hop neighboring relations of target nodes, thereby forming a neighbor-enriched subgraph where the initial embeddings are generated. Next, we obtained the subgraph representations with a dual attention (i.e., edge-aware and relation-aware) mechanism, as well as the neighboring relational path embeddings. Then, we concatenated the two embeddings before feeding them into the supervised learning model. A commonsense re-ranking mechanism was introduced to filter the results that conformed to commonsense. Extensive experiments on WN18RR, FB15k-237, and NELL995 showed that CNIA achieves better prediction results when compared to the state-of-the-art models. The results suggested that our proposed model can be considered as an effective and state-of-the-art solution for inductive relation prediction.