Web Service Evaluation Method Based on Time-aware Collaborative Filtering

Author(s):  
Guisheng Yin ◽  
Xiaohui Cui ◽  
Hongbin Dong ◽  
Yuxin Dong
2013 ◽  
Vol 756-759 ◽  
pp. 3899-3903
Author(s):  
Ping Sun ◽  
Zheng Yu Li ◽  
Zi Yang Han ◽  
Feng Ying Wang

Recommendation algorithm is the most core and key point in recommender systems, and plays a decisive role in type and performance evaluation. At present collaborative filtering recommendation not only is the most widely useful and successful recommend technology, but also is a promotion for the study of the whole recommender systems. The research on the recommender systems is coming into a focus and critical problem at home and abroad. Firstly, the latest development and research in the collaborative filtering recommendation algorithm are introduced. Secondly, the primary idea and difficulties faced with the algorithm are explained in detail. Some classical solutions are used to deal with the problems such as data sparseness, cold start and augmentability. Thirdly, the particular evaluation method of the algorithm is put forward and the developments of collaborative filtering algorithm are prospected.


2021 ◽  
pp. 1063293X2110195
Author(s):  
Ying Yu ◽  
Shan Li ◽  
Jing Ma

Selecting the most efficient from several functionally equivalent services remains an ongoing challenge. Most manufacturing service selection methods regard static quality of service (QoS) as a major competitiveness factor. However, adaptations are difficult to achieve when variable network environment has significant impact on QoS performance stabilization in complex task processes. Therefore, dynamic temporal QoS values rather than fixed values are gaining ground for service evaluation. User preferences play an important role when service demanders select personalized services, and this aspect has been poorly investigated for temporal QoS-aware cloud manufacturing (CMfg) service selection methods. Furthermore, it is impractical to acquire all temporal QoS values, which affects evaluation validity. Therefore, this paper proposes a time-aware CMfg service selection approach to address these issues. The proposed approach first develops an unknown-QoS prediction model by utilizing similarity features from temporal QoS values. The model considers QoS attributes and service candidates integrally, helping to predict multidimensional QoS values accurately and easily. Overall QoS is then evaluated using a proposed temporal QoS measuring algorithm which can self-adapt to user preferences. Specifically, we employ the temporal QoS conflict feature to overcome one-sided user preferences, which has been largely overlooked previously. Experimental results confirmed that the proposed approach outperformed classical time series prediction methods, and can also find better service by reducing user preference misjudgments.


Author(s):  
Shihang Huang ◽  
Xue Jiang ◽  
Nan Zhang ◽  
Cheng Zhang ◽  
Depeng Dang

2018 ◽  
Vol 110 ◽  
pp. 191-205 ◽  
Author(s):  
Ruibin Xiong ◽  
Jian Wang ◽  
Neng Zhang ◽  
Yutao Ma

Sign in / Sign up

Export Citation Format

Share Document