Xiaoxuan Shen

Xiaoxuan Shen

Auto-generated profile, based on publicly available information

Xiaoxuan Shen

Faculty of Artificial Intelligence in Education, Central China Normal University, Wuhan, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
14 March 2017 in Multimedia Systems
Verified
Journal Article
Closed access
PDF file
JSJiangbo Shu
Jiangbo Shu
XSXiaoxuan Shen
Xiaoxuan Shen
HLHai Liu
Hai Liu
BYBaolin Yi
Baolin Yi
ZZZhaoli Zhang
Zhaoli Zhang

17 January 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
BYBaolin Yi
Baolin Yi
XSXiaoxuan Shen
Xiaoxuan Shen
HLHai Liu
Hai Liu
Zhaoli ZhangZhaoli Zhang
Zhaoli Zhang
WZWei Zhang
Wei Zhang
NXNaixue Xiong
Naixue Xiong
Automatic recommendation has become an increasingly relevant problem to industries, which allows users to discover new items that match their tastes and enables the system to target items to the right users. In this article, we propose a deep learning (DL) based collaborative filtering (CF) framework, namely, deep matrix factorization (DMF), which can integrate any kind of side information effectively and handily. In DMF, two feature transforming functions are built to directly generate latent factors of users and items from various input information. As for the implicit feedback that is commonly used as input of recommendation algorithms, implicit feedback embedding (IFE) is proposed. IFE converts the high-dimensional and sparse implicit feedback information into a low-dimensional real-valued vector retaining primary features. Using IFE could reduce the scale of model parameters conspicuously and increase model training efficiency. Experimental results on five public databases indicate that the proposed method performs better than the state-of-the-art DL based recommendation algorithms on both accuracy and training efficiency in terms of quantitative assessments.

11 November 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XSXiaoxuan Shen
Xiaoxuan Shen
BYBaolin Yi
Baolin Yi
HLHai Liu
Hai Liu
WZWei Zhang
Wei Zhang
Zhaoli ZhangZhaoli Zhang
Zhaoli Zhang
Neal XiongNeal Xiong
Neal Xiong
Automatic recommendation has become an increasingly relevant problem to industries, which allows users to discover new items that match their tastes and enables the system to target items to the right users. In this article, we have proposed a deep learning based fully Bayesian treatment recommendation framework, DVMF, which has high-quality performance and ability to integrate any kinds of side information handily and efficiently. In DVMF, the variational inference technique and the reparameterization tricks are introduced to make DVMF possible to be optimized by the stochastic gradient-based methods, in addition, two novel deep neural networks have been constructed to infer the hyper-parameters of the distributions of latent factors from the knowledge of user and item, which are represented as low-dimensional real-valued vectors retaining primary features. Experimental results on five public databases indicate that the proposed method performs better than the state-of-the-art recommendation algorithms on prediction accuracy in terms of quantitative assessments.

11 July 2023 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
JSJianwen Sun
Jianwen Sun
SDShangheng Du
Shangheng Du
ZLZhi Liu
Zhi Liu
FYFenghua Yu
Fenghua Yu
Sannvya LiuSannvya Liu
Sannvya Liu
XSXiaoxuan Shen
Xiaoxuan Shen
Personalized e-learning systems are applications of consumer electronics in the field of education that provide individualized and adaptive services for users. Knowledge tracing (KT), as a key technology, aims to model learners’ knowledge states through the interactions between learners and learning resources, and predicts their future performance. However, the problem of interaction sparsity in educational resources leads to the fact that simple representations of questions usually fail to accurately capture students’ knowledge states. In this paper, inspired by the data-driven paradigm, we propose a novel knowledge tracing method named weighted heterogeneous graph-based Three-view Contrastive Learning framework for Knowledge Tracing (TCL4KT). Technically, three different view encoders in TCL4KT complement each other to obtain question embeddings with rich information. Specifically, TCL4KT considers the semantic information of higher-order, heterogeneous and the downstream task on a weighted heterogeneous graph of KT to learn high-quality representations. Besides, a meta-path-based positive sample selection strategy and joint contrastive loss are employed to gain better prediction performance. Experimental results on four datasets demonstrate the superiority of TCL4KT over baseline models, and further analysis verifies the effectiveness of our three-view contrastive learning framework.

13 May 2024
Verified
Conference Paper
Open access
JSJianwen Sun
Jianwen Sun
FYFenghua Yu
Fenghua Yu
QWQian Wan
Qian Wan
QLQing Li
Qing Li
Sannvya LiuSannvya Liu
Sannvya Liu
XSXiaoxuan Shen
Xiaoxuan Shen
Knowledge Tracing (KT) is vital for education, continuously monitoring students' knowledge states (mastery of knowledge) as they interact with online education materials. Despite significant advancements in deep learning-based KT models, existing approaches often struggle to strike the right balance in granularity, leading to either overly coarse or excessively fine tracing and representation of students' knowledge states, thereby limiting their performance. Additionally, achieving a high-performing model while ensuring interpretability presents a challenge. Therefore, in this paper, we propose a novel approach called Multiscale-state-based Interpretable Knowledge Tracing (MIKT). Specifically, MIKT traces students' knowledge states on two scales: a coarse-grained representation to trace students' domain knowledge state, and a fine-grained representation to monitor their conceptual knowledge state. Furthermore, the classical psychological measurement model, IRT (Item Response Theory), is introduced to explain the prediction process of MIKT, enhancing its interpretability without sacrificing performance. Additionally, we extended the Rasch representation method to effectively handle scenarios where questions are associated with multiple concepts, making it more applicable to real-world situations. We extensively compared MIKT with 20 state-of-the-art KT models on four widely-used public datasets. Experimental results demonstrate that MIKT outperforms other models while maintaining its interpretability. Moreover, experimental observations have revealed that our proposed extended Rasch representation method not only benefits MIKT but also significantly improves the performance of other KT baseline models. The code can be found at https://github.com/lilstrawberry/MIKT.

1 August 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JSJianwen Sun
Jianwen Sun
LGLu Gao
Lu Gao
XSXiaoxuan Shen
Xiaoxuan Shen
SLSannyuya Liu
Sannyuya Liu
RLRuxia Liang
Ruxia Liang
SLShengyingjie Liu
Shengyingjie Liu
Automatic recommendation has become an increasingly relevant problem for industries, which allows users to discover items that match their tastes and enables the system to target items at the right users. Graph neural networks have attracted many researchers' attention and have become a useful tool for recommendation. However, these models face two major challenges, which are heterogeneous information aggregation and aggregation weight estimation. In this article, we propose a graph neural networks-based recommendation model, i.e., a separated graph neural recommendation (SGNR) model, which achieves high-quality performance. SGNR separates BINs in recommendation systems into two weighted homogeneous networks for users and items, respectively, resolving the heterogeneous information aggregation problem. In addition, a propagation coefficient estimation method is proposed, which combines parametric and nonparametric estimation strategies. And, it is constructed with three characteristics, which are collaborative, side-information constrained, and adaptive. Thereinto, a three-hierarchy attention operator is contained for feature fusion, which optimizes the feature aggregation process via a more sensible and flexible propagation mechanism. Experimental results on four public databases indicate that the proposed methods perform better than the state-of-the-art recommendation algorithms on prediction accuracy in terms of quantitative assessments and achieve readability and interpretability to some extent.