Combining and choosing case base maintenance algorithms
| dc.check.embargoformat | Not applicable | en |
| dc.check.info | No embargo required | en |
| dc.check.opt-out | Not applicable | en |
| dc.check.reason | No embargo required | en |
| dc.check.type | No Embargo Required | |
| dc.contributor.advisor | Bridge, Derek G. | en |
| dc.contributor.author | Cummins, Lisa | |
| dc.contributor.funder | Science Foundation Ireland | en |
| dc.date.accessioned | 2013-07-02T11:33:27Z | |
| dc.date.available | 2013-07-02T11:33:27Z | |
| dc.date.issued | 2013 | |
| dc.date.submitted | 2013 | |
| dc.description.abstract | Case-Based Reasoning (CBR) uses past experiences to solve new problems. The quality of the past experiences, which are stored as cases in a case base, is a big factor in the performance of a CBR system. The system's competence may be improved by adding problems to the case base after they have been solved and their solutions verified to be correct. However, from time to time, the case base may have to be refined to reduce redundancy and to get rid of any noisy cases that may have been introduced. Many case base maintenance algorithms have been developed to delete noisy and redundant cases. However, different algorithms work well in different situations and it may be difficult for a knowledge engineer to know which one is the best to use for a particular case base. In this thesis, we investigate ways to combine algorithms to produce better deletion decisions than the decisions made by individual algorithms, and ways to choose which algorithm is best for a given case base at a given time. We analyse five of the most commonly-used maintenance algorithms in detail and show how the different algorithms perform better on different datasets. This motivates us to develop a new approach: maintenance by a committee of experts (MACE). MACE allows us to combine maintenance algorithms to produce a composite algorithm which exploits the merits of each of the algorithms that it contains. By combining different algorithms in different ways we can also define algorithms that have different trade-offs between accuracy and deletion. While MACE allows us to define an infinite number of new composite algorithms, we still face the problem of choosing which algorithm to use. To make this choice, we need to be able to identify properties of a case base that are predictive of which maintenance algorithm is best. We examine a number of measures of dataset complexity for this purpose. These provide a numerical way to describe a case base at a given time. We use the numerical description to develop a meta-case-based classification system. This system uses previous experience about which maintenance algorithm was best to use for other case bases to predict which algorithm to use for a new case base. Finally, we give the knowledge engineer more control over the deletion process by creating incremental versions of the maintenance algorithms. These incremental algorithms suggest one case at a time for deletion rather than a group of cases, which allows the knowledge engineer to decide whether or not each case in turn should be deleted or kept. We also develop incremental versions of the complexity measures, allowing us to create an incremental version of our meta-case-based classification system. Since the case base changes after each deletion, the best algorithm to use may also change. The incremental system allows us to choose which algorithm is the best to use at each point in the deletion process. | en |
| dc.description.status | Not peer reviewed | en |
| dc.description.version | Accepted Version | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Cummins, L. 2013. Combining and choosing case base maintenance algorithms. PhD Thesis, University College Cork. | en |
| dc.identifier.endpage | 109 | |
| dc.identifier.uri | https://hdl.handle.net/10468/1154 | |
| dc.language.iso | en | en |
| dc.publisher | University College Cork | en |
| dc.rights | © 2013, Lisa Cummins. | en |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | en |
| dc.subject | Case based reasoning | en |
| dc.subject | Case base maintenance | en |
| dc.subject.lcsh | Artificial intelligence | en |
| dc.thesis.opt-out | false | * |
| dc.title | Combining and choosing case base maintenance algorithms | en |
| dc.type | Doctoral thesis | en |
| dc.type.qualificationlevel | Doctoral | en |
| dc.type.qualificationname | PhD (Science) | en |
| ucc.workflow.supervisor | cora@ucc.ie | * |
Files
Original bundle
1 - 3 of 3
Loading...
- Name:
- Lisa_Cummins_PhD_Thesis.pdf
- Size:
- 1.52 MB
- Format:
- Adobe Portable Document Format
- Description:
- E-thesis
Loading...
- Name:
- LicenceCumminsL.pdf
- Size:
- 194.56 KB
- Format:
- Adobe Portable Document Format
- Description:
- Scanned License
Loading...
- Name:
- Lisa_Cummins_PhD_Thesis_Abstract.pdf
- Size:
- 35.35 KB
- Format:
- Adobe Portable Document Format
- Description:
- Abstract
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 5.62 KB
- Format:
- Item-specific license agreed upon to submission
- Description: