CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Discovering Substitutable and Composable Semantic Web Services for Web Service Composition

by A.bhuvaneswari, G.r.karpagam
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 8
Year of Publication: 2012
Authors: A.bhuvaneswari, G.r.karpagam
10.5120/7365-9988

A.bhuvaneswari, G.r.karpagam . Discovering Substitutable and Composable Semantic Web Services for Web Service Composition. International Journal of Computer Applications. 48, 8 ( June 2012), 1-8. DOI=10.5120/7365-9988

@article{ 10.5120/7365-9988,
author = { A.bhuvaneswari, G.r.karpagam },
title = { Discovering Substitutable and Composable Semantic Web Services for Web Service Composition },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 8 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number8/7365-9988/ },
doi = { 10.5120/7365-9988 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:43:31.460512+05:30
%A A.bhuvaneswari
%A G.r.karpagam
%T Discovering Substitutable and Composable Semantic Web Services for Web Service Composition
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 8
%P 1-8
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Semantic Web Service Discovery is an indispensable part of Web Service Composition which is expected to (i) match the user request against multiple service advertisements and (ii) provide a set of Substitutable and Composable services by maintaining the relationship among services. This paper employs Indirect Backward Chaining Matchmaking approach to match against multiple advertisements and utilizes hash tables to maintain the relationship among services. The experimentation is done with the online product purchase scenario and the results are shown by considering (i) Input and Output only, (ii) Input, Output, Precondition and Effect and (iii) Data type of the input and output concepts. The quantitative evaluation is carried out based on the information retrieval measures recall, precision and F-measure.

References
  1. Umesh Bellur, Harin Vadodaria, Amit Gupta. 2008. Semantic Matchmaking Algorithms, In Witold Bednorz(Ed. ), Greedy Algorithms, pp. 586, I-Tech, Vienna, Austria, InTech Publisher.
  2. Vassileios Tsetsos, Christos Anagnostopoulos, and Stathes Hadjiefthymiades, 2007. Semantic Web Service Discovery: Methods, Algorithms and Tools, In Dr. Jorge Cardoso(Ed. ), Semantic Web: Theory, Tools and Applications, Ch. XI pp. 240-280, IGI Global, IDEA Group Publishing.
  3. Massimo Paolucci, Takahiro Kawamura, Terry R. Payne, and Katia P. Sycara. 2002. Semantic Matching of Web Services Capabilities. In Proceedings of the First International Semantic Web Conference on The Semantic Web (ISWC '02), Springer-Verlag, London, UK, UK, 333-347.
  4. Hui Peng, Zhongzhi Shi, Liang Chang, and Wenjia Niu. 2008. Improving Grade Match to Value Match for Semantic Web Service Discovery. In Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 05, Vol. 5. IEEE Computer Society, Washington, DC, USA, 232-236.
  5. Shudong, Zhang. Naiming, Yao. Ye, Qin. 2010. "A Refined Service Relationships Graph Generation Algorithm for Web Service Composition", In Proceeding of Asia Conference on Informatics in Control, Automation, and Robotics, Vol. 3, pp. 196-199.
  6. Abrehet, M. , Omer, Alexander Schill, 2009. "Dependency Based Automatic Service Composition using Directed Graph", Fifth International Conference on Next Generation Web Services Practices, nwesp, Prague, Czech republic, Sep 9 – 11, pp. 76-81.
  7. Antonio Brogi, Sara Corfini, Razvan Popescu, Composition Oriented Service Discovery, 2005, In Proceedings of the 4th international conference on Software Composition (SC'05), Springer-Verlag, Berlin, Heidelberg, pp. 15-30.
  8. Brahim Medjahed, Athman Bouguettaya, and Ahmed K. Elmagarmid. 2003. Composing Web services on the Semantic Web. The VLDB Journal, Vol. 12, No. 4 (November 2003), 333-351.
  9. Michael D. Ernst, Raimondas Lencevicius. 2006. "Detection of Web Service Substitutability and Composability", Int. workshop on web services modeling and Testing, pp. 123-135.
  10. Joonho, Kwon. Daewook, Lee. 2012. "Non-redundant Web Services Composition based on a Two-phase algorithm", International Journal of Data and Knowledge Engineering, Vol. 71, No. 1, pp. 69-91.
  11. precision is the fraction of retrieved instances that are relevant, while recall is the fraction of relevant instances that are retrieved available at http://en. wikipedia. org/wiki/Precision_and_recall.
Index Terms

Computer Science
Information Sciences

Keywords

Semantic Matchmaking Indirect Backward Chaining Substitutability Composability Recall Precision

Powered by PhDFocusTM