Details
| Original language | English |
|---|---|
| Title of host publication | 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest |
| Pages | 608-615 |
| Number of pages | 8 |
| Publication status | Published - 2011 |
| Event | 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Anchorage, AK, United States Duration: 9 Oct 2011 → 12 Oct 2011 |
Publication series
| Name | Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics |
|---|---|
| ISSN (Print) | 1062-922X |
Abstract
One of the main advantages of Web services is that they can be composed into more complex processes in order to achieve a given business goal. However, such potentiality cannot be fully exploited until suitable methods and techniques allowing us to enable automatic discovery of composed processes are provided. Indeed, nowadays service discovery still focuses on matching atomic services by typically checking the similarity of functional parameters, such as inputs and outputs. However, a more profitable process discovering can be reached if both internal structure and component services are taken into account. Based on this main intuition, in this paper we describe a method for discovering composite OWL-S processes that founds on the following main contributions: (i) proposing a graph-based representation of composite OWL-S processes; and (ii) introducing an algorithm that matches over such (graph-based) representations and computes their degree of matching via combining the similarity of the atomic services they comprise and the similarity of the control flow among them. Finally, as another contribution of our research, we conducted a comprehensive experimental campaign where we tested our proposed algorithm by deriving insightful trade-offs of benefits and limitations of the overall framework for discovering Semantic Web services.
Keywords
- Composite OWL-S processes, Graph matching, Web service discovery
ASJC Scopus subject areas
- Engineering(all)
- Electrical and Electronic Engineering
- Engineering(all)
- Control and Systems Engineering
- Computer Science(all)
- Human-Computer Interaction
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest. 2011. p. 608-615 6083778 (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Discovering semantic Web services via advanced graph-based matching
AU - Cuzzocrea, Alfredo
AU - Fisichella, Marco
PY - 2011
Y1 - 2011
N2 - One of the main advantages of Web services is that they can be composed into more complex processes in order to achieve a given business goal. However, such potentiality cannot be fully exploited until suitable methods and techniques allowing us to enable automatic discovery of composed processes are provided. Indeed, nowadays service discovery still focuses on matching atomic services by typically checking the similarity of functional parameters, such as inputs and outputs. However, a more profitable process discovering can be reached if both internal structure and component services are taken into account. Based on this main intuition, in this paper we describe a method for discovering composite OWL-S processes that founds on the following main contributions: (i) proposing a graph-based representation of composite OWL-S processes; and (ii) introducing an algorithm that matches over such (graph-based) representations and computes their degree of matching via combining the similarity of the atomic services they comprise and the similarity of the control flow among them. Finally, as another contribution of our research, we conducted a comprehensive experimental campaign where we tested our proposed algorithm by deriving insightful trade-offs of benefits and limitations of the overall framework for discovering Semantic Web services.
AB - One of the main advantages of Web services is that they can be composed into more complex processes in order to achieve a given business goal. However, such potentiality cannot be fully exploited until suitable methods and techniques allowing us to enable automatic discovery of composed processes are provided. Indeed, nowadays service discovery still focuses on matching atomic services by typically checking the similarity of functional parameters, such as inputs and outputs. However, a more profitable process discovering can be reached if both internal structure and component services are taken into account. Based on this main intuition, in this paper we describe a method for discovering composite OWL-S processes that founds on the following main contributions: (i) proposing a graph-based representation of composite OWL-S processes; and (ii) introducing an algorithm that matches over such (graph-based) representations and computes their degree of matching via combining the similarity of the atomic services they comprise and the similarity of the control flow among them. Finally, as another contribution of our research, we conducted a comprehensive experimental campaign where we tested our proposed algorithm by deriving insightful trade-offs of benefits and limitations of the overall framework for discovering Semantic Web services.
KW - Composite OWL-S processes
KW - Graph matching
KW - Web service discovery
UR - http://www.scopus.com/inward/record.url?scp=83755173127&partnerID=8YFLogxK
U2 - 10.1109/ICSMC.2011.6083778
DO - 10.1109/ICSMC.2011.6083778
M3 - Conference contribution
AN - SCOPUS:83755173127
SN - 9781457706523
T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
SP - 608
EP - 615
BT - 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest
T2 - 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011
Y2 - 9 October 2011 through 12 October 2011
ER -