FES: A Fast Efficient Scalable QoS Prediction Framework
Soumi Chattopadhyay, Chandranath Adak, Ranjana Roy Chowdhury

TL;DR
This paper introduces FES, a scalable and fast QoS prediction framework that combines multi-phase algorithms and neural networks to improve accuracy, speed, and scalability for web service quality prediction.
Contribution
The paper proposes a semi-offline QoS prediction model that integrates multi-level clustering, collaborative filtering, and neural network regression for enhanced performance.
Findings
Outperforms state-of-the-art methods in accuracy.
Demonstrates high scalability on large datasets.
Achieves faster prediction times suitable for real-time systems.
Abstract
Quality-of-Service prediction of web service is an integral part of services computing due to its diverse applications in the various facets of a service life cycle, such as service composition, service selection, service recommendation. One of the primary objectives of designing a QoS prediction algorithm is to achieve satisfactory prediction accuracy. However, accuracy is not the only criteria to meet while developing a QoS prediction algorithm. The algorithm has to be faster in terms of prediction time so that it can be integrated into a real-time recommendation or composition system. The other important factor to consider while designing the prediction algorithm is scalability to ensure that the prediction algorithm can tackle large-scale datasets. The existing algorithms on QoS prediction often compromise on one goal while ensuring the others. In this paper, we propose a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Caching and Content Delivery · Service-Oriented Architecture and Web Services
Methodstravel james
