Recommendation for Newborn Services by Divide-and-Conquer

Junqi Zhang, Yushun Fan, Wei Tan, Jia Zhang
{"title":"Recommendation for Newborn Services by Divide-and-Conquer","authors":"Junqi Zhang, Yushun Fan, Wei Tan, Jia Zhang","doi":"10.1109/ICWS.2017.16","DOIUrl":null,"url":null,"abstract":"Service recommendation plays a critical role in fostering the growth of service ecosystems. However, existing methods are mainly in favor of a small number of popular services while newly emerged ones (i.e., newborn services) are largely ignored, which hurts the systems in two aspects. First, the potential of many services, especially the newborn ones, is wasted. Second, service ecosystems highly depending on a few kernel services are not diversified nor robust. To address this issue, we propose to proactively recommend collaborative services for newborn ones. The aim is to illuminate how to use the newborn services and fertilize their proper usages. While this is a cold start problem, frequent collaboration among newborn or dissimilar services makes it more difficult. In this situation, a Divide-and-Conquer approach is adopted utilizing category tags and collaboration records (DCCC). For each newborn service, the approach first produces one ranked list of old services and one list of newborn services, separately. DCCC then merges the two lists into one for recommendation. Experiments over a real-world dataset from ProgrammableWeb demonstrate that the proposed approach achieves significant improvement in recommendation accuracy compared with baseline methods.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Web Services (ICWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2017.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Service recommendation plays a critical role in fostering the growth of service ecosystems. However, existing methods are mainly in favor of a small number of popular services while newly emerged ones (i.e., newborn services) are largely ignored, which hurts the systems in two aspects. First, the potential of many services, especially the newborn ones, is wasted. Second, service ecosystems highly depending on a few kernel services are not diversified nor robust. To address this issue, we propose to proactively recommend collaborative services for newborn ones. The aim is to illuminate how to use the newborn services and fertilize their proper usages. While this is a cold start problem, frequent collaboration among newborn or dissimilar services makes it more difficult. In this situation, a Divide-and-Conquer approach is adopted utilizing category tags and collaboration records (DCCC). For each newborn service, the approach first produces one ranked list of old services and one list of newborn services, separately. DCCC then merges the two lists into one for recommendation. Experiments over a real-world dataset from ProgrammableWeb demonstrate that the proposed approach achieves significant improvement in recommendation accuracy compared with baseline methods.
分而治之新生儿服务建议
服务推荐在促进服务生态系统的成长中起着至关重要的作用。然而,现有的方法主要是支持少数流行的服务,而新出现的服务(即新生儿服务)在很大程度上被忽视,这在两个方面对系统造成了伤害。首先,许多服务的潜力,尤其是新生服务的潜力被浪费了。其次,高度依赖少数核心服务的服务生态系统既不多样化,也不健壮。针对这一问题,我们建议积极推荐新生儿协同服务。目的是阐明如何使用新生儿服务,并使其正确使用。虽然这是一个冷启动问题,但新生儿或不同服务之间的频繁合作使其更加困难。在这种情况下,采用一种分而治之的方法,利用类别标签和协作记录(DCCC)。对于每个新生儿服务,该方法首先分别生成一个旧服务的排序列表和一个新生儿服务列表。然后,DCCC将两个列表合并为一个以供推荐。在ProgrammableWeb的真实数据集上进行的实验表明,与基线方法相比,该方法在推荐精度方面取得了显着提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信