首页> 外文会议>International conference on algorithms and architectures for parallel processing >Web Service Recommendation via Exploiting Temporal QoS Information
【24h】

Web Service Recommendation via Exploiting Temporal QoS Information

机译:通过利用时间QoS信息进行Web服务推荐

获取原文

摘要

With the rapid development of technologies based on Web service, a large quantity of Web services are available on the Internet. Web service recommendation aims at helping users in designing and developing service-oriented software systems. How to recommend web services with better QoS value receives a lot of attention. Previous works are usually based on the assumption that the QoS information is available. However, we usually encounter data sparsity issue, which demands the prediction of QoS Value. Also, the QoS Value of Web services may change over time due to the dynamic environment. How to handle the dynamic data streams of incoming service QoS value is a big challenge. To address above problems, we propose an Web Service Recommendation Framework by considering the temporal information. We explore to envision such QoS value data as a tensor and transform it into tensor factorization problem. A Tucker decomposition (TD) method is proposed to cope with the model which includes multidimensional information: user, service and time. To deal with the dynamic data streams of service QoS value, We introduce an incremental tensor factorization (ITF) method which is scalable, and space efficient. Comprehensive experiments are conducted on real-world Web service dataset and experimental results show that our approach exceed other approaches in efficiency and accuracy.
机译:随着基于Web服务的技术的飞速发展,Internet上提供了大量Web服务。 Web服务推荐旨在帮助用户设计和开发面向服务的软件系统。如何推荐具有更好QoS值的Web服务备受关注。先前的工作通常基于QoS信息可用的假设。但是,我们通常会遇到数据稀疏性问题,这需要对QoS值进行预测。此外,由于动态环境,Web服务的QoS值可能会随时间变化。如何处理传入服务QoS值的动态数据流是一个很大的挑战。为了解决上述问题,我们提出了一种通过考虑时间信息的Web服务推荐框架。我们探索将这种QoS值数据设想为张量,并将其转换为张量分解问题。提出了一种塔克分解(TD)方法来处理该模型,该模型包括多维信息:用户,服务和时间。为了处理服务QoS值的动态数据流,我们引入了一种可扩展且节省空间的增量张量因子分解(ITF)方法。在真实的Web服务数据集上进行了全面的实验,实验结果表明,我们的方法在效率和准确性上超过了其他方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号