QoS Prediction for Mobile Edge Service Recommendation With Auto-Encoder

• Published in: IEEE access 2019, Vol.7, p.62312-62324
• Main Authors: Yin, Yuyu, Zhang, Weipeng, Xu, Yueshen, Zhang, He, Mai, Zhida, Yu, Lifeng
• Format: Article
• Language: English
• Subjects: auto-encoder; Coders; Cold starts; Collaboration; Computational modeling; Edge computing; Euclidean geometry; features learning; Filtering; Filtering algorithms; Learning; Mobile computing; Parameter sensitivity; Prediction models; Predictive models; QoS prediction; Quality of service; service recommendation; similarity computation; Task analysis
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2019.2914737

In the mobile edge computing environment, there are a large number of mobile edge services which are the carriers of various mobile intelligent applications. So how to recommend the most suitable candidate from such a huge number of available services is an urgent task, especially the recommendation task based on quality-of-service (QoS). In traditional service recommendation, collaborative filtering (CF) has been studied in academia and industry. However, due to the mobility of users and services, there exist several defects that limit the application of the CF-based methods, especially in an edge computing environment. The most important problem is the cold-start. In this paper, we propose an ensemble model which combines the model-based CF and neighborhood-based CF. Our approach has two phases, i.e., global features learning and local features learning. In the first phase, to alleviate the cold-start problem, we propose an improved auto-encoder which deals with sparse inputs by pre-computing an estimate of the missing QoS values and can obtain the effective hidden features by capturing the complex structure of the QoS records. In the second phase, to further improve prediction accuracy, a novel computation method is proposed based on Euclidean distance that aims to address the overestimation problem. We introduce two new concepts, common invocation factor and invocation frequency factor, in similarity computation. Then we propose three prediction models, containing two individual models and one hybrid model. The two individual models are proposed to utilize user similar neighbors and service similar neighbors, and the hybrid model is to utilize all neighbors. The experiments conducted in a real-world dataset show that our models can produce superior prediction results and are not sensitive to parameter settings.