The application provides a dynamic increment-based graph information gate aggregation
knowledge graph recommendation method, solves the data
instability caused by random sampling and the
noise fusion problem caused by
double diffusion in the
knowledge graph convolution recommendation method. The method comprises: dynamically selecting Top-K adjacent edges and adjacent point fusion for the current node in the
knowledge graph (K is a positive integer of 10-20) in sequence. On the one hand, the matching
score value of the current node, user embedding, adjacent edge and adjacent point is calculated by using the attention mechanism, the high correlation of the adjacent edge, adjacent
point graph information and the candidate node of the next step is selected by using the
score value, on the other hand, the selected graph information is adaptively adjusted and fused by using the gate mechanism, the adjacent information is accurately integrated into the current node embedding, and then the candidate node is diffused in sequence. Finally, through the operation of the adjacent fusion, the current node information and the adjacent graph information can be directly fused once, so that the
noise information in the
double diffusion and multiple fusion graphs is prevented.