Flexible Interface Matching for Web-Service Discovery
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Web services discovery based on schema matching
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
LCS-TRIM: dynamic programming meets XML indexing and querying
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Web Service Discovery with additional Semantics and Clustering
WI '07 Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence
Efficiently finding web services using a clustering semantic approach
Proceedings of the 2008 international workshop on Context enabled source and service selection, integration and adaptation: organized with the 17th International World Wide Web Conference (WWW 2008)
Improving Web Service Discovery by Using Semantic Models
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Improving XML schema matching performance using Prüfer sequences
Data & Knowledge Engineering
Using software product lines for runtime interoperability
Proceedings of the Workshop on AOP and Meta-Data for Software Evolution
Massively Scalable Web Service Discovery
AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications
Managing uncertainty in schema matching with top-k schema mappings
Journal on Data Semantics VI
Hi-index | 0.00 |
Due to the availability of huge number ofWeb services (WSs), finding an appropriate WS according to the requirement of a service consumer is still a challenge. In this paper, we present a new and flexible approach, called SeqDisc, that assesses the similarity between WSs. In particular, the approach exploits the Prüfer encoding method to represent WSs as sequences capturing both semantic and structure information of service descriptions. Based on the sequence representation, we develop an efficient sequence-based schema matching approach to measure the similarity between WSs. A set of experiments is conducted on real data sets, and the results confirm the performance of the proposed solution.