Xinjun Wang 0003

dblp:56/2637-3 · DBLP profile ↗
← Back
9ranked-venue papers in the field
0as first author
9since 2021 · last 2025
0000-0001-8504-1028ORCID · verified

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 6Information Retrieval & Web Search · 2Database Systems & Data Management · 1
YearPublicationVenuePosition
2025 MuPaST: Multi-Period Aware Spatio-Temporal Representation Learning for Multivariate Time Series Classification
Xianpeng Li, Ziyang Su, Yuliang Shi, Lin Cheng 0007, Xinjun Wang 0003, Hui Li 0048
PAKDD (4)5
2025 Electricity behaviors anomaly detection based on multi-feature fusion and contrastive learning
Yongming Guan, Yuliang Shi, Xinjun Wang 0003, Hui Li 0048
Inf. Syst.5
2025 Multimodal contrastive learning with hyperbolic geometry for KG-based game recommendation
Yuliang Shi, Jihu Wang, Han Yu 0001, Xinjun Wang 0003, Zhongmin Yan, Fanyu Kong 0002
Knowl. Inf. Syst.5
2025 Cross-space topological contrastive learning for knowledge graph-aware issue recommendation
Leihong Zhang, Yuliang Shi, Kaiyuan Qi, Xinjun Wang 0003, Zhongmin Yan
Knowl. Inf. Syst.5
2023 Mixed-Curvature Manifolds Interaction Learning for Knowledge Graph-aware Recommendation
abstract
As auxiliary collaborative signals, the entity connectivity and relation semanticity beneath knowledge graph (KG) triples can alleviate the data sparsity and cold-start issues of recommendation tasks. Thus many works consider obtaining user and item representations via information aggregation on graph-structured data within Euclidean space. However, the scale-free graphs (e.g., KGs) inherently exhibit non-Euclidean geometric topologies, such as tree-like and circle-like structures. The existing recommendation models built in a single type of embedding space do not have enough capacity to embrace various geometric patterns, consequently, resulting in suboptimal performance. To address this limitation, we propose a KG-aware recommendation model with mixed-curvature manifolds interaction learning, namely CurvRec. On the one hand, it aims to preserve various global geometric structures in KG with mixed-curvature manifold spaces as the backbone. On the other hand, we integrate Ricci curvature into graph convolutional networks (GCNs) to capture local geometric structural properties when aggregating neighbor nodes. Besides, to exploit the expressive spatial features in KG, we incorporate interaction learning to ensure the geometric message passing between curved manifolds. Specifically, we adopt curvature-aware geodesic distance metrics to maximize the mutual information between Euclidean space and non-Euclidean spaces. Through extensive experiments, we demonstrate that the proposed CurvRec outperforms state-of-the-art baselines.
Jihu Wang, Yuliang Shi, Han Yu 0001, Xinjun Wang 0003, Zhongmin Yan, Fanyu Kong 0002
SIGIR4
2023 KLECA: knowledge-level-evolution and category-aware personalized knowledge recommendation
Lin Cheng 0007, Yuliang Shi, Lin Li 0013, Han Yu 0001, Xinjun Wang 0003, Zhongmin Yan
Knowl. Inf. Syst.5
2022 MSIPA: Multi-Scale Interval Pattern-Aware Network for ICU Transfer Prediction
abstract
Accurate prediction of patients’ ICU transfer events is of great significance for improving ICU treatment efficiency. ICU transition prediction task based on Electronic Health Records (EHR) is a temporal mining task like many other health informatics mining tasks. In the EHR-based temporal mining task, existing approaches are usually unable to mine and exploit patterns used to improve model performance. This article proposes a network based on Interval Pattern-Aware, Multi-Scale Interval Pattern-Aware (MSIPA) network. MSIPA mines different interval patterns in temporal EHR data according to the short, medium, and long intervals. MSIPA utilizes the Scaled Dot-Product Attention mechanism to query the contexts corresponding to the three scale patterns. Furthermore, Transformer will use all three types of contextual information simultaneously for ICU transfer prediction. Extensive experiments on real-world data demonstrate that an MSIPA network outperforms state-of-the-art methods.
Wu Lee, Yuliang Shi, Hongfeng Sun, Lin Cheng 0007, Kun Zhang 0013, Xinjun Wang 0003
ACM Trans. Knowl. Discov. Data6
2021 DEKR: Description Enhanced Knowledge Graph for Machine Learning Method Recommendation
abstract
The huge number of machine learning (ML) methods has resulted in significant information overload. Faced with an overwhelming number of ML methods, it is challenging to select appropriate ones for the given dataset and task. In general, the names of ML methods or datasets are rather condensed, thus lacking specific explanations, while the rich latent relationships between ML entities are not fully explored. In this paper, we propose a description-enhanced machine learning knowledge graph-based approach - DEKR - to help recommend appropriate ML methods for given ML datasets. The proposed knowledge graph (KG) not only includes the connections between entities but also contains the descriptions of the dataset and method entities. DEKR fuses the structural information with the description information of entities in the knowledge graph. It is a deep hybrid recommendation framework, which incorporates the knowledge graph-based and text-based methods, overcoming the limitations of previous knowledge graph-based recommendation systems that ignore the description information. There are two key components of DEKR: 1) a graph neural network aggregating information from multi-order neighbors with attention to enrich the seed (i.e. dataset or method) node's own representation, and 2) a deep collaborative filtering network based on the description text to obtain the linear and nonlinear interactions of description features. Through extensive experiments, we demonstrated the efficiency of DEKR, which outperforms the current state-of-the-art baselines by a large margin.
Xianshuai Cao, Yuliang Shi, Han Yu 0001, Jihu Wang, Xinjun Wang 0003, Zhongmin Yan
SIGIR5
2021 GGATB-LSTM: Grouping and Global Attention-based Time-aware Bidirectional LSTM Medical Treatment Behavior Prediction
abstract
In China, with the continuous development of national health insurance policies, more and more people have joined the health insurance. How to accurately predict patients future medical treatment behavior becomes a hotspot issue. The biggest challenge in this issue is how to improve the prediction performance by modeling health insurance data with high-dimensional time characteristics. At present, most of the research is to solve this issue by using Recurrent Neural Networks (RNNs) to construct an overall prediction model for the medical visit sequences. However, RNNs can not effectively solve the long-term dependence, and RNNs ignores the importance of time interval of the medical visit sequence. Additionally, the global model may lose some important content to different groups. In order to solve these problems, we propose a Grouping and Global Attention based Time-aware Bidirectional Long Short-Term Memory (GGATB-LSTM) model to achieve medical treatment behavior prediction. The model first constructs a heterogeneous information network based on health insurance data, and uses a tensor CANDECOMP/PARAFAC decomposition method to achieve similarity grouping. In terms of group prediction, a global attention and time factor are introduced to extend the bidirectional LSTM. Finally, the proposed model is evaluated by using real dataset, and conclude that GGATB-LSTM is better than other methods.
Lin Cheng 0007, Yuliang Shi, Kun Zhang 0013, Xinjun Wang 0003
ACM Trans. Knowl. Discov. Data4