Abstract：Services that have never been used and newly released services in Web service systems are called cold start services. A cold start service collaboration relationship mining and predicting method is developed to help service composition developers identify the characteristics of cold start services, increase attention to and usage of cold start services, and enhance the element diversity and robustness of service systems. The method first establishes a functional vector for each service using service description reconstruction and a functional topic analysis. Next, the method builds a collaborative vector for each non-cold start service based on its historical collaboration record and functional vector. Finally, the method compares the functional vectors of cold start services with the collaborative vectors of non-cold start services to predict the collaboration relationships for cold start services. Tests on real-world data show that this method more effectively predicts the relationships than state-of-the-art methods.
郝予实, 范玉顺. 服务系统中冷启动服务协作关系挖掘与预测[J]. 清华大学学报（自然科学版）, 2019, 59(11): 917-924.
HAO Yushi, FAN Yushun. Mining and predicting of cold start service collaboration relationships in service systems. Journal of Tsinghua University(Science and Technology), 2019, 59(11): 917-924.
[1] 辛乐, 范玉顺. 考虑协作方的服务组合分析[J]. 清华大学学报(自然科学版), 2015, 55(5):538-542, 549. XIN L, FAN Y S. Service composition analysis with collaboration[J]. Journal of Tsinghua University (Science and Technology), 2015, 55(5):538-542, 549. (in Chinese) [2] XU W, CAO J, HU L, et al. A social-aware service recommendation approach for mashup creation[J]. International Journal of Web Services Research, 2013, 10(1):53-72. [3] YAO L, SHENG Q Z, NGU A H H, et al. Unified collaborative and content-based web service recommendation[J]. IEEE Transactions on Services Computing, 2015, 8(3):453-466. [4] CAO B, LIU J, TANG M, et al. Mashup service recommendation based on user interest and social network[C]//Proceedings of the 20th IEEE International Conference on Web Services. Santa Clara, USA, 2013:99-106. [5] GAO Z, FAN Y, WU C, et al. SeCo-LDA:Mining service co-occurrence topics for recommendation[C]//Proceedings of the 23rd IEEE International Conference on Web Services. San Francisco, USA, 2016:25-32. [6] DONG X, HALEVY A, MADHAVAN J, et al. Similarity search for web services[C]//Proceedings of the 13th International Conference on Very Large Data Bases. Toronto, Canada, 2004, 30:372-383. [7] MENG S, DOU W, ZHANG X, et al. KASR:A keyword-aware service recommendation method on MapReduce for big data applications[J]. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(12):3221-3231. [8] ZHANG Y, LEI T, WANG Y. A service recommendation algorithm based on modeling of implicit demands[C]//Proceedings of the 23th IEEE International Conference on Web Services. San Francisco, USA, 2016:17-24. [9] LEI Y, ZHOU J, ZHANG J, et al. Time-aware semantic web service recommendation[C]//Proceedings of the 12th IEEE International Conference on Services Computing. New York, USA, 2015:664-671. [10] CAO B, LIU X, RAHMAN M, et al. Integrated content and network-based service clustering and web APIs recommendation for mashup development[J/OL]. IEEE Transactions on Services Computing, 2017. DOI:10.1109/TSC.2017.2686390. [11] LIANG Q A, CHUNG J Y, MILLER S, et al. Service pattern discovery of web service mining in web service registry-repository[C]//Proceedings of the IEEE International Conference on E-Business Engineering. Shanghai, 2006:286-293. [12] HUANG K, FAN Y, TAN W. Recommendation in an evolving service ecosystem based on network prediction[J]. IEEE Transactions on Automation Science and Engineering, 2014, 11(3):906-920. [13] HAO Y, FAN Y, TAN W, et al. Service recommendation based on targeted reconstruction of service descriptions[C]//Proceedings of the 24th IEEE International Conference on Web Services. Honolulu, USA, 2017:285-292. [14] BLEI D M, NG A Y, JORDAN M I. Latent Dirichlet allocation[J]. Journal of Machine Learning Research, 2003, 3(1):993-1022. [15] PORTEOUS I, NEWMAN D, IHLER A, et al. Fast collapsed Gibbs sampling for latent Dirichlet allocation[C]//Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Las Vegas, USA, 2008:569-577. [16] LIN J. Divergence measures based on the Shannon entropy[J]. IEEE Transactions on Information Theory, 2002, 37(1):145-151. [17] HUANG K, YAO J, FAN Y, et al. Mirror, mirror, on the web, which is the most reputable service of them all?[C]//Proceedings of the 11th International Conference on Service-Oriented Computing. Berlin, Germany:Springer, 2013:343-357. [18] CREMONESI P, PICOZZI M, MATERA M. A comparison of recommender systems for mashup composition[C]//Proceedings of the 3rd International Workshop on Recommendation Systems for Software Engineering. Zurich, Switzerland, 2012:54-58. [19] LI C, ZHANG R, HUAI J, et al. A probabilistic approach for web service discovery[C]//Proceedings of the 10th IEEE International Conference on Services Computing. Santa Clara, USA, 2013:49-56. [20] ZHENG Z, MA H, LYU M R, et al. WSRec:A collaborative filtering based web service recommender system[C]//Proceedings of the 16th IEEE International Conference on Web Services. Los Angeles, USA, 2009:437-444. [21] ZHANG J, FAN Y, TAN W, et al. Recommendation for newborn services by divide-and-conquer[C]//Proceedings of the 24th IEEE International Conference on Web Services. Honolulu, USA, 2017:57-64.
2019, Vol. 59 
