A comparative evaluation of semantic web service discovery approaches

Mohebbi, Keyvan; Ibrahim, Suhaimi; Khezrian, Mojtaba; Munusamy, Kanmani; Tabatabaei, Sayed Gholam Hassan

doi:10.1145/1967486.1967496

Cited by 23 publications

(19 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The dataset of service descriptions used in this experiment is obtained from the OWL-S service retrieval test collection called OWLS-TC v3.0 8 . The dataset consists of 1007 service descriptions defined in OWL-S form.…”

Section: Discussionmentioning

confidence: 99%

“…Logical reasoning tends to be very accurate given its solid mathematical basis [8]. These kind of approaches provide an improvement on the short-comings of syntax-based methods but come at the expense of increased complexity.…”

mentioning

confidence: 99%

“…These approaches generally use techniques such as graph matching, linguistic analysis, data mining, and information retrieval (IR) [8]. Approaches based on information retrieval techniques are very popular as these techniques require the service descriptions to be expressed in terms of vectors which make it easier to use mathematical tools to process the data.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Probabilistic Matchmaking Methods for Automated Service Discovery

Cassar

Barnaghi

Moessner

2014

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Abstract-Automated service discovery enables human users or software agents to form queries and to search and discover the services based on different requirements. This enables implementation of high-level functionalities such as service recommendation, composition, and provisioning. The current service search and discovery on the Web is mainly supported by text and keyword based solutions which offer very limited semantic expressiveness to service developers and consumers. This paper presents a method using probabilistic machine-learning techniques to extract latent factors from semantically enriched service descriptions. The latent factors are used to construct a model to represent different types of service descriptions in a vector form. With this transformation, heterogeneous service descriptions can be represented, discovered, and compared on the same homogeneous plane. The proposed solution is scalable to large service datasets and provides an efficient mechanism that enables publishing and adding new services to the registry and representing them using latent factors after deployment of the system. We have evaluated our solution against logic-based and keyword-based service search and discovery solutions. The results show that the proposed method performs better than other solutions in terms of precision and normalised discounted cumulative gain values.

show abstract

Section: Discussionmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic Matchmaking Methods for Automated Service Discovery

Cassar

Barnaghi

Moessner

2014

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…Moreover, the only discovery technique utilized by all of these tools was based on keyword-oriented search. Even though semantic discovery is not yet matured, its state-of-the-art [23] not only can contribute to streamlining mashup discovery but also can enable a higher degree of automation in mashup development.…”

Section: Discussionmentioning

confidence: 99%

An Evaluation of Mashup Tools Based on Support for Heterogeneous Mashup Components

Aghaee

Pautasso

2012

Current Trends in Web Engineering

View full text Add to dashboard Cite

Abstract. Mashups are built by combining building blocks, which are commonly referred to as mashup components. These components are characterized by a high level of heterogeneity in terms of technologies, access methods, and the behavior they may exhibit within a mashup. Abstracting away this heterogeneity is the mission of the so-called mashup tools aiming at automating or semi-automating mashup development to serve non-programmers. The challenge is to ensure this abstraction mechanism does not limit the support for heterogeneous mashup components. In this paper, we propose a novel evaluation framework that can be applied to assess the degree to which a given mashup tool addresses this challenge. The evaluation framework can serve as a benchmark for future improved design of mashup tools with respect to heterogeneous mashup components support. In order to demonstrate the applicability of the framework, we also apply it to evaluate some existing tools.

show abstract

“…Furthermore, we introduce a taxonomy for Web Service discovery systems. According to Mohebbi [2], there are three different…”

Section: Introductionmentioning

confidence: 99%