The Experts below are selected from a list of 10857 Experts worldwide ranked by ideXlab platform
Simone A Ludwig - One of the best experts on this subject based on the ideXlab platform.
-
fuzzy Match score of Semantic service Match
2008Co-Authors: Simone A LudwigAbstract:Automatic discovery of services is a crucial task for the e-science and e-business communities. Finding a suitable way to address this issue has become one of the key points to convert the Web into a distributed source of computation, as it enables the location of distributed services to perform a required functionality. To provide such an automatic location, the discovery process should be based on the Semantic Match between a declarative description of the service being sought and a description being offered. This problem requires not only an algorithm to Match these descriptions, but also a language to declaratively express the capabilities of services. The proposed Matchmaking approach is based on Semantic descriptions for service attributes, descriptions and metadata. For the ranking of service Matches a Match score is calculated whereby the weight values are either given by the user or estimated using a fuzzy approach. An evaluation of both weight assignment approaches is conducted identifying in which scenario one works better than the other.
-
weight assignment of Semantic Match using user values and a fuzzy approach
2007Co-Authors: Simone A LudwigAbstract:Automatic discovery of services is a crucial task for the e-Science and e-Business communities. Finding a suitable way to address this issue has become one of the key points to convert the Web into a distributed source of computation, as it enables the location of distributed services to perform a required functionality. To provide such an automatic location, the discovery process should be based on the Semantic Match between a declarative description of the service being sought and a description being offered. This problem requires not only an algorithm to Match these descriptions, but also a language to declaratively express the capabilities of services. The proposed Matchmaking approach is based on Semantic descriptions for service attributes, descriptions and metadata. For the ranking of service Matches a Match score is calculated whereby the weight values are either given by the user or estimated using a fuzzy approach.
Katia P. Sycara - One of the best experts on this subject based on the ideXlab platform.
-
Semantic Matching of web services capabilities
2002Co-Authors: Massimo Paolucci, Terry R Payne, Takahiro Kawamura, Katia P. SycaraAbstract:The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web services should be based on the Semantic Match between a declarative description of the service being sought, and a description of the service being offered. Furthermore, we claim that this Match is outside the representation capabilities of registries such as UDDI and languages such as WSDL.We propose a solution based on DAML-S, a DAML-based language for service description, and we show how service capabilities are presented in the Profile section of a DAML-S description and how a Semantic Match between advertisements and requests is performed.
Bruce W Croft - One of the best experts on this subject based on the ideXlab platform.
-
iterative relevance feedback for answer passage retrieval with passage level Semantic Match
2018Co-Authors: Keping Bi, Qingyao Ai, Bruce W CroftAbstract:Relevance feedback techniques assume that users provide relevance judgments for the top k (usually 10) documents and then re-rank using a new query model based on those judgments. Even though this is effective, there has been little research recently on this topic because requiring users to provide substantial feedback on a result list is impractical in a typical web search scenario. In new environments such as voice-based search with smart home devices, however, feedback about result quality can potentially be obtained during users' interactions with the system. Since there are severe limitations on the length and number of results that can be presented in a single interaction in this environment, the focus should move from browsing result lists to iterative retrieval and from retrieving documents to retrieving answers. In this paper, we study iterative relevance feedback techniques with a focus on retrieving answer passages. We first show that iterative feedback is more effective than the top-k approach for answer retrieval. Then we propose an iterative feedback model based on passage-level Semantic Match and show that it can produce significant improvements compared to both word-based iterative feedback models and those based on term-level Semantic similarity.
-
iterative relevance feedback for answer passage retrieval with passage level Semantic Match
2018Co-Authors: Bruce W CroftAbstract:Relevance feedback techniques assume that users provide relevance judgments for the top k (usually 10) documents and then re-rank using a new query model based on those judgments. Even though this is effective, there has been little research recently on this topic because requiring users to provide substantial feedback on a result list is impractical in a typical web search scenario. In new environments such as voice-based search with smart home devices, however, feedback about result quality can potentially be obtained during users' interactions with the system. Since there are severe limitations on the length and number of results that can be presented in a single interaction in this environment, the focus should move from browsing result lists to iterative retrieval and from retrieving documents to retrieving answers. In this paper, we study iterative relevance feedback techniques with a focus on retrieving answer passages. We first show that iterative feedback is more effective than the top-k approach for answer retrieval. Then we propose an iterative feedback model based on passage-level Semantic Match and show that it can produce significant improvements compared to both word-based iterative feedback models and those based on term-level Semantic similarity.
Massimo Paolucci - One of the best experts on this subject based on the ideXlab platform.
-
Semantic Matching of web services capabilities
2002Co-Authors: Massimo Paolucci, Terry R Payne, Takahiro Kawamura, Katia P. SycaraAbstract:The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web services should be based on the Semantic Match between a declarative description of the service being sought, and a description of the service being offered. Furthermore, we claim that this Match is outside the representation capabilities of registries such as UDDI and languages such as WSDL.We propose a solution based on DAML-S, a DAML-based language for service description, and we show how service capabilities are presented in the Profile section of a DAML-S description and how a Semantic Match between advertisements and requests is performed.
Terry R Payne - One of the best experts on this subject based on the ideXlab platform.
-
Semantic Matching of web services capabilities
2002Co-Authors: Massimo Paolucci, Terry R Payne, Takahiro Kawamura, Katia P. SycaraAbstract:The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web services should be based on the Semantic Match between a declarative description of the service being sought, and a description of the service being offered. Furthermore, we claim that this Match is outside the representation capabilities of registries such as UDDI and languages such as WSDL.We propose a solution based on DAML-S, a DAML-based language for service description, and we show how service capabilities are presented in the Profile section of a DAML-S description and how a Semantic Match between advertisements and requests is performed.