Sustainable case learning for continuous domains
✍ Scribed by Miquel Sànchez-Marrè; Ulises Cortés; Ignasi R. Roda; Manel Poch
- Book ID
- 104408477
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 331 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1364-8152
No coin nor oath required. For personal study only.
✦ Synopsis
Case-based reasoning (CBR) provides an adequate framework to cope with continuous domains, where a great amount of new valuable experiences are generated in a non-stop way. CBR systems become more competent in their evolution over time by means of learning new relevant experiences. There are two central problems derived from the continuous nature of some domains: the fast growing size of the case library and the overhead in the case library organisation. Our proposal to overcome these two problems is to learn only relevant cases, and to establish a lazy learning algorithm for storing cases in the case library. A relevance measure based on L'Eixample distance, and a related ontology of cases are defined, and the lazy learning algorithm is described. Finally, experimental tests on real data are presented and discussed.
📜 SIMILAR VOLUMES
This paper reports on experiments where techniques of supervised machine learning are applied to the problem of planning. The input to the learning algorithm is composed of a description of a planning domain, planning problems in this domain, and solutions for them. The output is an efficient algori