Service mashup is the act of integrating the resulting data of two complementary software services into a common picture. Such an approach is promising with respect to the discovery of new types of knowledge. However, before service mashup routines can be executed, it is necessary to predict which services (of an open repository) are viable candidates. Similar to Knowledge Discovery in Databases (KDD), we introduce the Knowledge Discovery in Services (KDS) process that identifies mashup candidates. In this work, the KDS process is specialized to address a repository of open services that do not contain semantic annotations. In these situations, specialized techniques are required to determine equivalences among open services with reasonable precision. This paper introduces a bottom-up process for KDS that adapts to the environment of services for which it operates. Detailed experiments are discussed that evaluate KDS techniques on an open repository of services from the Internet and on a repository of services created in a controlled environment.
|Original language||English (US)|
|Number of pages||13|
|Journal||IEEE Transactions on Knowledge and Data Engineering|
|State||Published - May 5 2011|
- Interactive exploration and discovery
- knowledge management applications
- service mashup
- web-based services.
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Information Systems
- Computer Science Applications