CBR

## Toward a Knowledge Transfer Model of Case-Based Inference

Conference Paper

### Autores:

Santiago Ontañón; Enric Plaza

### Origen:

Twenty-Fifth International Florida Artificial Intelligence Research Society Conference, AAAI Press, Marco Island, Florida USA, p.341-346 (2012)

### ISBN:

ISBN 978-1-57735-558-8

### Palabras clave:

CBR; analogy; amalgam

### Resumen:

While similarity and retrieval in case-based reasoning (CBR) have received a lot of attention in the literature, other aspects of CBR, such as case reuse are less un- derstood. Specifically, we focus on one of such, less understood, problems: knowledge transfer. The issue we intend to elucidate can be expressed as follows: what knowledge present in a source case is transferred to a target problem in case-based inference? This pa- per presents a preliminary formal model of knowledge transfer and relates it to the classical notion of analogy.

## Classification of Melanomas in situ using Knowledge Discovery with Explained CBR

Journal Article

Eva Armengol

### Origen:

Artificial Intelligence in Medicine, Volumen51, p.12 (2011)

### Palabras clave:

knowledge discovery; classification; clustering; CBR; application

### Resumen:

The goal of Knowledge Discovery is to extract knowledge from a set of data. Most common techniques used in knowledge discovery are based on clustering methods whose goal is to analyze a set of objects and to obtain clusters based on the similarity between these objects. A desirable characteristic of clustering results is that they should be easily understandable by domain experts. In this paper we introduce LazyCL, a procedure using a lazy learning method to produce explanations on clusters of unlabeled cases. These explanations are the basis on which experts can perform knowledge discovery. Here we use LazyCL to generate a domain theory for classification of melanomas in situ.

## Measuring Similarity in Description Logics using Refinement Operators

Conference Paper

### Origen:

Case-Based Reasoning Research and Development: 19th International Conference on Case-Based Reasoning (ICCBR'11), Volumen6880, p.289 - 303 (2011)

### Palabras clave:

CBR; Similarity; Description Logics; Refinement Graph

### Resumen:

Similarity assessment is a key operation in many artificial intelligence fields, such as case-based reasoning, instance-based learning, ontology matching, clustering, etc. This paper presents a novel measure for assessing similarity between individuals represented using Description Logic (DL). We will show how the ideas of {\em refinement operators} and {\em refinement graph}, originally introduced for inductive logic programming, can be used for assessing similarity in DL and also for abstracting away from the specific DL being used. Specifically, similarity of two individuals is assessed by first computing their {\em most specific concepts}, then the {\em least common subsumer} of these two concepts, and finally measuring their distances in the refinement graph

PDFFile:

## A Case-based Approach to Open-Ended Collective Agreement with Rational Ignorance

Conference Paper

### Autores:

Sergio Manzano; Santiago Ontañón; Enric Plaza

### Origen:

Case-Based Reasoning Research and Development: 19th International Conference on Case-Based Reasoning (ICCBR'11), Volumen6880, p.107 - 121 (2011)

### Palabras clave:

CBR; Rational Ignorance; Social choice; Deliberation

### Resumen:

In this paper we focus on how to use CBR for making collective decisions in groups of agents. Moreover, we show that using CBR allows us to dispense with standard but unrealistic assumptions taken in these kind of tasks. Typically, social choice studies voting methods but assumes complete knowledge over all possible alternatives. We present a more general scenario called {\em open-ended deliberative agreement with rational ignorance (ODARI)}, and show how can CBR be used to deal with rational ignorance. We will apply this approach to the {\em Banquet Agreement} scenario, where two agents deliberate and jointly agree on a two course meal. Rational ignorance makes sense in this scenario, since it would be unreasonable for the agents to know all the alternatives. Unknown alternatives, as well as a strategy to increase chances of reaching an agreement, are problems addressed using case-based methods

PDFFile:

## Amalgam-based Reuse for Multiagent Case-based Reasoning

Conference Paper

### Autores:

Sergio Manzano; Santiago Ontañón; Enric Plaza

### Origen:

Case-Based Reasoning Research and Development: 19th International Conference on Case-Based Reasoning (ICCBR'11), Springer, Volumen6880, p.122 - 136 (2011)

### Palabras clave:

Amalgam; CBR; Reuse

### Resumen:

Different agents in a multiagent system might have different solution quality or preference criteria. Therefore, when solving problems collaboratively using CBR, case reuse must take this into account. In this paper we propose \abarc , a model for multiagent case reuse, which divides case reuse in two stages: {\em individual reuse}, where agents generate full solutions internally, and {\em multiagent reuse}, where agents engage in a deliberation process in order to reach an agreement on a final solution. Specifically, \abarc\ is based on the idea of {\em amalgam}, which is a way to generate solutions by combining multiple solutions into one. We illustrate \abarc\ in the domain of interior room design

PDFFile:

## Similarity Measures over Refinement Graphs

Journal Article

### Autores:

Santiago Ontañón; Enric Plaza

### Origen:

Machine Learning, Volumen87, Ejemplar1, p.57-92 (2012)

### Palabras clave:

CBR; Similarity; Machine Learning; Feature Terms

### Resumen:

Similarity assessment plays a key role in lazy learning methods such as k-nearest neighbor or case-based reasoning. In this paper we will show how refinement graphs, that were originally introduced for inductive learning, can be employed to assess and reason about similarity. We will define and analyze two similarity measures, $S_{\lambda}$ and $S_{\pi}$, based on refinement graphs. The \emph{anti-unification-based similarity}, $S_{\lambda}$, assesses similarity by finding the anti-unification of two instances, which is a description capturing all the information common to these two instances. The \emph{property-based similarity}, $S_{\pi}$, is based on a process of disintegrating the instances into a set of {\em properties}, and then analyzing these property sets.
Moreover these similarity measures are applicable to any representation language for which a refinement graph that satisfies the requirements we identify can be defined. Specifically, we present a refinement graph for feature terms, in which several languages of increasing expressiveness can be defined. The similarity measures are empirically evaluated on relational data sets belonging to languages of different expressiveness.

## Using Experience to Generate New Regulations

### Tipo de Publicación:

Conference Proceedings

### Autores:

Javier Morales; Maite López-Sánchez; Marc Esteva

### Origen:

International Joint Conference in Artificial Intelligence (IJCAI), AAAI Press, USA, Barcelona, Spain, p.307-312 (2011)

### ISBN:

978-1-57735-512-0

### Resumen:

Humans have developed jurisprudence as a mechanism to solve conflictive situations by using past experiences. Following this principle, we propose an approach to enhance a multi-agent system by adding an authority which is able to generate new
regulations whenever conflicts arise. Regulations are generated by learning from previous similar situations, using a machine learning technique (based on Case-Based Reasoning) that solves new problems using previous experiences. This approach requires: to be able to gather and evaluate experiences; and to be described in such a way that similar social situations require similar regulations. As a scenario to evaluate our proposal, we use a simplified version of a traffic scenario, where agents are traveling cars. Our goals are to avoid collisions
between cars and to avoid heavy traffic. These situations, when happen, lead to the synthesis of new regulations. At each simulation step, applicable regulations are evaluated in terms of their effectiveness and necessity. Overtime the system generates a set of regulations that, if followed, improve system performance (i.e. goal achievement).

## A Framework for Multi Player Robot Games

Conference Paper

### Autores:

Søren Tranberg; Santiago Ontañón; Ashwin Ram

### Origen:

International Conference in Social Robotics (ICSR 2010), p.131 - 140 (2010)

CBR; Robotics

## A Case-Based Reasoning approach for Norm adaptation

Conference Paper

### Autores:

Jordi Campos; Maite López-Sánchez; Marc Esteva

### Origen:

5th International Conference on Hybrid Artificial Intelligence Systems (HAIS'10), Springer, Volumen6077, San Sebastian, Spain, p.168-176 (2010)

### ISBN:

978-3-642-13802-7

### Resumen:

Existing organisational centred multi-agent systems regulate agents’ activities. However, population/environmental changes may lead to a poor fulfilment of system’s goals, and therefore, adapting the whole organisation becomes key. In this paper, we propose to use Case-Based Reasoning learning to adapt norms that regulate agents’ behaviour.Moreover,
we empirically evaluate this approach in a P2P scenario.

## Using Transfer Learning to Speed-Up Reinforcement Learning: A Case-Based Approach

Conference Paper

### Origen:

IEEE Latin American Robotics Symposium and Intelligent Robotics Meeting, IEEE, Brasil, p.55-60 (2010)