mapreduce中使用bloom过滤器的推荐系统

R. Pagare, A. Shinde
{"title":"mapreduce中使用bloom过滤器的推荐系统","authors":"R. Pagare, A. Shinde","doi":"10.5121/IJDKP.2013.3608","DOIUrl":null,"url":null,"abstract":"Many clients like to use the Web to discover product details in the form of online reviews. The reviews are provided by other clients and specialists. Recommender systems provide an important response to the information overload problem as it presents users more practical and personalized information facilities. Collaborative filtering methods are vital component in recommender systems as they generate high-quality recommendations by influencing the likings of society of similar users. The collaborative filtering method has assumption that people having same tastes choose the same items. The conventional collaborative filtering system has drawbacks as sparse data problem & lack of scalability. A new recommender system is required to deal with the sparse data problem & produce high quality recommendations in large scale mobile environment. MapReduce is a programming model which is widely used for large-scale data analysis. The described algorithm of recommendation mechanism for mobile commerce is user based collaborative filtering using MapReduce which reduces scalability problem in conventional CF system. One of the essential operations for the data analysis is join operation. But MapReduce is not very competent to execute the join operation as it always uses all records in the datasets where only small fraction of datasets are applicable for the join operation. This problem can be reduced by applying bloomjoin algorithm. The bloom filters are constructed and used to filter out redundant intermediate records. The proposed algorithm using bloom filter will reduce the number of intermediate results and will improve the join performance.","PeriodicalId":131153,"journal":{"name":"International Journal of Data Mining & Knowledge Management Process","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"RECOMMENDATION SYSTEM USING BLOOM FILTER IN MAPREDUCE\",\"authors\":\"R. Pagare, A. Shinde\",\"doi\":\"10.5121/IJDKP.2013.3608\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many clients like to use the Web to discover product details in the form of online reviews. The reviews are provided by other clients and specialists. Recommender systems provide an important response to the information overload problem as it presents users more practical and personalized information facilities. Collaborative filtering methods are vital component in recommender systems as they generate high-quality recommendations by influencing the likings of society of similar users. The collaborative filtering method has assumption that people having same tastes choose the same items. The conventional collaborative filtering system has drawbacks as sparse data problem & lack of scalability. A new recommender system is required to deal with the sparse data problem & produce high quality recommendations in large scale mobile environment. MapReduce is a programming model which is widely used for large-scale data analysis. The described algorithm of recommendation mechanism for mobile commerce is user based collaborative filtering using MapReduce which reduces scalability problem in conventional CF system. One of the essential operations for the data analysis is join operation. But MapReduce is not very competent to execute the join operation as it always uses all records in the datasets where only small fraction of datasets are applicable for the join operation. This problem can be reduced by applying bloomjoin algorithm. The bloom filters are constructed and used to filter out redundant intermediate records. The proposed algorithm using bloom filter will reduce the number of intermediate results and will improve the join performance.\",\"PeriodicalId\":131153,\"journal\":{\"name\":\"International Journal of Data Mining & Knowledge Management Process\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Data Mining & Knowledge Management Process\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5121/IJDKP.2013.3608\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Data Mining & Knowledge Management Process","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/IJDKP.2013.3608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

许多客户喜欢使用Web以在线评论的形式来发现产品细节。评审由其他客户和专家提供。推荐系统为用户提供了更加实用和个性化的信息设施,是对信息过载问题的重要回应。协同过滤方法是推荐系统的重要组成部分,因为它们通过影响相似用户的喜好来生成高质量的推荐。协同过滤方法假设具有相同品味的人选择相同的物品。传统的协同过滤系统存在数据稀疏和缺乏可扩展性等问题。在大规模移动环境下,需要一种新的推荐系统来处理稀疏数据问题并产生高质量的推荐。MapReduce是一种广泛用于大规模数据分析的编程模型。所描述的移动商务推荐机制的算法是基于用户的MapReduce协同过滤,减少了传统推荐系统的可扩展性问题。数据分析的基本操作之一是联接操作。但是,MapReduce并不能很好地执行连接操作,因为它总是使用数据集中的所有记录,而只有一小部分数据集适用于连接操作。该问题可以通过应用bloomjoin算法来解决。构造了布隆过滤器并用于过滤冗余的中间记录。该算法采用了布隆滤波器,减少了中间结果的数量,提高了连接性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RECOMMENDATION SYSTEM USING BLOOM FILTER IN MAPREDUCE
Many clients like to use the Web to discover product details in the form of online reviews. The reviews are provided by other clients and specialists. Recommender systems provide an important response to the information overload problem as it presents users more practical and personalized information facilities. Collaborative filtering methods are vital component in recommender systems as they generate high-quality recommendations by influencing the likings of society of similar users. The collaborative filtering method has assumption that people having same tastes choose the same items. The conventional collaborative filtering system has drawbacks as sparse data problem & lack of scalability. A new recommender system is required to deal with the sparse data problem & produce high quality recommendations in large scale mobile environment. MapReduce is a programming model which is widely used for large-scale data analysis. The described algorithm of recommendation mechanism for mobile commerce is user based collaborative filtering using MapReduce which reduces scalability problem in conventional CF system. One of the essential operations for the data analysis is join operation. But MapReduce is not very competent to execute the join operation as it always uses all records in the datasets where only small fraction of datasets are applicable for the join operation. This problem can be reduced by applying bloomjoin algorithm. The bloom filters are constructed and used to filter out redundant intermediate records. The proposed algorithm using bloom filter will reduce the number of intermediate results and will improve the join performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信