在蕴涵领域改进了基于定量蕴涵规则挖掘的协同过滤推荐

H. T. Nguyen, H. Huynh, Lan Phuong Phan, H. Huynh
{"title":"在蕴涵领域改进了基于定量蕴涵规则挖掘的协同过滤推荐","authors":"H. T. Nguyen, H. Huynh, Lan Phuong Phan, H. Huynh","doi":"10.1145/3310986.3310996","DOIUrl":null,"url":null,"abstract":"Collaborative filtering recommendation based on association rule mining has become a research trend in the field of recommender systems. However, most research results only focus on binary data, whereas in practice sets of transactions are usually quantitative data. Moreover, association rule mining algorithms are designed to focus on optimizing for basket analysis, so that in order to better serve for recommendation, they need to be adjusted. Therefore, a solution for recommender systems to deal with association rules on both binary and quantitative data as well as improve the quality of recommendation based on the rule set is a challenge today. This paper proposes a new approach to improve the accuracy, the performance and the time of recommendation by the model based on quantitative implication rules mining in the implication field.","PeriodicalId":252781,"journal":{"name":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improved collaborative filtering recommendations using quantitative implication rules mining in implication field\",\"authors\":\"H. T. Nguyen, H. Huynh, Lan Phuong Phan, H. Huynh\",\"doi\":\"10.1145/3310986.3310996\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering recommendation based on association rule mining has become a research trend in the field of recommender systems. However, most research results only focus on binary data, whereas in practice sets of transactions are usually quantitative data. Moreover, association rule mining algorithms are designed to focus on optimizing for basket analysis, so that in order to better serve for recommendation, they need to be adjusted. Therefore, a solution for recommender systems to deal with association rules on both binary and quantitative data as well as improve the quality of recommendation based on the rule set is a challenge today. This paper proposes a new approach to improve the accuracy, the performance and the time of recommendation by the model based on quantitative implication rules mining in the implication field.\",\"PeriodicalId\":252781,\"journal\":{\"name\":\"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3310986.3310996\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3310986.3310996","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

基于关联规则挖掘的协同过滤推荐已成为推荐系统领域的一个研究方向。然而,大多数研究结果只关注二进制数据,而在实践中,交易集通常是定量数据。此外,关联规则挖掘算法的设计重点是针对购物篮分析进行优化,因此为了更好地服务于推荐,需要对其进行调整。因此,如何处理二进制和定量数据上的关联规则并提高基于规则集的推荐质量是当前推荐系统面临的一个挑战。本文在隐含领域提出了一种基于定量隐含规则挖掘的模型来提高推荐精度、性能和时间的新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved collaborative filtering recommendations using quantitative implication rules mining in implication field
Collaborative filtering recommendation based on association rule mining has become a research trend in the field of recommender systems. However, most research results only focus on binary data, whereas in practice sets of transactions are usually quantitative data. Moreover, association rule mining algorithms are designed to focus on optimizing for basket analysis, so that in order to better serve for recommendation, they need to be adjusted. Therefore, a solution for recommender systems to deal with association rules on both binary and quantitative data as well as improve the quality of recommendation based on the rule set is a challenge today. This paper proposes a new approach to improve the accuracy, the performance and the time of recommendation by the model based on quantitative implication rules mining in the implication field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信