• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 147 / 147

ÇѱÛÁ¦¸ñ(Korean Title) An expanded Matrix Factorization model for real-time Web service QoS prediction
¿µ¹®Á¦¸ñ(English Title) An expanded Matrix Factorization model for real-time Web service QoS prediction
ÀúÀÚ(Author) Jinsheng Hao   Guoping Su   Xiaofeng Han   Wei Nie  
¿ø¹®¼ö·Ïó(Citation) VOL 15 NO. 11 PP. 3913 ~ 3934 (2021. 11)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Real-time prediction of Web service of quality (QoS) provides more convenience for web services in cloud environment, but real-time QoS prediction faces severe challenges, especially under the cold-start situation. Existing literatures of real-time QoS predicting ignore that the QoS of a user/service is related to the QoS of other users/services. For example, users/services belonging to the same group of category will have similar QoS values. All of the methods ignore the group relationship because of the complexity of the model. Based on this, we propose a real-time Matrix Factorization based Clustering model (MFC), which uses category information as a new regularization term of the loss function. Specifically, in order to meet the real-time characteristic of the real-time prediction model, and to minimize the complexity of the model, we first map the QoS values of a large number of users/services to a lower-dimensional space by the PCA method, and then use the K-means algorithm calculates user/service category information, and use the average result to obtain a stable final clustering result. Extensive experiments on real-word datasets demonstrate that MFC outperforms other state-of-the-art prediction algorithms.
Å°¿öµå(Keyword) Real-time QoS prediction   matrix factorization   clustering   K-means  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå