2012
DOI: 10.3724/sp.j.1016.2011.02381
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Web Service Query Approach Based on Concept Relaxation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…The most widely used metadata are terms from the interface signature (i.e., the "Input" section and "Output" section) and/or the textual description of a Web service's capabilities. As interface signature provides a derived and concise description of the functions offered by the Web service, a straightforward mapping approach has been to extract a set of keywords or terms from the interface signature, then the service discovery system evaluates the relevance between sets associated to service and request (Bener et al, 2009;Plebani & Pemici, 2009;Ou et al, 2011;Farrag et al, 2013;Al Ridhawi & Karmouch, 2015). For instance, Plebani & Pemici (2009) evaluated similarity among service/request interfaces by using a bipartite graph matching approach.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The most widely used metadata are terms from the interface signature (i.e., the "Input" section and "Output" section) and/or the textual description of a Web service's capabilities. As interface signature provides a derived and concise description of the functions offered by the Web service, a straightforward mapping approach has been to extract a set of keywords or terms from the interface signature, then the service discovery system evaluates the relevance between sets associated to service and request (Bener et al, 2009;Plebani & Pemici, 2009;Ou et al, 2011;Farrag et al, 2013;Al Ridhawi & Karmouch, 2015). For instance, Plebani & Pemici (2009) evaluated similarity among service/request interfaces by using a bipartite graph matching approach.…”
Section: Related Workmentioning
confidence: 99%
“…For instance, Plebani & Pemici (2009) evaluated similarity among service/request interfaces by using a bipartite graph matching approach. Ou et al (2011) proposed a method of service query that matches the concept sets of the considered I/O interfaces. The idea of concept relaxation was combined with a unidirectional bipartite graph matching approach to measure the similarity of concept sets.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation