An Information-Theoretic Definition of Similarity
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Matchmaking for Structured Objects
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Toward High-Precision Service Retrieval
IEEE Internet Computing
Exploring Semantic Technologies in Service Matchmakin
ECOWS '05 Proceedings of the Third European Conference on Web Services
Establishing Association between QoS Properties in Service Oriented Architecture
NWESP '05 Proceedings of the International Conference on Next Generation Web Services Practices
An Ontological Approach for Personalized Services
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Developing scientific workflows from heterogeneous services
ACM SIGMOD Record
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A semantic distance measure for matching web services
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
An efficient algorithm for OWL-S based semantic search in UDDI
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Semantic Annotations and Querying of Web Data Sources
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Discovering web services and JXTA peer-to-peer services in a unified manner
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
| Hi-index | 0.00 |
As the service-oriented computing paradigm and its related technologies mature, it is expected that electronic services will continue to grow in numbers. In such a setting, the course of service discovery could yield many alternative yet heterogeneous services which, by all means, may be of different type and moreover distinguished by their quality characteristics. To come through such situations and ease the task of service selection, service search engines need to be powered by an efficient matchmaking mechanism, which will abstract requesters from service heterogeneity and provide them with the means for choosing the service that best fits their requirements, among a wide set of services with similar functionally. In this paper, we present an efficient service matchmaking algorithm, which facilitates the task of heterogeneous service selection, whilst combining and exploiting the syntactic, semantic, and Quality-of-Service (QoS) properties contained in service advertisements.