Service Mining for Web Service Composition
Conference Proceeding Article
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.
Computer Sciences | Management Information Systems
Information Systems and Management
IRI 2005: IEEE International Conference on Information Reuse and Integration, 15-17 August 2005, Las Vegas: Proceedings
City or Country
Las Vegas, NV
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. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/538