Dynamically Predicting the Quality of Service: Batch, Online, and Hybrid Algorithms

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper studies the problem of dynamically modeling the quality of web service. The philosophy of designing practical web service recommender systems is delivered in this paper. A general system architecture for such systems continuously collects the user-service invocation records and includes both an online training module and an offline training module for quality prediction. In addition, we introduce matrix factorization-based online and offline training algorithms based on the gradient descent algorithms and demonstrate the fitness of this online/offline algorithm framework to the proposed architecture. The superiority of the proposed model is confirmed by empirical studies on a real-life quality of web service data set and comparisons with existing web service recommendation algorithms.

Cite

CITATION STYLE

APA

Chen, Y., & Jiang, Z. A. (2017). Dynamically Predicting the Quality of Service: Batch, Online, and Hybrid Algorithms. Journal of Electrical and Computer Engineering, 2017. https://doi.org/10.1155/2017/9547869

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free