{"title":"基于 HMM 网络和元路径的张量推荐方法","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":"{\"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\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","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":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
A tensor recommendation method based on HMM network and meta-path
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.
期刊介绍:
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.