Optimizing Recommender Model: Integrating Knowledge Graph Information Fusion and Attention Mechanism

Graphs are versatile for capturing relationships between objects, as seen in social networks, enabling the implementation of algorithms like community discovery and clustering. The growing interest in deep learning within the graph domain has led to the development of various graph neural network algorithms in recent years. These algorithms offer an effective solution to address graph learning challenges by incorporating graph operations into traditional deep learning models and leveraging both graph structure and attribute information to handle the intricacies of graph data. Graph neural network algorithms represent an extension of traditional deep learning methods, like convolution, into the realm of graph data. These algorithms incorporate the concept of data propagation to formulate deep learning approaches specifically designed for graphs. Notably, they have demonstrated success in diverse domains such as social networks, recommendation systems, knowledge graphs, and others. In addressing the aforementioned challenges, this paper introduces a novel approach utilizing a graph neural network. To overcome the lack of temporal information in the recommendation network's neighbor structure, an ordered input-based gated cyclic unit is incorporated for state aggregation and updating. The model leverages the unit's capacity for capturing contextual relationships, thereby enhancing its ability to capture temporal features in the neighbor structure and improve predictions on new datasets. Additionally, the paper places emphasis on the shallow output of the intermediate layer. A multi-headed attention mechanism is employed to integrate information from multiple layers of output, ensuring that the shallow structural features provided by the intermediate layer play a more significant role in the scoring prediction task. This enhancement further refines the application of graph neural networks in recommendation systems.