k-Nearest Neighbour is a popular case retrieval technique in Case-Based Reasoning. It has the disadvantage that its accuracy depends strongly on the weights assigned to the case features. This problem can be addressed by using Introspective Learning to discover appropriate values for feature weights. The basic idea with Introspective Learning (IL) is to examine cases that are similar in order to discover which features are important and which are not. The only problem with this idea is that there are a myriad of ways in which weights can be updated based on this kind of analysis. There are several different cues that can trigger a weight change; there are several ways in which the weights can be changed and there is the added complication that weights can be global or local. In this paper we report some analysis of IL in a CBR system for conflict resolution in Air Traffic Control. We show that local weights are best in this particular domain and we show which update cues are most effective. We also show that overfitting can be a problem with IL and we discuss how it can be avoided.
[1]
Hector Muñoz-Avila,et al.
Feature Weighting by Explaining Case-Based Planning Episodes
,
1996,
EWCBR.
[2]
David B. Leake,et al.
Using Introspective Reasoning to Refine Indexing
,
1995,
IJCAI.
[3]
Padraig Cunningham,et al.
Using Introspective Learning to Improve Retrieval in CBR: A Case Study in Air Traffic Control
,
1997,
ICCBR.
[4]
Lars Kai Hansen,et al.
Early stop criterion from the bootstrap ensemble
,
1997,
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[5]
David W. Aha,et al.
Weighting Features
,
1995,
ICCBR.
[6]
Francesco Ricci,et al.
Learning a Local Similarity Metric for Case-Based Reasoning
,
1995,
ICCBR.