Joint Knowledge Pruning and Recurrent Graph Convolution for News Recommendation

计算机科学 图形 情报检索 修剪 代表(政治) 理论计算机科学 推荐系统 人工智能 政治 法学 政治学 农学 生物
作者
Yu Tian,Yang Yuhao,Xudong Ren,Pengfei Wang,Fangzhao Wu,Qian Wang,Chenliang Li
标识
DOI:10.1145/3404835.3462912
摘要

Recently, exploiting a knowledge graph (KG) to enrich the semantic representation of a news article have been proven to be effective for news recommendation. These solutions focus on the representation learning for news articles with additional information in the knowledge graph, where the user representations are mainly derived based on these news representations later. However, different users would hold different interests on the same news article. In other words, directly identifying the entities relevant to the user's interest and deriving the resultant user representation could enable a better news recommendation and explanation. To this end, in this paper, we propose a novel knowledge pruning based recurrent graph convolutional network (named Kopra) for news recommendation. Instead of extracting relevant entities for a news article from KG, Kopra is devised to identify the relevant entities from both a user's clicked history and a KG to derive the user representation. We firstly form an initial entity graph (namely interest graph) with seed entities extracted from news titles and abstracts. Then, a joint knowledge pruning and recurrent graph convolution (RGC) mechanism is introduced to augment each seed entity with relevant entities from KG in a recurrent manner. That is, the entities in the neighborhood of each seed entity inside KG but irrelevant to the user's interest are pruned from the augmentation. With this pruning and graph convolution process in a recurrent manner, we can derive the user's both long- and short-term representations based on her click history within a long and short time period respectively. At last, we introduce a max-pooling predictor over the long- and short-term user representations and the seed entities in the candidate news to calculate the ranking score for recommendation. The experimental results over two real-world datasets in two different languages suggest that the proposed Kopra obtains significantly better performance than a series of state-of-the-art technical alternatives. Moreover, the entity graph generated by Kopra can facilitate recommendation explanation much easier.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
建议保存本图,每天支付宝扫一扫(相册选取)领红包
实时播报
毛男发布了新的文献求助10
刚刚
慕青应助明理凝阳采纳,获得20
1秒前
fmr发布了新的文献求助10
4秒前
serpant发布了新的文献求助10
5秒前
5秒前
淳于碧空完成签到,获得积分10
6秒前
江氏巨颏虎完成签到 ,获得积分10
7秒前
Zer完成签到,获得积分10
7秒前
Liu Xiaojing发布了新的文献求助10
10秒前
Hello应助科研通管家采纳,获得10
13秒前
情怀应助科研通管家采纳,获得10
13秒前
科目三应助科研通管家采纳,获得10
13秒前
17秒前
阿花完成签到 ,获得积分10
17秒前
丘比特应助标致的背包采纳,获得10
17秒前
925应助yuan采纳,获得30
20秒前
21秒前
sherlock发布了新的文献求助10
21秒前
21秒前
研友_nqv2WZ完成签到,获得积分10
22秒前
好好学习完成签到,获得积分10
23秒前
上官若男应助多情的黑猫采纳,获得10
24秒前
twz发布了新的文献求助10
24秒前
贵哥发布了新的文献求助10
28秒前
28秒前
叁壹粑粑完成签到,获得积分10
30秒前
斯文败类应助twz采纳,获得10
31秒前
Ning完成签到 ,获得积分10
36秒前
36秒前
40秒前
xiaobai发布了新的文献求助10
47秒前
xuk完成签到,获得积分10
50秒前
51秒前
丘比特应助云停采纳,获得10
52秒前
xiaobai完成签到,获得积分10
54秒前
songyu发布了新的文献求助10
57秒前
57秒前
研友_VZG7GZ应助FP采纳,获得10
58秒前
Iris完成签到,获得积分10
1分钟前
在下诸葛应助xxxx采纳,获得20
1分钟前
高分求助中
Teaching Social and Emotional Learning in Physical Education 1100
The Instrument Operations and Calibration System for TerraSAR-X 800
FILTRATION OF NODULAR IRON WITH CERAMIC FOAM FILTERS 500
A STUDY OF THE EFFECTS OF CHILLS AND PROCESS-VARIABLES ON THE SOLIDIFICATION OF HEAVY-SECTION DUCTILE IRON CASTINGS 500
INFLUENCE OF METAL VARIABLES ON THE STRUCTURE AND PROPERTIES OF HEAVY SECTION DUCTILE IRON 500
Filtration of inmold ductile iron 500
Lexique et typologie des poteries: pour la normalisation de la description des poteries (Full Book) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2346998
求助须知:如何正确求助?哪些是违规求助? 2050926
关于积分的说明 5110846
捐赠科研通 1784062
什么是DOI,文献DOI怎么找? 891541
版权声明 556707
科研通“疑难数据库(出版商)”最低求助积分说明 475566