Time-Aware Service Recommendation for Mashup Creation in an Evolving Service Ecosystem

Yangxin Zhong, Yushun Fan, Keman Huang, Wei Tan, Jia Zhang
{"title":"Time-Aware Service Recommendation for Mashup Creation in an Evolving Service Ecosystem","authors":"Yangxin Zhong, Yushun Fan, Keman Huang, Wei Tan, Jia Zhang","doi":"10.1109/ICWS.2014.17","DOIUrl":null,"url":null,"abstract":"Web service recommendation has become a critical problem as services become increasingly prevalent on the Internet. Some existing methods focus on content matching techniques such as keyword search and semantic matching while others are based on Quality of Service (QoS) prediction. However, services and their mashups are evolving over time with publishing, perishing and changing of interfaces. Therefore, a practical service recommendation approach should take into account the evolution of a service ecosystem. In this paper, we present a method to extract service evolution patterns by exploiting Latent Dirichlet Allocation (LDA) and time series prediction. A time-aware service recommendation framework for mashup creation is presented combing service evolution, collaborative filtering and content matching. Experiments on real-world ProgrammableWeb data set show that our approach leads to a higher precision than traditional collaborative filtering and content matching methods.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Web Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2014.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

Abstract

Web service recommendation has become a critical problem as services become increasingly prevalent on the Internet. Some existing methods focus on content matching techniques such as keyword search and semantic matching while others are based on Quality of Service (QoS) prediction. However, services and their mashups are evolving over time with publishing, perishing and changing of interfaces. Therefore, a practical service recommendation approach should take into account the evolution of a service ecosystem. In this paper, we present a method to extract service evolution patterns by exploiting Latent Dirichlet Allocation (LDA) and time series prediction. A time-aware service recommendation framework for mashup creation is presented combing service evolution, collaborative filtering and content matching. Experiments on real-world ProgrammableWeb data set show that our approach leads to a higher precision than traditional collaborative filtering and content matching methods.
在不断发展的服务生态系统中创建Mashup的时间感知服务推荐
随着服务在Internet上的日益普及,Web服务推荐已成为一个关键问题。现有的一些方法侧重于关键字搜索和语义匹配等内容匹配技术,而其他方法则基于服务质量(QoS)预测。然而,服务及其mashup随着时间的推移,随着接口的发布、消亡和更改而不断发展。因此,实用的服务推荐方法应该考虑到服务生态系统的演变。本文提出了一种利用潜在狄利克雷分配(Latent Dirichlet Allocation, LDA)和时间序列预测相结合的服务演化模式提取方法。结合服务演化、协同过滤和内容匹配,提出了一个用于mashup创建的时效性服务推荐框架。在可编程web数据集上的实验表明,该方法比传统的协同过滤和内容匹配方法具有更高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信