Journal
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS
Volume -, Issue -, Pages -Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCSS.2023.3283574
Keywords
Explainable social recommendation; knowledge graph; many-objective optimization algorithm (MaOEA); social computing
Ask authors/readers for more resources
This article proposes a knowledge graph-based many-objective model for explainable social recommendation (KGMESR), which considers the explainability, accuracy, novelty, and content quality of social recommendation results. The model utilizes social behavior information to calculate user similarity and quantifies the explainability of results using entity vectors and embedding vectors. A many-objective recommendation algorithm based on the partition deletion strategy is designed for efficiency. Experimental results demonstrate preferable recommendation results and two case studies affirm the explainability of the proposed model.
As an application area of social computing, social recommendation aims to exploit the richness of social relationships to improve recommendation accuracy. Current research mainly considers social information that can be directly observed, with little attention to indirect social relationships between users or the explainability of social recommendation results. To address this challenge, this article proposes a knowledge graph-based many-objective model for explainable social recommendation (KGMESR) by considering the explainability, accuracy, novelty, and content quality of social recommendation results. The model takes advantage of social behavior information to calculate user similarity and quantifies the explainability of social recommendation results using entity vectors and embedding vectors. To ensure model efficiency, a many-objective recommendation algorithm based on the partition deletion strategy is designed. It employs the association of individuals with the nearest reference vector to render the diversity of the population and then obtains the final solution by deleting poorly converged individuals in each partition. Experimental results show that many-objective optimization recommendation algorithm based on partition deletion strategy (MaOEA-PDS) allows for preferable recommendation results for users in real datasets. The explainability of the proposed model is demonstrated by two case studies.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available