2010 24th IEEE International Conference on Advanced Information Networking and Applications 2010
DOI: 10.1109/aina.2010.122
|View full text |Cite
|
Sign up to set email alerts
|

YASA-M: A Semantic Web Service Matchmaker

Abstract: In this paper, we present new algorithms for matching Web services described in YASA4WSDL (YASA for short). We have already defined YASA that overcomes some issues missing in WSDL or SAWSDL. In this paper, we continue on our contribution and show how YASA Web services are matched based on the specificities of YASA descriptions. Our matching algorithm consists of three variants based on three different semantic matching degree aggregations. This algorithm was implemented in YASA-M, a new Web service matchmaker.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…Discovery methods can be logic-based, non-logic-based, or hybrid [6]. Logic-based approaches, like [12], determine the matching degree of services, operations, etc., by means of logic relationships between annotated concepts. Non-logic-based ones utilize measures like text and graph similarities.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Discovery methods can be logic-based, non-logic-based, or hybrid [6]. Logic-based approaches, like [12], determine the matching degree of services, operations, etc., by means of logic relationships between annotated concepts. Non-logic-based ones utilize measures like text and graph similarities.…”
Section: Related Workmentioning
confidence: 99%
“…As in [12], we first conduct a pre-selection of candidates, e. g., regarding the supported runtime of the component's binding and the minimal number of events, operations and properties as defined by the template. Afterwards, the semantic compatibility of each candidate to the template is checked in a multi-step procedure described in the following.…”
Section: Semantic Discovery Of Mashup Componentsmentioning
confidence: 99%
“…In other related work, Chabeb, Tata, and Ozanne () describe a new algorithm for matching web services in YASA4WSDL. The matching algorithm consists of three variants based on three different semantic matching degree aggregations.…”
Section: Related Work On Matchingmentioning
confidence: 99%
“…With regard to the semantic matching of data and functional concepts, semantic web service (SWS) discovery utilizes logic-based, e. g., [6], non-logic-based, e. g., [9], or hybrid matchings [10]. While logic-based approaches use deduction to decide if concepts are equal (exact match), part of each other (subsume) and (plug-in) or distinct (fail), non-logic-based ones rely on syntactic, structural and numerical analysis, and hybrid approaches combine both.…”
Section: Related Workmentioning
confidence: 99%