The Community for Technology Leaders
Green Image
Issue No. 03 - May-June (2015 vol. 8)
ISSN: 1939-1374
pp: 356-368
Yang Zhong , Department of Automation, Tsinghua University, Beijing, China
Yushun Fan , Department of Automation, Tsinghua University, Beijing, China
Keman Huang , School of Computer Science and Technology, Tianjin University, Beijing, China
Wei Tan , , IBM Thomas J.WatsonResearch Center, Yorktown Heights, NY
Jia Zhang , Department of Electrical and Computer Engineering, Carnegie Mellon University, Moffett Field, CA
ABSTRACT
Web service recommendation has become a critical problem as services become increasingly prevalent on the Internet. Some existing methods focus on content matching techniques, while others are based on QoS measurement. However, service ecosystem is evolving over time with services publishing, prospering and perishing. Few existing methods consider or exploit the evolution of service ecosystem on service recommendation. This paper employs a probabilistic approach to predict the popularity of services to enhance the recommendation performance. A method is presented that extracts service evolution patterns by exploiting latent dirichlet allocation (LDA) and time series prediction. A time-aware service recommendation framework is established for mashup creation that conducts joint analysis of temporal information, content description and historical mashup-service usage in an evolving service ecosystem. Experiments on a real-world service repository, ProgrammableWeb.com, show that the proposed approach leads to a higher precision than traditional collaborative filtering and content matching methods, by taking into account temporal information.
INDEX TERMS
Mashups, Mathematical model, Ecosystems, Filtering, Equations, Collaboration, Computational modeling
CITATION

Y. Zhong, Y. Fan, K. Huang, W. Tan and J. Zhang, "Time-Aware Service Recommendation for Mashup Creation," in IEEE Transactions on Services Computing, vol. 8, no. 3, pp. 356-368, 2015.
doi:10.1109/TSC.2014.2381496
170 ms
(Ver 3.3 (11022016))