Predicting service mashup candidates using enhanced syntactical message management

M. Brian Blake, Michael F. Nowlan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

The descriptiveness of capabilities advertised on service-oriented architectures provides a promising platform for crafting new knowledge. Service mashup has been introduced as an approach for integrating the information provided from multiple web services into one common operational picture. In the future, scale will be a barrier to these types of approaches. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new mashups. In this work, we present an efficient syntactical approach for actively discovering web service candidates for service mashups. This approach leverages the message naming characteristics of the developers and of the target service repository to inform search algorithms. Favorable precision results are described based on experimentation executed on an open repository of web service from the Internet.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Conference on Services Computing, SCC 2008
Pages229-236
Number of pages8
Volume1
DOIs
StatePublished - Sep 19 2008
Externally publishedYes
Event2008 IEEE International Conference on Services Computing, SCC 2008 - Honolulu, HI, United States
Duration: Jul 7 2008Jul 11 2008

Other

Other2008 IEEE International Conference on Services Computing, SCC 2008
CountryUnited States
CityHonolulu, HI
Period7/7/087/11/08

Fingerprint

Web services
Internet
Service oriented architecture (SOA)

Keywords

  • Service mashup
  • Service-oriented computing
  • Web services

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Blake, M. B., & Nowlan, M. F. (2008). Predicting service mashup candidates using enhanced syntactical message management. In Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008 (Vol. 1, pp. 229-236). [4578468] https://doi.org/10.1109/SCC.2008.68

Predicting service mashup candidates using enhanced syntactical message management. / Blake, M. Brian; Nowlan, Michael F.

Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008. Vol. 1 2008. p. 229-236 4578468.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Blake, MB & Nowlan, MF 2008, Predicting service mashup candidates using enhanced syntactical message management. in Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008. vol. 1, 4578468, pp. 229-236, 2008 IEEE International Conference on Services Computing, SCC 2008, Honolulu, HI, United States, 7/7/08. https://doi.org/10.1109/SCC.2008.68
Blake MB, Nowlan MF. Predicting service mashup candidates using enhanced syntactical message management. In Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008. Vol. 1. 2008. p. 229-236. 4578468 https://doi.org/10.1109/SCC.2008.68
Blake, M. Brian ; Nowlan, Michael F. / Predicting service mashup candidates using enhanced syntactical message management. Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008. Vol. 1 2008. pp. 229-236
@inproceedings{a2f5c3fedca749d19c21c8dbfbf6f5b4,
title = "Predicting service mashup candidates using enhanced syntactical message management",
abstract = "The descriptiveness of capabilities advertised on service-oriented architectures provides a promising platform for crafting new knowledge. Service mashup has been introduced as an approach for integrating the information provided from multiple web services into one common operational picture. In the future, scale will be a barrier to these types of approaches. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new mashups. In this work, we present an efficient syntactical approach for actively discovering web service candidates for service mashups. This approach leverages the message naming characteristics of the developers and of the target service repository to inform search algorithms. Favorable precision results are described based on experimentation executed on an open repository of web service from the Internet.",
keywords = "Service mashup, Service-oriented computing, Web services",
author = "Blake, {M. Brian} and Nowlan, {Michael F.}",
year = "2008",
month = "9",
day = "19",
doi = "10.1109/SCC.2008.68",
language = "English",
isbn = "9780769532837",
volume = "1",
pages = "229--236",
booktitle = "Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008",

}

TY - GEN

T1 - Predicting service mashup candidates using enhanced syntactical message management

AU - Blake, M. Brian

AU - Nowlan, Michael F.

PY - 2008/9/19

Y1 - 2008/9/19

N2 - The descriptiveness of capabilities advertised on service-oriented architectures provides a promising platform for crafting new knowledge. Service mashup has been introduced as an approach for integrating the information provided from multiple web services into one common operational picture. In the future, scale will be a barrier to these types of approaches. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new mashups. In this work, we present an efficient syntactical approach for actively discovering web service candidates for service mashups. This approach leverages the message naming characteristics of the developers and of the target service repository to inform search algorithms. Favorable precision results are described based on experimentation executed on an open repository of web service from the Internet.

AB - The descriptiveness of capabilities advertised on service-oriented architectures provides a promising platform for crafting new knowledge. Service mashup has been introduced as an approach for integrating the information provided from multiple web services into one common operational picture. In the future, scale will be a barrier to these types of approaches. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new mashups. In this work, we present an efficient syntactical approach for actively discovering web service candidates for service mashups. This approach leverages the message naming characteristics of the developers and of the target service repository to inform search algorithms. Favorable precision results are described based on experimentation executed on an open repository of web service from the Internet.

KW - Service mashup

KW - Service-oriented computing

KW - Web services

UR - http://www.scopus.com/inward/record.url?scp=51749083725&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51749083725&partnerID=8YFLogxK

U2 - 10.1109/SCC.2008.68

DO - 10.1109/SCC.2008.68

M3 - Conference contribution

SN - 9780769532837

VL - 1

SP - 229

EP - 236

BT - Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008

ER -