Jian Yu 0003

dblp:52/5812-3 · DBLP profile ↗
← Back
17ranked-venue papers in the field
2as first author
15since 2021 · last 2026
0000-0001-6154-4800ORCID · conflict

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

Knowledge Engineering, Semantic Web & Information Systems · 8 (2 first)Data Mining & Knowledge Discovery · 5Database Systems & Data Management · 2Information Retrieval & Web Search · 2
YearPublicationVenuePosition
2026 Knowledge Graph Completion via Centroid-Driven Adaptive Type Information Capture Graph Attention Network
Shuyu Pan, Mankun Zhao, Jiujiang Guo, Jian Yu 0003, Mei Yu 0004
DASFAA (6)6
2026 LieT- H2K: Temporal Homogeneous and Heterogeneous Knowledge Joint Representation Driven by Lie Group
Mei Yu 0004, Mankun Zhao, Jiujiang Guo, Xuewei Li 0001, Jian Yu 0003
DASFAA (6)7
2026 From Perception to Comprehension: A cognitive hierarchy for multimodal relation extraction
Zechen Meng, Mankun Zhao, Jian Yu 0003, Ying He 0001, Mei Yu 0004
Inf. Process. Manag.4
2025 EHPR: Learning evolutionary hierarchy perception representation based on quaternion for temporal knowledge graph completion
Jiujiang Guo, Mankun Zhao, Jian Yu 0003, Jianhang Song, Qifei Wang, Linying Xu, Mei Yu 0004
Inf. Sci.3
2024 Global Context Enhanced Multi-granularity Intent Networks for Session-Based Recommendation
Jianrong Wang, Congyuan Wang, Jian Yu 0003, Mankun Zhao, Mei Yu 0004
KSEM (4)3
2024 Two-Stage Knowledge Graph Completion Based on Semantic Features and High-Order Structural Features
Xiang Ying, Shimei Luo, Mei Yu 0004, Mankun Zhao, Jian Yu 0003, Jiujiang Guo, Xuewei Li 0001
PAKDD (1)5
2024 Graph Attention Network with Relational Dynamic Factual Fusion for Knowledge Graph Completion
Mei Yu 0004, Yilin Zuo, Wenbin Zhang 0010, Mankun Zhao, Jiujiang Guo, Jian Yu 0003
ECML/PKDD (4)8
2024 Global Heterogeneous Graph and Target Interest Denoising for Multi-behavior Sequential Recommendation
abstract
Multi-behavior sequential recommendation (MBSR) predicts a user's next item of interest based on their interaction history across different behavior types. Although existing studies have proposed capturing the correlation between different types of behavior, two important challenges have not been explored: i) Dealing with heterogeneous item transitions (both global and local perspectives). ii) Mitigating the issue of noise that arises from the incorporation of auxiliary behaviors. To address these issues, we propose a novel solution, Global Heterogeneous Graph and Target Interest Denoising for Multi-behavior Sequential Recommendation (GHTID). In particular, we view the transitions between behavior types of items as different relationships and propose two heterogeneous graphs. By considering the relationship between items under different behavioral types of transformations, we propose two heterogeneous graph convolution modules and explicitly learn heterogeneous item transitions. Moreover, we utilize two attention networks to integrate long-term and short-term interests associated with the target behavior to alleviate the noisy interference of auxiliary behaviors. Extensive experiments on four real-world datasets demonstrate that our method outperforms other state-of-the-art methods.
Xuewei Li 0001, Jian Yu 0003, Mankun Zhao, Wenbin Zhang 0010, Mei Yu 0004
WSDM3
2024 Learning Neighbor User Intention on User-Item Interaction Graphs for Better Sequential Recommendation
abstract
The task of sequential recommendation aims to predict a user’s preference by analyzing the user’s historical behaviours. Existing methods model item transitions through leveraging sequential patterns. However, they mainly consider the target user’s behaviours and dynamic characteristics, while often ignoring high-order collaborative connections when modelling user preferences. Some recent works try to use graph-based methods to introduce high-order collaborative signals for sequential recommendation. However, these methods are flawed by two problems: the sequential patterns cannot be effectively mined and their way of introducing high-order collaborative signals is not suitable for sequential recommendation. To address these problems, we propose to fully exploit sequence features and model high-order collaborative signals for sequential recommendation. We propose a N eighbor user I ntention-based S equential Rec ommender (NISRec), which utilizes the intentions of high-order connected neighbor users as high-order collaborative signals in order to improve recommendation performance for the target user. The NISRec contains two main modules: the neighbor user intention embedding module (NIE) and the fusion module. The NIE module describes both the long-term and short-term intentions of neighbor users and aggregates them separately. The fusion module uses these two types of aggregated intentions to model high-order collaborative signals in both the embedding process and user preference modelling phase for recommendations of the target user. Experimental results show that our new approach outperforms the state-of-the-art methods on both sparse and dense datasets. Extensive studies further show the effectiveness of the diverse neighbor intentions introduced by the NISRec.
Mei Yu 0004, Kun Zhu 0006, Mankun Zhao, Jian Yu 0003, Di Jin 0001, Xuewei Li 0001
ACM Trans. Web4
2023 Hypergraph Enhanced Contrastive Learning for News Recommendation
Mankun Zhao, Mei Yu 0004, Wenbin Zhang 0010, Jian Yu 0003
KSEM (3)7
2023 Multi-Intention Oriented Contrastive Learning for Sequential Recommendation
abstract
Sequential recommendation aims to capture users' dynamic preferences, in which data sparsity is a key problem. Most contrastive learning models leverage data augmentation to address this problem, but they amplify noises in original sequences. Contrastive learning has the assumption that two views (positive pairs) obtained from the same user behavior sequence must be similar. However, noises typically disturb the user's main intention, which results in the dissimilarity of two views.
Xuewei Li 0001, Aitong Sun, Mankun Zhao, Jian Yu 0003, Kun Zhu 0006, Di Jin 0001, Mei Yu 0004
WSDM4
2023 BDRI: block decomposition based on relational interaction for knowledge graph completion
Mei Yu 0004, Jiujiang Guo, Jian Yu 0003, Mankun Zhao, Xuewei Li 0001
Data Min. Knowl. Discov.3
2023 A structure-enhanced generative adversarial network for knowledge graph zero-shot relational learning
Xuewei Li 0001, Jian Yu 0003, Mankun Zhao, Mei Yu 0004, Weiping Ding 0001
Inf. Sci.3
2022 Text-Enhanced and Relational Context Based Hyperbolic Knowledge Graph Embedding
Xiang Ying, Jian Yu 0003, Mankun Zhao, Mei Yu 0004, Xuewei Li 0001
KSEM (1)3
2022 Knowledge Graph Embedding with Direct and Disentangled Neighborhood Representation Attention Network
Siyao Gao, Jian Yu 0003, Mankun Zhao, Jie Gao 0008, Xuewei Li 0001
KSEM (1)3
2020 Extraction and Portrait of Knowledge Points for Open Learning Resources
Jian Yu 0003, Tingxu Jiang, Jie Gao 0008, Mei Yu 0004, Mankun Zhao
WISA1
2018 Product Recommendation Method Based on Sentiment Analysis
Jian Yu 0003, Yongli An, Jie Gao 0008, Mankun Zhao, Mei Yu 0004
WISA1