计算机科学
推荐系统
索引(排版)
国家(计算机科学)
情报检索
数据挖掘
数据科学
万维网
算法
作者
Sebastian Schelter,Mozhdeh Ariannezhad,Maarten de Rijke
标识
DOI:10.1145/3539618.3591989
摘要
Modern search and recommendation systems are optimized using logged interaction data. There is increasing societal pressure to enable users of such systems to have some of their data deleted from those systems. This paper focuses on "unlearning" such user data from neighborhood-based recommendation models on sparse, high-dimensional datasets. We present caboose, a custom top-k index for such models, which enables fast and exact deletion of user interactions. We experimentally find that caboose provides competitive index building times, makes sub-second unlearning possible (even for a large index built from one million users and 256 million interactions), and, when integrated into three state-of-the-art next-basket recommendation models, allows users to effectively adjust their predictions to remove sensitive items.
科研通智能强力驱动
Strongly Powered by AbleSci AI