eCite Digital Repository

Web service orchestration topic mining

Citation

Chu, VW and Wong, RK and Chi, C and Hung, PCK, Web service orchestration topic mining, Proceedings of 2014 IEEE International Conference on Web Services, 27 June-2 July 2014, Anchorage, United States, pp. 225-232. ISBN 978-1-4799-5054-6 (2014) [Refereed Conference Paper]

Copyright Statement

Copyright 2014 IEEE

DOI: doi:10.1109/ICWS.2014.42

Abstract

Due to the popularity of using web services to deliver services on the Web, a clear view of how they are being consumed is becoming critical. Researchers have been trying multiple methods to reveal actual service orchestration patterns from service logs. However, most of the discovery methods have taken deterministic approaches, and hence, they do not provide enough allowance to cater for incomplete data and noises. On the other hand, most investigations do not take combinatorial explosion into consideration leading to scalability problem. Moreover, asynchronous web service invocations and distributed executions also make it difficult to identify service patterns due to the randomness in log record generation. In this paper, probabilistic topic mining class of solutions are applied to reveal web service orchestration patterns from service logs, in which robust approximation methods are available to provide scalability. Data sparsity problem in service log is also investigated by using biterm topic model (BTM) and comparing its results with traditional latent Dirichlet allocation (LDA) model. In addition, a topic matching method is introduced based on the Hungarian method on Jensen-Shannon divergence matrix, whilst notions of aggJSD and autoJSD are also introduced to measure topic diversity between matched topic sets and within a single topic set respectively. Experiment results confirm that BTM can be used for service logs with short log entries and with sparsity larger than 90% approximately.

Item Details

Item Type:Refereed Conference Paper
Keywords:web services, orchestration, topic model, data sparsity problem, short message problem
Research Division:Information and Computing Sciences
Research Group:Distributed Computing
Research Field:Web Technologies (excl. Web Search)
Objective Division:Expanding Knowledge
Objective Group:Expanding Knowledge
Objective Field:Expanding Knowledge in the Information and Computing Sciences
Author:Chi, C (Dr Chi-Hung Chi)
ID Code:117370
Year Published:2014
Web of Science® Times Cited:1
Deposited By:Information and Communication Technology
Deposited On:2017-06-08
Last Modified:2017-07-18
Downloads:0

Repository Staff Only: item control page