Service Mining for Web Service Composition
Publication Type
Conference Proceeding Article
Publication Date
8-2005
Abstract
In this paper, we propose the concept of service mining and show how this mining helps in the automatic assemblage of services into complex aggregates called composite services. Differences of service mining with Web mining are explained. With a framework for composite service processing as background, possible aspects of service mining are explored. We introduce the concept of service constraint processing (SCP) for service mining, and model it as a 2-tier constraint satisfaction problem (CSP) problem. An algorithm for solving the SCP problem is also given.
Discipline
Computer Sciences | Management Information Systems
Research Areas
Information Systems and Management
Publication
IRI 2005: IEEE International Conference on Information Reuse and Integration, 15-17 August 2005, Las Vegas: Proceedings
First Page
470
Last Page
475
ISBN
9780780390935
Identifier
10.1109/IRI-05.2005.1506518
Publisher
IEEE
City or Country
Las Vegas, NV
Citation
LIANG, Qianhui (Althea); Miller, Steven; and Chung, J..
Service Mining for Web Service Composition. (2005). IRI 2005: IEEE International Conference on Information Reuse and Integration, 15-17 August 2005, Las Vegas: Proceedings. 470-475.
Available at: https://ink.library.smu.edu.sg/sis_research/538
Additional URL
http://dx.doi.org/10.1109/IRI-05.2005.1506518