Service Solution Planning Considering Priori Knowledge and Fast Retrieval
Service composition is widely used to build complex value-added composite services to meet various coarse-grained requirements of customers. Discovering relevant services as the constituents of composite services is a crucial task, which needs to be frequently performed during the composition proces...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8519718/ |
id |
doaj-9a463703ce64422c9d781b35a03f9bb6 |
---|---|
record_format |
Article |
spelling |
doaj-9a463703ce64422c9d781b35a03f9bb62021-03-29T20:28:43ZengIEEEIEEE Access2169-35362018-01-016682636827610.1109/ACCESS.2018.28791208519718Service Solution Planning Considering Priori Knowledge and Fast RetrievalRuilin Liu0https://orcid.org/0000-0002-6958-0272Xiaofei Xu1Zhongjie Wang2Quan Z. Sheng3School of Computer Science and Technology, Harbin Institute of Technology, Harbin, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, ChinaDepartment of Computing, Macquarie University, Sydney, NSW, AustraliaService composition is widely used to build complex value-added composite services to meet various coarse-grained requirements of customers. Discovering relevant services as the constituents of composite services is a crucial task, which needs to be frequently performed during the composition process. Due to the fact that the amount of services available on the Internet is increasing drastically, the efficiency of both service discovery and composition becomes a big challenge. To solve this challenge, we propose a Priori Knowledge Based Service Composition (PKBSC) approach to reduce the searching space of relevant service discovery so as to improve the efficiency of service composition. PKBSC utilizes an interoperable approach, including an ontology construction and merging method, to solve the problem of the cross-domain and heterogeneous services from different repositories. In addition, <italic>service pattern</italic> is adopted to describe priori knowledge from massive historical solutions, which is a recurrent valuable fragment composed of services frequently invoked together in service solutions. PKBSC also adopts the Formal Concept Analysis to extract the implicit relationship between service requests and service patterns. Compared with the approach of composing multiple services from scratch, PKBSC exhibits better performance since the search space is greatly reduced by the adoption of service patterns. Experiments demonstrate that the proposed approach significantly improves the efficiency of service composition by 22.44%.https://ieeexplore.ieee.org/document/8519718/Formal concept analysisfrequent pattern miningservice compositionservice pattern |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ruilin Liu Xiaofei Xu Zhongjie Wang Quan Z. Sheng |
spellingShingle |
Ruilin Liu Xiaofei Xu Zhongjie Wang Quan Z. Sheng Service Solution Planning Considering Priori Knowledge and Fast Retrieval IEEE Access Formal concept analysis frequent pattern mining service composition service pattern |
author_facet |
Ruilin Liu Xiaofei Xu Zhongjie Wang Quan Z. Sheng |
author_sort |
Ruilin Liu |
title |
Service Solution Planning Considering Priori Knowledge and Fast Retrieval |
title_short |
Service Solution Planning Considering Priori Knowledge and Fast Retrieval |
title_full |
Service Solution Planning Considering Priori Knowledge and Fast Retrieval |
title_fullStr |
Service Solution Planning Considering Priori Knowledge and Fast Retrieval |
title_full_unstemmed |
Service Solution Planning Considering Priori Knowledge and Fast Retrieval |
title_sort |
service solution planning considering priori knowledge and fast retrieval |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
Service composition is widely used to build complex value-added composite services to meet various coarse-grained requirements of customers. Discovering relevant services as the constituents of composite services is a crucial task, which needs to be frequently performed during the composition process. Due to the fact that the amount of services available on the Internet is increasing drastically, the efficiency of both service discovery and composition becomes a big challenge. To solve this challenge, we propose a Priori Knowledge Based Service Composition (PKBSC) approach to reduce the searching space of relevant service discovery so as to improve the efficiency of service composition. PKBSC utilizes an interoperable approach, including an ontology construction and merging method, to solve the problem of the cross-domain and heterogeneous services from different repositories. In addition, <italic>service pattern</italic> is adopted to describe priori knowledge from massive historical solutions, which is a recurrent valuable fragment composed of services frequently invoked together in service solutions. PKBSC also adopts the Formal Concept Analysis to extract the implicit relationship between service requests and service patterns. Compared with the approach of composing multiple services from scratch, PKBSC exhibits better performance since the search space is greatly reduced by the adoption of service patterns. Experiments demonstrate that the proposed approach significantly improves the efficiency of service composition by 22.44%. |
topic |
Formal concept analysis frequent pattern mining service composition service pattern |
url |
https://ieeexplore.ieee.org/document/8519718/ |
work_keys_str_mv |
AT ruilinliu servicesolutionplanningconsideringprioriknowledgeandfastretrieval AT xiaofeixu servicesolutionplanningconsideringprioriknowledgeandfastretrieval AT zhongjiewang servicesolutionplanningconsideringprioriknowledgeandfastretrieval AT quanzsheng servicesolutionplanningconsideringprioriknowledgeandfastretrieval |
_version_ |
1724194808908480512 |