Name
Abstract | ||
|---|---|---|
In this paper we revisit the trade-off between adaptation and retrieval effort traditionally held as a principle in case-based reasoning. This principle states that the time needed for adaptation reduces with the time spent searching for an adequate case to be retrieved. In particular, if very little time is spent in retrieval, the adaptation effort will be high. Correspondingly, if the retrieval effort is high, the adaption effort is low. We analyzed this principle in two boundary conditions: (1) when very bad and (2) when highly capable adaptation procedures are used. We conclude that in the first boundary condition the adaptation-retrieval trade-off does not necessarily exist. We also claim that the second does not hold for a class of planning domains frequently used in the literature. To validate this claim, we performed experiments on two domains of this type. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02998-1_14 | ICCBR |
Keywords | Field | DocType |
capable adaptation procedure,adaption effort,boundary condition,boundary conditions,adaptation-retrieval trade-off,adaptation effort,case-based reasoning,retrieval effort,adequate case,retrieval trade-off revisited,principle state,planning,adaptation,trade offs,case base reasoning | Boundary value problem,Computer science,Operations research,Trade offs,Trade-off | Conference |
Volume | ISSN | Citations |
5650 | 0302-9743 | 4 |
PageRank | References | Authors |
0.43 | 27 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen Lee-Urban | 1 | 182 | 12.40 |
| Héctor Muñoz-Avila | 2 | 674 | 55.13 |