EuroWordNet: a multilingual database with lexical semantic networks
EuroWordNet: a multilingual database with lexical semantic networks
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Semantic E-Workflow Composition
Journal of Intelligent Information Systems
Composing Web services on the Semantic Web
The VLDB Journal — The International Journal on Very Large Data Bases
Toward High-Precision Service Retrieval
IEEE Internet Computing
A Peer-to-Peer Approach to Web Service Discovery
World Wide Web
A Multilevel Composability Model for Semantic Web Services
IEEE Transactions on Knowledge and Data Engineering
Automatic ontology matching using application semantics
AI Magazine - Special issue on semantic integration
Searching Service Repositories by Combining Semantic and Ontological Matching
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Web Service Discovery Based on Behavior Signatures
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 01
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
Proceedings of the 2006 ACM symposium on Applied computing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Automatically grounding semantically-enriched conceptual models to concrete web services
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
A Domain Engineering Approach for Situational Method Engineering
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Generating and Optimizing Graphical User Interfaces for Semantic Service Compositions
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Aggregated search of data and services
Information Systems
Web Semantics: Science, Services and Agents on the World Wide Web
Recommendation-based editor for business process modeling
Data & Knowledge Engineering
Facilitating enterprise service discovery for non-technical business users
ICSOC'10 Proceedings of the 2010 international conference on Service-oriented computing
Minersoft: Software retrieval in grid and cloud computing infrastructures
ACM Transactions on Internet Technology (TOIT)
Content based service discovery in semantic web services using wordnet
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Adaptive Hybrid Semantic Selection of SAWSDL Services with SAWSDL-MX2
International Journal on Semantic Web & Information Systems
Hi-index | 0.00 |
Web service discovery is one of the main applications of semantic Web services, which extend standard Web services with semantic annotations. Current discovery solutions were developed in the context of automatic service composition. Thus, the “client” of the discovery procedure is an automated computer program rather than a human, with little, if any, tolerance to inexact results. However, in the real world, services which might be semantically distanced from each other are glued together using manual coding. In this article, we propose a new retrieval model for semantic Web services, with the objective of simplifying service discovery for human users. The model relies on simple and extensible keyword-based query language and enables efficient retrieval of approximate results, including approximate service compositions. Since representing all possible compositions and all approximate concept references can result in an exponentially-sized index, we investigate clustering methods to provide a scalable mechanism for service indexing. Results of experiments, designed to evaluate our indexing and query methods, show that satisfactory approximate search is feasible with efficient processing time.