Computational geometry: an introduction
Computational geometry: an introduction
Analyses of multiple evidence combination
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Modern Information Retrieval
Condorcet fusion for improved retrieval
Proceedings of the eleventh international conference on Information and knowledge management
Fusion Via a Linear Combination of Scores
Information Retrieval
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
ProbFuse: a probabilistic approach to data fusion
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Discovering Semantic Web Services with and without a Common Ontology Commitment
SCW '06 Proceedings of the IEEE Services Computing Workshops
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
ECOWS '06 Proceedings of the European Conference on Web Services
An outranking approach for rank aggregation in information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approaching the skyline in Z order
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Damia: data mashups for intranet applications
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Eliciting matters: controlling skyline sizes by incremental integration of user preferences
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
CLEF 2005: multilingual retrieval by combining multiple multilingual ranked lists
CLEF'05 Proceedings of the 6th international conference on Cross-Language Evalution Forum: accessing Multilingual Information Repositories
Exploiting User Feedback to Improve Semantic Web Service Discovery
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Continuous Processing of Preference Queries in Data Streams
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Top-k service compositions: a fuzzy set-based approach
Proceedings of the 2011 ACM Symposium on Applied Computing
Efficiently evaluating skyline queries on RDF databases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
A fuzzy framework for selecting top-k web service compositions
ACM SIGAPP Applied Computing Review
Progressive processing of subspace dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Combining uncorrelated similarity measures for service discovery
RED'10 Proceedings of the Third international conference on Resource Discovery
Scatter/Gather browsing of web service QoS data
Future Generation Computer Systems
A survey of fuzzy service matching approaches in the context of on-the-fly computing
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
User-centered design of a QoS-based web service selection system
Service Oriented Computing and Applications
Probabilistic top-K dominating services composition with uncertain QoS
Service Oriented Computing and Applications
Hi-index | 0.00 |
As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieval and selection becomes an important issue. Traditionally, the relevance of a Web service advertisement to a service request is determined by computing an overall score that aggregates individual matching scores among the various parameters in their descriptions. Two drawbacks characterize such approaches. First, there is no single matching criterion that is optimal for determining the similarity between parameters. Instead, there are numerous approaches ranging from using Information Retrieval similarity metrics up to semantic logic-based inference rules. Second, the reduction of individual scores to an overall similarity leads to significant information loss. Since there is no consensus on how to weight these scores, existing methods are typically pessimistic, adopting a worst-case scenario. As a consequence, several services, e.g., those having a single unrelated parameter, can be excluded from the result set, even though they are potentially good alternatives. In this work, we present a methodology that overcomes both deficiencies. Given a request, we introduce an objective measure that assigns a dominance score to each advertised Web service. This score takes into consideration all the available criteria for each parameter in the request. We investigate three distinct definitions of dominance score, and we devise efficient algorithms that retrieve the top-k most dominant Web services in each case. Extensive experimental evaluation on real requests and relevance sets, as well as on synthetically generated scenarios, demonstrates both the effectiveness of the proposed technique and the efficiency of the algorithms.