Ning Wei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ning Wei has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jingfeng Guo
College of Information Science and Engineering, Yanshan University, Qinhuangdao, China
3 shared publications - Xiao Chen
Research Center for Marine Science, Hebei Normal University of Science and Technology, Qinhuangdao 066004, China
2 shared publications - You Wu
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
2 shared publications - Yunfei Li
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
2 shared publications - Jiashuo Dong
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
1 shared publication - Liyan Zhang
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
1 shared publication
Latest Publications
- Open Access
- 16 December 2024
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 4954
Check-In Heterogeneous Hypergraph and Personalized Preference Transfers for Cross-City POI Recommendation Method
The objective of cross-city recommendation is to suggest points-of-interest (POI) in the target city that may be of interest to users, based on their check-in records from their source city. Although significant progress has been made in studying user preference transfers, there is a lack of research focusing on personalized user preference transfers. Furthermore, the mining of user preferences from the source city is impacted by errors and missing information. To address these challenges, this paper proposes a Check-In Heterogeneous Hypergraph and Personalized Preference Transfers for Cross-City POI Recommendation Method (CHHPPT). Firstly, a check-in heterogeneous hypergraph network is introduced in the user source city preference-mining module. This network, through Heterogeneous Hypergraph Embeddings (HHE), captures user preferences in the source city, thereby mitigating the impact of errors and missing information on user preference. Subsequently, in the user-personalized preference transfer module, a user’s transferable features are obtained through a POI aggregation network. These features are then combined with a meta-network and transfer networks to achieve user-personalized preference transfer. Finally, in the target city point-of-interest recommendation module, a POI-geographical graph is constructed using the geographical information of POI. This graph, in conjunction with category information, yields a joint embedding representation. The final recommendation is achieved by integrating the user-personalized preference transfer embeddings with the target city’s POI embeddings. Extensive experiments conducted on two real-world datasets demonstrate the effectiveness of CHHPPT in cross-city recommendation tasks.
- 16 December 2024
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 4954
Open AccessCheck-In Heterogeneous Hypergraph and Personalized Preference Transfers for Cross-City POI Recommendation Method
The objective of cross-city recommendation is to suggest points-of-interest (POI) in the target city that may be of interest to users, based on their check-in records from their source city. Although significant progress has been made in studying user preference transfers, there is a lack of research focusing on personalized user preference transfers. Furthermore, the mining of user preferences from the source city is impacted by errors and missing information. To address these challenges, this paper proposes a Check-In Heterogeneous Hypergraph and Personalized Preference Transfers for Cross-City POI Recommendation Method (CHHPPT). Firstly, a check-in heterogeneous hypergraph network is introduced in the user source city preference-mining module. This network, through Heterogeneous Hypergraph Embeddings (HHE), captures user preferences in the source city, thereby mitigating the impact of errors and missing information on user preference. Subsequently, in the user-personalized preference transfer module, a user’s transferable features are obtained through a POI aggregation network. These features are then combined with a meta-network and transfer networks to achieve user-personalized preference transfer. Finally, in the target city point-of-interest recommendation module, a POI-geographical graph is constructed using the geographical information of POI. This graph, in conjunction with category information, yields a joint embedding representation. The final recommendation is achieved by integrating the user-personalized preference transfer embeddings with the target city’s POI embeddings. Extensive experiments conducted on two real-world datasets demonstrate the effectiveness of CHHPPT in cross-city recommendation tasks.
- Open Access
- 30 October 2024
- Published by MDPI AG in Electronics
- Vol. 13 (21) , 4267
Attribute-Aware Graph Convolutional Network Recommendation Method
In recent years, recommendation systems have made significant strides through the application of graph neural networks (GNNs). However, most of the existing methods primarily focus on modeling user–item interactions, often failing to account for the distinct roles of different types of neighboring nodes during the graph convolution process. Moreover, the intricate relationships between user and item attributes are frequently underexplored, which constrains further improvement in the performance of recommendation models. To overcome these challenges, this paper proposes an attribute-aware graph convolutional network recommendation model (AAGCNR). This model accounts for the complex interrelationships between user and item attributes while distinguishing between different types of neighboring nodes during graph convolution. First, a multi-head self-attention mechanism is applied to capture the semantic relationships among attributes across various semantic spaces. Additionally, a bilinear interaction module is employed to facilitate interactions between attributes. Since different neighboring nodes exert different influences on target nodes, the model performs convolutional aggregation by leveraging the interrelationships of these attributes throughout the graph convolution process. Experiments conducted on real-world datasets reveal that AAGCNR outperforms other benchmark algorithms, particularly in terms of RECALL and NDCG metrics.
- 30 October 2024
- Published by MDPI AG in Electronics
- Vol. 13 (21) , 4267
Open AccessAttribute-Aware Graph Convolutional Network Recommendation Method
In recent years, recommendation systems have made significant strides through the application of graph neural networks (GNNs). However, most of the existing methods primarily focus on modeling user–item interactions, often failing to account for the distinct roles of different types of neighboring nodes during the graph convolution process. Moreover, the intricate relationships between user and item attributes are frequently underexplored, which constrains further improvement in the performance of recommendation models. To overcome these challenges, this paper proposes an attribute-aware graph convolutional network recommendation model (AAGCNR). This model accounts for the complex interrelationships between user and item attributes while distinguishing between different types of neighboring nodes during graph convolution. First, a multi-head self-attention mechanism is applied to capture the semantic relationships among attributes across various semantic spaces. Additionally, a bilinear interaction module is employed to facilitate interactions between attributes. Since different neighboring nodes exert different influences on target nodes, the model performs convolutional aggregation by leveraging the interrelationships of these attributes throughout the graph convolution process. Experiments conducted on real-world datasets reveal that AAGCNR outperforms other benchmark algorithms, particularly in terms of RECALL and NDCG metrics.
- Open Access
- 2 December 2023
- Published by MDPI AG in Electronics
- Vol. 12 (23) , 4869
Knowledge-Aware Graph Self-Supervised Learning for Recommendation
Collaborative filtering (CF) based on graph neural networks (GNN) can capture higher-order relationships between nodes, which in turn improves recommendation performance. Although effective, GNN-based methods still face the challenges of sparsity and noise in real scenarios. In recent years, researchers have introduced graph self-supervised learning (SSL) techniques into CF to alleviate the sparse supervision problem. The technique first augments the data to obtain contrastive views and then utilizes the mutual information maximization to provide self-supervised signals for the contrastive views. However, the existing approaches based on graph self-supervised signals still face the following challenges: (i) Most of the works fail to effectively mine and exploit the supervised information from the item knowledge graph, resulting in suboptimal performance. (ii) Existing data augmentation methods are unable to fully exploit the potential of contrastive learning, because they primarily focus on the contrastive view of data structure changes and neglect the adjacent relationship among users and items. To address these issues, we propose a novel self-supervised learning approach, namely Knowledge-aware Graph Self-supervised Learning (KGSL). Specifically, we calculate node similarity based on semantic relations between items in the knowledge graph to generate a semantic-based item similarity graph. Then, the self-supervised learning contrast views are generated from both the user–item interaction graph and the item similarity graph, respectively. Maximization of the information from these contrastive views provides additional self-supervised signals to enhance the node representation capacity. Finally, we establish a joint training strategy for the self-supervised learning task and the recommendation task to further optimize the learning process of KGSL. Extensive comparative experiments as well as ablation experiments are conducted on three real-world datasets to verify the effectiveness of KGSL.
- 2 December 2023
- Published by MDPI AG in Electronics
- Vol. 12 (23) , 4869
Open AccessKnowledge-Aware Graph Self-Supervised Learning for Recommendation
Collaborative filtering (CF) based on graph neural networks (GNN) can capture higher-order relationships between nodes, which in turn improves recommendation performance. Although effective, GNN-based methods still face the challenges of sparsity and noise in real scenarios. In recent years, researchers have introduced graph self-supervised learning (SSL) techniques into CF to alleviate the sparse supervision problem. The technique first augments the data to obtain contrastive views and then utilizes the mutual information maximization to provide self-supervised signals for the contrastive views. However, the existing approaches based on graph self-supervised signals still face the following challenges: (i) Most of the works fail to effectively mine and exploit the supervised information from the item knowledge graph, resulting in suboptimal performance. (ii) Existing data augmentation methods are unable to fully exploit the potential of contrastive learning, because they primarily focus on the contrastive view of data structure changes and neglect the adjacent relationship among users and items. To address these issues, we propose a novel self-supervised learning approach, namely Knowledge-aware Graph Self-supervised Learning (KGSL). Specifically, we calculate node similarity based on semantic relations between items in the knowledge graph to generate a semantic-based item similarity graph. Then, the self-supervised learning contrast views are generated from both the user–item interaction graph and the item similarity graph, respectively. Maximization of the information from these contrastive views provides additional self-supervised signals to enhance the node representation capacity. Finally, we establish a joint training strategy for the self-supervised learning task and the recommendation task to further optimize the learning process of KGSL. Extensive comparative experiments as well as ablation experiments are conducted on three real-world datasets to verify the effectiveness of KGSL.