Content based News Recommendation via Shortest Entity Distance over Knowledge Graphs
원문 초록
Content-based news recommendation systems need to recommend news articles based on the topics and content of articles without using user specific information. Many news articles describe the occurrence of specific events and named entities including people, places or objects. In this paper, we propose a graph traversal algorithm as well as a novel weighting scheme for cold-start content based news recommendation utilizing these named entities. Seeking to create a higher degree of user-specific relevance, our algorithm computes the shortest distance between named entities, across news articles, over a large knowledge graph. Moreover, we have created a new human annotated data set for evaluating content based news recommendation systems. Experimental results show our method is suitable to tackle the hard cold-start problem and it produces stronger Pearson correlation to human similarity scores than other cold-start methods. Our method is also complementary and a combination with the conventional cold-start recommendation methods may yield significant performance gains. The dataset, CNRec, is available at: https://github.com/kevinj22/CNRec
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
News Popularity Beyond the Click-Through-Rate for Personalized Recommendations
Bridging RDF Knowledge Graphs with Graph Neural Networks for Semantically-Rich Recommender Systems
Graph Foundation Models: A Comprehensive Survey
KERL: Knowledge-Enhanced Personalized Recipe Recommendation using Large Language Models
I'll believe it when I see it: Images increase misinformation sharing in Vision-Language Models
IP2: Entity-Guided Interest Probing for Personalized News Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.