返回
Inductive Contextual Relation Learning for Personalization
DOI:10.1145/3450353.png)
摘要
En 中文
Web personalization, e.g., recommendation or relevance search, tailoring a service/product to accommodate specific online users, is becoming increasingly important. Inductive personalization aims to infer the relations between existing entities and unseen new ones, e.g., searching relevant authors for new papers or recommending new items to users. This problem, however, is challenging since most of recent studies focus on transductive problem for existing entities. In addition, despite some inductive learning approaches have been introduced recently, their performance is sub-optimal due to relatively simple and inflexible architectures for aggregating entity's content. To this end, we propose the inductive contextual personalization (ICP) framework through contextual relation learning. Specifically, we first formulate the pairwise relations between entities with a ranking optimization scheme that employs neural aggregator to fuse entity's heterogeneous contents. Next, we introduce a node embedding term to capture entity's contextual relations, as a smoothness constraint over the prior ranking objective. Finally, the gradient descent procedure with adaptive negative sampling is employed to learn the model parameters. The learned model is capable of inferring the relations between existing entities and inductive ones. Thorough experiments demonstrate that ICP outperforms numerous baseline methods for two different applications, i.e., relevant author search and new item recommendation.
Keyword:
Personalization
content-based recommendation
relation learning
node embedding
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.1
论文数:
1.2K
被引数:
4.7K
机构
引用论文
Performance improvement in cloud computing through dynamic task scheduling algorithm通过动态任务调度算法提升云计算性能
A Multi-Label Classification Method Using a Hierarchical and Transparent Representation for Paper-Reviewer Recommendation一种使用分层和透明表示的多标签分类方法,用于论文审阅者推荐

