A statistical service composition approach based on hidden hierarchy markov model

International Conference on Advanced Communication Technology, ICACT

Volumn 1, Issue , 2009, Pages 247-251

  Yang, Hao ^a   Xu, Hui ^b   Zhang, Ying ^c  

^a Guangdong Electric Power Insti Tute   (China)

^b GuangDong Electric Power Insti tute ^*  (China)

^c BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Coarse grained service decomposition; Fine grained service decomposition; Hierarchy hid den markov model; Statistical service composition

Indexed keywords

COARSE-GRAINED SERVICE DECOMPOSITION; COMPLEX SERVICES; COMPOSITE WEB SERVICES; FINE-GRAINED SERVICE DECOMPOSITION; HIERARCHY HID-DEN MARKOV MODEL; MARKOV MODEL; MULTISCALE; NEXT GENERATION INTERNET; SEARCH METHOD; SERVICE COMPOSITIONS; SERVICE REQUESTS; STATISTICAL SERVICE COMPOSITION; STATISTICAL SERVICES; WEB SERVICE COMPOSITION;

INFORMATION SERVICES; MARKOV PROCESSES; PROBABILISTIC LOGICS; STATISTICS; WEB SERVICES;

PROBABILITY DENSITY FUNCTION;

EID: 67649882931     PISSN: 17389445     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. M.Papazoglou, D.Georgakopoulos, Service-Oriented Computing. Communications of the ACM. 46(10): p. 25-28. 2003
2. Wang Xl, Guo Zm, Zhou Ay, Grammar-Based Message Processing in Web Service Composition. Chinese Journal of Computers. 4: p. 478-485. 2005
3. Zhang Hp, Liu Q, Chinese Coarse Segmenting based on N-Shortpath. Chinese Information Journal. 16(5). 2002
4. Zhang Hp, Yu Hk, Xiong Dy, Liu Q, HHMM-Based Chinese lexical analyzer ICTCLAS., in the 2nd SigHan Workshop, ACM: Sigapore. p. 184-187. 2003
5. Akkiraju R, Farrell J, Miller J, Web Service Semantics-WSDL-S. W3C Member Submission. 7. 2005
6. Shankar R, Ponnekanti, Armando Fox, Sword, A De-veloper Toolkit for Web Service Composition, in In Proceedings of the International World Wide Web Conference: Honolulu, Hawaii, USA. p. 83-107. 2002
7. Liang Qa, Su Syw, AND/OR Graph and Search algo-rithm for Discovering Composite Web Service. International Journal of Web Service Research: p. 514-540. 2005
8. B.Orriens, J.Yang, and M.P.Papazoglou, A Framework for Business Rule Driven Service Composition. LECTURE NOTES IN COMPUTER SCIENCE: p. 14-27. 2003
9. B.Orriens, J.Yang, and M.Papazoglou, A Rule Driven Approach for Developing Adaptive Service Oriented Business Collaboration. LECTURE NOTES IN COMPUTER SCIENCE. 3826: p. 61. 2005
10. Casati F, Ilnicki S, Jin Lj, Krishnamoorthy V, Adaptive and dynamic service composition in eFlow, in In Proc. of the 12th Int'l Conf. on Advanced Information Systems Engineering (CAiSE). 2000
11. Lin Cy, Hovy E, Automatic evaluation of summaries us-ing N-gram co-occurrence statistics, in Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology. p. 71-78. 2003
12. Ahuja Rk, Mehlhorn K, Orlin Kb, Faster Algorithms for the Shortest Path Problem. Journal of the Association for Compu-ting Machinery. 1990
13. Zhan Fb, Noon Ce, Shortest Path Algorithms: An Evaluation using Real Road Networks. Transportation Science. 1998
14. Korkmaz, T. And Krunz, M. And Tragoudas, S., An ef-ficient algorithm for finding a path subject to two additive con-straints. Computer Communications. 25(3): p. 225-238. 2002
15. Noto, M. And Sato, H., A method for the shortest path search by extended Dijkstraalgorithm, in Systems, Man, and Cy-bernetics, 2000 IEEE International Conference. 2003
16. Fan Y, Zheng C, Adjust Web Pages Classification based on Naïve Bayes Algorithm. Software Journal. 9: p. 1386-1392. 2001 (Pubitemid 34302790)
17. Igor K, Semi-naïve Bayesian Classifier. Springer Ma-chine-Learning EWSL-91: p. 206-219. 1991
18. Yang H, Chen Jl, Meng Xw, Dynamically Traveling Web Service Clustering Based on Spatial and Temporal Aspects. Springer Lecture Notes in Computer Science: p. 348-357. 2007