A hidden Markov model for collaborative filtering

计算机科学 协同过滤 推荐系统 隐马尔可夫模型 多项式分布 积极倾听 产品(数学) 滤波器(信号处理) 集合(抽象数据类型) 阅读(过程) 偏爱 马尔可夫模型 选择(遗传算法) 马尔可夫链 机器学习 数据挖掘 人工智能 计量经济学 几何学 数学 沟通 社会学 政治学 计算机视觉 微观经济学 法学 经济 程序设计语言
作者
Nachiketa Sahoo,Param Vir Singh,Tridas Mukhopadhyay
出处
期刊:Management Information Systems Quarterly [MIS Quarterly]
卷期号:36 (4): 1329-1356 被引量:89
标识
DOI:10.5555/2481674.2481689
摘要

In this paper, we present a method to make personalized recommendations when user preferences change over time. Most of the works in the recommender systems literature have been developed under the assumption that user preference has a static pattern. However, this is a strong assumption especially when the user is observed over a long period of time. With the help of a data set on employees' blog reading behavior, we show that users' product selection behaviors change over time. We propose a hidden Markov model to correctly interpret the users' product selection behaviors and make personalized recommendations. The user preference is modeled as a hidden Markov sequence. A variable number of product selections of different types by each user in each time period requires a novel observation model. We propose a negative binomial mixture of multinomial to model such observations. This allows us to identify stable global preferences of users and to track individual users through these preferences. We evaluate our model using three real-world data sets with different characteristics. They include data on employee blog reading behavior inside a firm, users' movie rating behavior at Netflix, and users' music listening behavior collected through last.fm. We compare the recommendation performance of the proposed model with that of a number of collaborative filtering algorithms and a recently proposed temporal link prediction algorithm. We find that the proposed HMM-based collaborative filter performs as well as the best among the alternative algorithms when the data is sparse or static. However, it outperforms the existing algorithms when the data is less sparse and the user preference is changing. We further examine the performances of the algorithms using simulated data with different characteristics and highlight the scenarios where it is beneficial to use a dynamic model to generate product recommendation.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
石会发完成签到,获得积分10
刚刚
刚刚
Feipeng应助ZXD1989采纳,获得70
刚刚
刚刚
刚刚
yihuifa发布了新的文献求助10
1秒前
原yuan完成签到,获得积分10
1秒前
sunny发布了新的文献求助10
2秒前
2秒前
eternity136发布了新的文献求助10
3秒前
3秒前
卓头OvQ发布了新的文献求助10
3秒前
3秒前
科研通AI2S应助slbytxs采纳,获得10
3秒前
不开花花完成签到,获得积分10
3秒前
sherry完成签到,获得积分10
3秒前
堇色安年应助大辉采纳,获得10
4秒前
Whisper发布了新的文献求助10
4秒前
Doreen发布了新的文献求助10
4秒前
euphoria发布了新的文献求助10
4秒前
5秒前
研友_LpQ3rn完成签到,获得积分10
5秒前
自信的昊强完成签到,获得积分10
6秒前
6秒前
隐形曼青应助tang采纳,获得10
7秒前
asang发布了新的文献求助10
7秒前
wanci应助读书不如锐克五采纳,获得10
7秒前
哲别发布了新的文献求助10
8秒前
OH给OH的求助进行了留言
8秒前
8秒前
8秒前
8秒前
枕石漱泉完成签到,获得积分10
9秒前
htt发布了新的文献求助10
9秒前
FashionBoy应助miki采纳,获得10
9秒前
思源应助江文浩采纳,获得10
9秒前
10秒前
10秒前
Gigi完成签到,获得积分10
10秒前
10秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
48V Low-voltage Power Distribution Network (PDN) Architecture Industry Report, 2024 800
ズームレンズの光学設計に関する研究 800
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7300932
求助须知:如何正确求助?哪些是违规求助? 8919246
关于积分的说明 18890711
捐赠科研通 6965678
什么是DOI,文献DOI怎么找? 3211286
关于科研通互助平台的介绍 2380363
邀请新用户注册赠送积分活动 2188058