Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

CluCF: a clustering CF algorithm to address data sparsity problem

  • Original Research Paper
  • Published:
Service Oriented Computing and Applications Aims and scope Submit manuscript

Abstract

In QoS-based Web service recommendation, predicting Quality of Service (QoS) for users will greatly aid service selection and discovery. Collaborative filtering (CF) is an effective method for Web service selection and recommendation. Data sparsity is an important challenges for CF algorithms. Although model-based algorithms can address the data sparsity problem, those models are often time-consuming to build and update. Thus, these CF algorithms aren’t fit for highly dynamic and large-scale environments, such as Web service recommendation systems. In order to overcome this drawback, this paper proposes a novel approach CluCF, which employs user clusters and service clusters to address the data sparsity problem and classifies the new user (the new service) by location factor to lower the time complexity of updating clusters. Additionally, in order to improve the prediction accuracy, CluCF employs time factor. Time-aware user-service matrix Mu;s(tk, d) is introduced, and the time-aware similarity measurement and time-aware QoS prediction are employed in this paper. Since the QoS performance of Web services is highly related to invocation time due to some time-varying factors (e.g., service status, network condition), time-aware similarity measurement and time-aware QoS prediction are more trustworthy than traditional similarity measurement and QoS prediction, respectively. Since similarity measurement and QoS prediction are two key steps of neighborhood-based CF, time-aware CF will be more accurate than traditional CF. Moreover, our approach systematically combines user-based and item-based methods and employs influence weights to balance these two predicted values, automatically. To validate our algorithm, this paper conducts a series of large-scale experiments based on a real-world Web service QoS dataset. Experimental results show that our approach is capable of alleviating the data sparsity problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. http://www.wsdream.net/wsdream/dataset.html.

  2. For each country, they compute average QoS similarity between every pair of users or services within it, and compute an average value across all countries. This value is called as average internal QoS similarity.

  3. For each country, they also first compute an average QoS similarity between users or services within it and the other users or services outside of the country, and then compute an average value across all countries, which is called as average external QoS similarity.

  4. http://www.wsdream.net/wsdream/dataset.html.

References

  1. Yu T, Zhang Y, Lin K-J (2007) Efficient algorithms for web services selection with end-to-end qos constraints. ACM Trans Web. doi:10.1145/1232722.1232728

  2. Zhang LJ, Zhang J, Cai H (2007) Services computing. Springer and Tsinghua University Press, New York

    Google Scholar 

  3. Zhang Yilei, Zheng Zibin, Lyu Michael R (2011) WSPred: a time-aware personalized QoS prediction framework for web services. In: Proceedings of IEEE symposium on software reliability engineering. doi:10.1109/ISSRE.2011.17

  4. Shardanand U, Maes P (1995) Social information filtering: algorithms for automating ’Word of Mouth’. CHI ’95 Proceedings of the SIGCHI conference on human factors in computing systems. doi:10.1145/223904.223931

  5. Hill W, Stead L, Rosenstein M, Furnas G (1995) Recommending and evaluating choices in a virtual community of use. CHI ’95 Proceedings of the SIGCHI conference on human factors in computing systems. doi:10.1145/223904.223929

  6. Konstan J, Miller B, Maltz D, Herlocker J, Gordon L, Riedl J (1997) GroupLens: applying collaborative filtering to usenet news. Commun ACM 40:77–87. doi:10.1145/245108.245126

    Article  Google Scholar 

  7. Rich E (1979) User modeling via stereotypes. Cogn Sci 3:329–354

    Article  Google Scholar 

  8. Linden G, Smith B, York J (2003) Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Comput. doi:10.1109/MIC.2003.1167344

  9. Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell. doi:10.1155/2009/421425

  10. Wu J, Chen L, Xie Y et al. Titan: a system for effective web service discovery[C]. In: Proceedings of the 21st international conference companion on World Wide Web. ACM, 2012, pp 441–444

  11. Breese JS, Heckerman D, Kadie C (1998) Empirical analysis of predictive algorithms for collaborative filtering. In: UAI

  12. Billsus D, Pazzani M (1998) Learning collaborative information filters. In: Proceedings of the 15th international conference on machine learning (ICML98)

  13. Sarwar et al. (2002) Incremental singular value decomposition algorithms for highly scalable recommender systems. In: Fifth international conference on computer and information science

  14. Berry M et al (1995) Using linear algebra for intelligent information retrieval. SIAM Rev 37(4):573–595

    Article  MathSciNet  MATH  Google Scholar 

  15. Sarwar BM, Karypis G, Konstan JA, Riedl J (2000) Application of dimensionality reduction in recommender system—a case study. In: ACM WebKDD workshop

  16. Sarwar B M, Konstan J A, Borchers A et al (1998) Using filtering agents to improve prediction quality in the grouplens research collaborative filtering system. In: Proceedings of the ACM conference on computer supported cooperative work. ACM 1998:345–354

  17. Balabanovic M, Shoham Y (1997) Fab: Content-based collaborative recommendation. Commun ACM 40(3):66–72

    Article  Google Scholar 

  18. Claypool M, Gokhale A, Miranda T, et al., (1999) Combining content-based and collaborative filters in an online newspaper. In: Proceedings of the SIGIR workshop on recommender systems: algorithms and evaluation, Berkeley, CA, USA

  19. Zheng Z, Ma H, Lyu MR, King I (2009) WSRec: a collaborative filtering based web service recommendation system. In: Proceedings of the IEEE international conference on web services (ICWS 09). doi:10.1109/ICWS.2009.30

  20. Jiang Y, Liu J, Tang M, Liu XF (2011) An effective Web service recommendation method based on personalized collaborative filtering. In: Proceedings IEEE international conference on web services (ICWS 11). doi:10.1109/ICWS.2011.38

  21. Zhang L, Zhang B, Liu Y, Gao Y, Zhu Z (2010) A web service QoS prediction approach based on collaborative filtering. In: Proceedings IEEE Asia-Pacific services computing conference. doi:10.1109/APSCC.2010.43

  22. Chen X, Liu X, Huang Z, Sun H (2010) RegionKNN: a scalable hybrid collaborative filtering algorithm for personalized Web service recommendation. In: Proceedings IEEE international conference on web services (ICWS 10). doi:10.1109/ICWS.2010.27

  23. Tang Mingdong, Jiang Yechun, Liu Jianxun, Liu Xiaoqing (2012) Location-aware collaborative filtering for QoS-based service recommendation. IEEE international conference on web services (ICWS). doi:10.1109/ICWS.2012.61

  24. Chee SHS et al (2001) Rectree: an efficient collaborative filtering method. In: Data warehousing and knowledge discovery, pp141–151

  25. Sarwar B, Karypis G, Konstan J, Riedl J (2001) Itembased collaborative filtering recommendation algorithms. In WWW 2001. doi:10.1145/371920.372071

  26. Silic M, Delac G, Krka I et al. (2013) Scalable and accurate prediction of availability of atomic web services. IEEE Trans Serv Comput

  27. McLaughlin MR, Herlocker JL (2004) A collaborative filtering algorithm and evaluation metric that accurately model the user experience. In SIGIR. doi:10.1145/1008992.1009050

  28. Goldberg K, Roeder T, Gupta D, Perkins C (2001) Eigentaste: a constant time collaborative filtering algorithm. Inf Retr 4(2):133C151. doi:10.1023/A:1011419012209

    Article  MATH  Google Scholar 

  29. Schafer JB et al (2007) Collaborative filtering recommender systems. The adaptive web, Springer, Berlin, Heidelberg, pp 291–324

  30. Deshpande M, Karypis G (2004) Item-based top-n recommendation. ACM Trans Inf Syst 22:143–177. doi:10.1145/963770.963776

    Article  Google Scholar 

Download references

Acknowledgments

The work described in this paper was supported by the National Natural Science Foundation of China under Grant Nos. 91118004, 61232007 and the Innovation Program of Shanghai Municipal Education Commission (No. 13ZZ023).

Author information

Authors and Affiliations

  1. The Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China

    Chengyuan Yu & Linpeng Huang

Authors
  1. Chengyuan Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linpeng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chengyuan Yu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, C., Huang, L. CluCF: a clustering CF algorithm to address data sparsity problem. SOCA 11, 33–45 (2017). https://doi.org/10.1007/s11761-016-0191-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11761-016-0191-8

Keywords

Search

Navigation