Abstract
Knowledge graph (KG), as an auxiliary information, plays an important role in the recommendation system, which effectively solves the sparsity and cold start problems of collaborative filtering algorithms. The recommendation algorithm that introduces the propagation mechanism on the KG has been a great success, it enriches the representation of users and items by aggregating multi-hop neighbors. However, the existing KG-based propagation recommendation algorithm aggregating all entity information cannot guarantee the improvement of recommendation results, because entity information in KG is not all helpful to recommend appropriate items to users. Indiscriminately aggregating the entity information in the neighborhood allows the learned embedding representation to be influenced by its unrelated entities.In this paper, we propose a new model named Reduce unrelated Knowledge through Attribute Collaborative signal (RKAC). Compared to other KG-based propagation methods, RKAC offers a new concept of combining item attributes with collaborative signals to reduce information about unrelated entities. Specifically, the initial entity set of users was obtained by collaborative signals and the initial entity set of items was obtained by filtering redundant collaborative signals based on item attributes, and then they were propagated on KG as seeds to acquire multi-hop neighbor entities. Finally, domain entities of different importance were gathered through attention mechanism to obtain more accurate embedding representation of entities. Experimental results on four benchmark datasets of music, book, movie and restaurant show that the AUC of RKAC on CTR prediction increases by 1.4% , 1.3%, 0.8% and 0.5% respectively, compared with the state-of-the-art existing approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.