A tensor recommendation method based on HMM network and meta-path

IF 8.1 1区 计算机科学 N/A COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2024-08-30 DOI:10.1016/j.ins.2024.121412
{"title":"A tensor recommendation method based on HMM network and meta-path","authors":"","doi":"10.1016/j.ins.2024.121412","DOIUrl":null,"url":null,"abstract":"<div><p>The main approach to capturing user latent preferences in recommendation systems (RS) is through high-order tensor decomposition and the deep-walk method. Several key issues, if solved, could improve the performance of RS. These include enforcing the interpretation of RS in the context of sparse data completion, cold start, and interpretability, mining user latent preferences with a tensor constructed from a user-item rating matrix (RM) and a preference match mechanism based on K-nearest neighbor (KNN) similar users. In this paper, a method that integrates a hidden Markov model, <em>meta</em>-path, and third-order tensor (HMM-MP-TOT) is proposed. An HMM, based on the user-item RM and latent preferences from KNN users is constructed. Subsequently, the Viterbi and deep-walk methods are used to obtain a series of user-item two-dimensional MPs. Then, truncated − singular value decomposition (t-SVD) is applied to a user-item-KNN third-order tensor to obtain a better recommendation result. On average, HMM-MP-TOT obtains 94.7% precision, 80.2% recall, and 96.4% diversity.</p></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.1000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524013264","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"N/A","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The main approach to capturing user latent preferences in recommendation systems (RS) is through high-order tensor decomposition and the deep-walk method. Several key issues, if solved, could improve the performance of RS. These include enforcing the interpretation of RS in the context of sparse data completion, cold start, and interpretability, mining user latent preferences with a tensor constructed from a user-item rating matrix (RM) and a preference match mechanism based on K-nearest neighbor (KNN) similar users. In this paper, a method that integrates a hidden Markov model, meta-path, and third-order tensor (HMM-MP-TOT) is proposed. An HMM, based on the user-item RM and latent preferences from KNN users is constructed. Subsequently, the Viterbi and deep-walk methods are used to obtain a series of user-item two-dimensional MPs. Then, truncated − singular value decomposition (t-SVD) is applied to a user-item-KNN third-order tensor to obtain a better recommendation result. On average, HMM-MP-TOT obtains 94.7% precision, 80.2% recall, and 96.4% diversity.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 HMM 网络和元路径的张量推荐方法
在推荐系统(RS)中捕捉用户潜在偏好的主要方法是高阶张量分解和深度漫步法。如果能解决几个关键问题,就能提高 RS 的性能。这些问题包括在稀疏数据完成、冷启动和可解释性的背景下强制解释 RS,使用由用户-项目评级矩阵(RM)构建的张量挖掘用户潜在偏好,以及基于 K-nearest neighbor(KNN)相似用户的偏好匹配机制。本文提出了一种集成了隐马尔可夫模型、元路径和三阶张量(HMM-MP-TOT)的方法。基于用户-项目 RM 和 KNN 用户的潜在偏好构建了一个 HMM。随后,使用 Viterbi 和深度漫步方法获得一系列用户项目二维 MP。然后,对用户-项目-KNN 三阶张量进行截断-奇异值分解(t-SVD),以获得更好的推荐结果。平均而言,HMM-MP-TOT 可获得 94.7% 的精确度、80.2% 的召回率和 96.4% 的多样性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Ex-RL: Experience-based reinforcement learning Editorial Board Joint consensus kernel learning and adaptive hypergraph regularization for graph-based clustering RT-DIFTWD: A novel data-driven intuitionistic fuzzy three-way decision model with regret theory Granular correlation-based label-specific feature augmentation for multi-label classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1