๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Retrieval and Reasoning in Distributed Case Bases1

โœ Scribed by M.V.Nagendra Prasad2; Victor R. Lesser3; Susan E. Lander3


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
336 KB
Volume
7
Category
Article
ISSN
1047-3203

No coin nor oath required. For personal study only.

โœฆ Synopsis


from different repositories or digital libraries. In this paper, we deal with a different model of response to a

The proliferation of electronically available networked information has led researchers to examine the issues involved in query. No single source of information may contain the developing automated methods for gathering information in complete response to a query; this may necessitate piecing response to a query from a user. However, most of this literature together mutually related partial responses from disparate deals with locating, gathering, and selecting the best response and possibly heterogeneous sources [24]. For example, to a query from among a multitude of responses from different consider a multiagent parametric mechanical design sysrepositories or digital libraries. This paper deals with a different tem where each agent has to contribute a component model of response to a query, involving composition of mutually to assemble a complete design. An agent has to obtain related partial responses spread across a network of information its components from manufacturer-specified catalog case repositories. We present a system for cooperative retrieval and bases that may be distributed across the Internet. For composition of a case in which subcases are distributed across example, it may treat WWW-accessible distributed comdifferent agents in a multiagent system. From a Gestalt perspective, a good overall case may not be the one derived from the ponent library like PARTNET [5, 25] as its case base summation of best subcases. Each agent's local view may result from which to draw its components. In addition to the in best local cases, which when assembled may not result in constraints arising from the overall design requirements, the best overall case in terms of global measures. We propose constraints on a component also arise from the specificaa negotiation-driven case retrieval algorithm as an approach tions of other components in the design. A response to a to dynamically resolving inconsistencies between different case query in the form of a specification of design requirements pieces during the retrieval process.


๐Ÿ“œ SIMILAR VOLUMES


Introducing attribute risk for retrieval
โœ Juan L. Castro; Maria Navarro; Josรฉ M. Sรกnchez; Josรฉ M. Zurita ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB

One of the major assumptions in case-based reasoning is that similar experiences can guide future reasoning, problem solving and learning. This assumption shows the importance of the method used for choosing the most suitable case, especially when dealing with the class of problems in which risk, is

Similarity and metrics in case-based rea
โœ Gavin Finnie; Zhaohao Sun ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 107 KB

Similarity is a core concept in case-based reasoning (CBR), because case base building, case retrieval, and even case adaptation all use similarity or similarity-based reasoning. However, there is some confusion using similarity, similarity measures, and similarity metrics in CBR, in particular in d

Fuzzy set modelling in case-based reason
โœ Didier Dubois; Henri Prade; Francesc Esteva; Pere Garcia; Lluรญs Godo; Ramon Lรณpe ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 224 KB ๐Ÿ‘ 2 views

This paper is an attempt at providing a fuzzy set formalization of case-based reasoning and decision. Learning aspects are not considered here. The proposed approach assumes a principle stating that ''the more similar are the problem description attributes, the more similar are the outcome attribute