Numerical similarity-aware data partitioning for recommendations as a service

Ting-Ting Yang, Hsueh-Wen Tseng
{"title":"Numerical similarity-aware data partitioning for recommendations as a service","authors":"Ting-Ting Yang, Hsueh-Wen Tseng","doi":"10.1145/3019612.3019676","DOIUrl":null,"url":null,"abstract":"At present, recommendations become an acceptable choice to replace annoying and widespread advertisements. Recommender systems (RS) are mainly used by large scale e-businesses, such as Amazon [1] and Netflix [4], because implementing and deploying RS can involve substantial investments. Many e-commerce businesses prefer to outsource the recommendation services. Therefore, Recommendation as a Service (RaaS) becomes a newly emerging trend for providing a feasible RS alternative. The providers of these services, the RS providers, need to pay the fee of cloud computing services, which is proportional to the amount of time, memory requirement, and computation resources. In addition, the RS providers must support rapidly recommendation services to meet the requests of clients. In this paper, we propose a numerical similarity-aware data partitioning (NSDP) scheme that effectively uses the numeric and similarity of datasets to exactly estimate the memory and the computation requirements for distributing the workloads. The simulation results demonstrate that NSDP significantly improves the speedup performance and achieves high scalability in the RaaS distributed-memory environment.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3019676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

At present, recommendations become an acceptable choice to replace annoying and widespread advertisements. Recommender systems (RS) are mainly used by large scale e-businesses, such as Amazon [1] and Netflix [4], because implementing and deploying RS can involve substantial investments. Many e-commerce businesses prefer to outsource the recommendation services. Therefore, Recommendation as a Service (RaaS) becomes a newly emerging trend for providing a feasible RS alternative. The providers of these services, the RS providers, need to pay the fee of cloud computing services, which is proportional to the amount of time, memory requirement, and computation resources. In addition, the RS providers must support rapidly recommendation services to meet the requests of clients. In this paper, we propose a numerical similarity-aware data partitioning (NSDP) scheme that effectively uses the numeric and similarity of datasets to exactly estimate the memory and the computation requirements for distributing the workloads. The simulation results demonstrate that NSDP significantly improves the speedup performance and achieves high scalability in the RaaS distributed-memory environment.
将数字相似度感知数据分区作为服务进行推荐
目前,推荐成为一种可接受的选择,以取代烦人的和广泛的广告。推荐系统(RS)主要用于大型电子商务,如Amazon[1]和Netflix[1],因为实现和部署RS可能涉及大量投资。许多电子商务企业倾向于外包推荐服务。因此,推荐即服务(RaaS)成为提供可行的推荐服务替代方案的新兴趋势。这些服务的提供者(RS提供者)需要支付云计算服务的费用,这与时间、内存需求和计算资源成正比。此外,RS提供者必须支持快速推荐服务,以满足客户机的请求。在本文中,我们提出了一种数值相似感知数据分区(NSDP)方案,该方案有效地利用数据集的数值和相似度来准确估计分配工作负载的内存和计算需求。仿真结果表明,在RaaS分布式内存环境下,NSDP显著提高了加速性能,实现了较高的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信