Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
A vector space model for automatic indexing
Communications of the ACM
Web service composition with case-based reasoning
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Flexible Interface Matching for Web-Service Discovery
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Automatic web news extraction using tree edit distance
Proceedings of the 13th international conference on World Wide Web
Web service composition transaction management
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
A Flexible Payment Scheme and Its Role-Based Access Control
IEEE Transactions on Knowledge and Data Engineering
Ensuring required failure atomicity of composite Web services
WWW '05 Proceedings of the 14th international conference on World Wide Web
Web Service Discovery Based on Behavior Signatures
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 01
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate top-k structural similarity search over XML documents
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Achieving secure and flexible M-services through tickets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Improving XML schema matching performance using Prüfer sequences
Data & Knowledge Engineering
Structural and semantic aspects of similarity of Document Type Definitions and XML schemas
Information Sciences: an International Journal
WSXplorer: searching for desired web services
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
Discovering web services based on probabilistic latent factor model
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Element similarity measures in XML schema matching
Information Sciences: an International Journal
Dynamic tags for dynamic data web services
Proceedings of the 5th International Workshop on Enhanced Web Service Technologies
Combining schema and level-based matching for web service discovery
ICWE'10 Proceedings of the 10th international conference on Web engineering
Towards a framework for weaving social networks principles into web services discovery
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Semantics-based web service discovery using information retrieval techniques
INEX'10 Proceedings of the 9th international conference on Initiative for the evaluation of XML retrieval: comparative evaluation of focused retrieval
Matchmaking OWL-S processes: an approach based on path signatures
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Recommending multimedia web services in a multi-device environment
Information Systems
| Hi-index | 0.00 |
A web service is programmatically available application logic exposed over Internet. With the rapid development of e-commerce over Internet, web services have attracted much attention in recent years. Nowadays, enterprises are able to outsource their internal business processes as services and make them accessible via the Web. Then they can dynamically combine individual services to provide new value-added services. A main problem that remains is how to discover desired web services. In this paper, we propose a novel web services discovery strategy given a textual description of services. In particularly, we propose a new schema matching algorithm for supporting web-service operations matching. The matching algorithm catches not only structures, but also semantic information of schemas. We also propose a ranking strategy to satisfy a user's top-k requirements. Experimental evaluation shows that our approach can achieve high precision and recall ratio.