Communications of the ACM - Special issue on parallelism
Artificial Intelligence Review - Special issue on lazy learning
Knowledge intensive exception spaces
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
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
Case Memory and Retrieval Based on the Immune System
ICCBR '95 Proceedings of the First International Conference on Case-Based Reasoning Research and Development
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
Learning Adaptation Rules from a Case-Base
EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Remembering to forget: a competence-preserving case deletion policy for case-based reasoning systems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Using introspective reasoning to refine indexing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Personalized recommendation system on massive content processing using improved MFNN
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Hi-index | 0.00 |
In this paper, we investigate two novel indexing schemes called DHS 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. DHS+PSR(II) extends D-HS by combining the matrix with an additional treelike indexing structure to facilitate solution reuse. DHS+PSR(II)'s novelty lies in its ability to improve retrieval efficiency over time by reusing previously encountered solution patterns. Its benefits include its accuracy, speed 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 technique to be of similar competency to C4.5 yet much more efficient. Its performance advantages over C4.5 are shown to be especially apparent when tested on case-bases which grow in size over time.