Yanxia Lyu

Dr. Yanxia Lyu

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
1 August 2019 in Tsinghua Science and Technology
Verified
Journal Article
Closed access
YLYanxia Lyu
Yanxia Lyu
SPSancheng Peng
Sancheng Peng
YYYing Yuan
Ying Yuan
CWCong Wang
Cong Wang
PYPengfei Yin
Pengfei Yin
CWCuirong Wang
Cuirong Wang

26 December 2022 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
XWXin Wang
Xin Wang
SZShufen Zhang
Shufen Zhang
YLYuanyuan Lin
Yuanyuan Lin
YLYanxia Lyu
Yanxia Lyu
JZJiale Zhang
Jiale Zhang

8 August 2020 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
YLYanxia Lyu
Yanxia Lyu
FWFangna Wei
Fangna Wei
YZYing Zheng
Ying Zheng
CWCong Wang
Cong Wang
CWCuirong Wang
Cuirong Wang

1 November 2020 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
YLYanxia Lyu
Yanxia Lyu
WLWenjie Li
Wenjie Li
YWYue Wang
Yue Wang
SSSiqi Sun
Siqi Sun
CWCuirong Wang
Cuirong Wang
Anomaly detection refers to identify the true anomalies from a given data set. We present an ensemble anomaly detection method called Relative mass and half-space tree based forest (RMHSForest), which detect anomalies, including global and local anomalies, based on relative mass estimation and halfspace tree. Different from density or distance based measure, RMHSForest utilizes a novel relative mass estimation to improve the detection of local anomaly. Meanwhile, half-space tree based on augmented mass can estimate a mass distribution efficiently without density or distance calculations or clustering. Our empirical results show that RMHSForest outperforms the current popular anomaly detection algorithms in terms of AUC and processing time in the test data sets.

16 April 2026 in Pattern Recognition
Verified
Journal Article
Closed access
YLYanxia Lyu
Yanxia Lyu
GDGuangwen Dong
Guangwen Dong
XSXin Song
Xin Song

23 December 2022
Verified
Conference Paper
Open access
YLYanxia Lyu
Yanxia Lyu
GSGuorui Su
Guorui Su
JWJianghan Wang
Jianghan Wang
YXYe Xing
Ye Xing
Now recommendation systems are introduced into various online applications to help users find the content they want from massive data. Although the recommendation method based on collaborative filtering can adapt to the change of recommendation scenarios, the recommendation heavily depends on interaction data, so the recommendations are seriously affected by data sparsity. To alleviate the above problem researchers introduce knowledge graph as side information into the recommendation system. By exploring the rich entity information and relation information in knowledge graph, we can enrich the representations of user and item and enhance interpretability of recommendation system. However, some recommendation methods only carry out unidirectional knowledge propagation when mining knowledge information, which makes it difficult to capture higher-order knowledge information when the knowledge graph is sparse. Meanwhile, most recommendation models do not make full use of the relations between users, items and entities to enhance the interpretability of recommendations. Based on the reasons above, we design a novel bidirectional knowledge-aware attention network framework for explainable recommendation named BKANE, which integrates interaction information and high-order knowledge information, completing the recommendation in an end-to-end manner. The experimental results on three real datasets show that BKANE is significantly better than the state-of-the-art baselines in terms of recommendation performance. Also, the graphical explanation form can provide developers and users with a reasonable explanation of the model and recommendations.