In this paper we propose a method for aggregating ranked services. The ranked services are generated from multiple user requests for the same service domain. First, a service search for each individual request is performed and the search results are ranked based on the user\u27s personalized non-functional attributes and trade-offs. Next, the ranked lists of services are then aggregated and top-ranked services are selected for the user. The proposed rank aggregation method produces a consistent ranking after aggregation because it includes the rankings given by other lists for its decision making. We propose two algorithms to deal with both complete and incomplete ranked lists during service aggregation. We also present examples with real-w...
Web service composition allows users to create value-added composite Web services on existent servic...
We study the problem of learning to accurately rank a set of objects by combining a given collection...
Rank aggregation has recently been proposed as a useful abstraction that has several applications, i...
As the web is increasingly used not only to find answers to specific information needs but also to c...
Rank aggregation mechanisms have been used in solving problems from various domains such as bioinfor...
Traditional techniques for web service discovery mostly rely on string matching and/or semantic logi...
This paper is to investigate rank aggregation based on multiple user-centered measures in the contex...
Abstract—As the Web is increasingly used not only to find answers to specific information needs but ...
The research on personalized recommendation of Web services plays an important role in the field of ...
Web service composition lets users create value-added composite Web services on existent services, w...
We consider the problem of finding the set of rankings that best represents a given group of orderin...
The aim of this paper is, in accordance with efficient web search service operation objectives, to p...
Selecting quality services over the Internet is tedious because it requires looking up of potential ...
In order for service users to get the best service that meets their requirements, they prefer to per...
Currently, commercial search engines have implemented methods to suggest alternative Web queries to ...
Web service composition allows users to create value-added composite Web services on existent servic...
We study the problem of learning to accurately rank a set of objects by combining a given collection...
Rank aggregation has recently been proposed as a useful abstraction that has several applications, i...
As the web is increasingly used not only to find answers to specific information needs but also to c...
Rank aggregation mechanisms have been used in solving problems from various domains such as bioinfor...
Traditional techniques for web service discovery mostly rely on string matching and/or semantic logi...
This paper is to investigate rank aggregation based on multiple user-centered measures in the contex...
Abstract—As the Web is increasingly used not only to find answers to specific information needs but ...
The research on personalized recommendation of Web services plays an important role in the field of ...
Web service composition lets users create value-added composite Web services on existent services, w...
We consider the problem of finding the set of rankings that best represents a given group of orderin...
The aim of this paper is, in accordance with efficient web search service operation objectives, to p...
Selecting quality services over the Internet is tedious because it requires looking up of potential ...
In order for service users to get the best service that meets their requirements, they prefer to per...
Currently, commercial search engines have implemented methods to suggest alternative Web queries to ...
Web service composition allows users to create value-added composite Web services on existent servic...
We study the problem of learning to accurately rank a set of objects by combining a given collection...
Rank aggregation has recently been proposed as a useful abstraction that has several applications, i...