Characterisation of a Novel Indexing Technique for Case-Based Reasoning

Authors:
David W. Patterson;Mykola Galushka;Niall Rooney
Affiliations:
Northern Ireland Knowledge Engineering Laboratory, School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, Northern Ireland BT37 0QB;Northern Ireland Knowledge Engineering Laboratory, School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, Northern Ireland BT37 0QB;Northern Ireland Knowledge Engineering Laboratory, School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, Northern Ireland BT37 0QB
Venue:
Artificial Intelligence Review
Year:
2005

Citing 16
Cited 2

Toward memory-based reasoning

Communications of the ACM - Special issue on parallelism
C4.5: programs for machine learning

C4.5: programs for machine learning
A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features

Machine Learning
A Review and Empirical Evaluation of Feature Weighting Methods for aClass of Lazy Learning Algorithms

Artificial Intelligence Review - Special issue on lazy learning
A Simple Algorithm for Nearest Neighbor Search in High Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Knowledge intensive exception spaces

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Data mining: practical machine learning tools and techniques with Java implementations

Data mining: practical machine learning tools and techniques with Java implementations
Conversational Case-Based Reasoning

Applied Intelligence
Using k-d Trees to Improve the Retrieval Step in Case-Based Reasoning

EWCBR '93 Selected papers from the First European Workshop on Topics in Case-Based Reasoning
Applying Case Retrieval Nets to Diagnostic Tasks in Technical Domains

EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Dynamically Creating Indices for Two Million Cases: A Real World Problem

EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
The Utility Problem Analysed: A Case-Based Reasoning Perspective

EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Efficient Similarity Determination and Case Construction Techniques for Case-Based Reasoning

ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
Refining Conversational Case Libraries

ICCBR '97 Proceedings of the Second International Conference on Case-Based Reasoning Research and Development
Towards Dynamic Maintenance of Retrieval Knowledge in CBR

Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
Using introspective reasoning to refine indexing

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Incorporating temporal-bounded CBR techniques in real-time agents

Expert Systems with Applications: An International Journal
Towards real-time agreements

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate two novel indexing schemes called D-HS and D-HS+PSR(II) designed for use in case-based reasoning systems. D-HS is based on a matrix of cases indexed by their discretised attribute values. D-HS+PSR(II) extends D-HS by combining the matrix with an additional tree-like indexing structure to allow for solution reuse. D-HS+PSR(II)'s novelty lies in its ability to improve retrieval efficiency over time by reusing previously encountered solution patterns. Benefits include simplicity, accuracy, speed, robustness to missing values and ability to facilitate efficient real time maintenance of retrieval knowledge as the size of the case-base grows. We present empirical results from an analyses of 20 case-bases and demonstrate the techniques to be of similar competency to C4.5 yet much more efficient. Performance advantages over C4.5 are shown to be especially apparent when tested on case-bases which grow in size over time or those with missing values.