Development and evaluation of a tree-indexing approach to improve case-based reasoning: Illustrated using the due date assignment problem. (English) Zbl 1161.90385
Summary: In this study a novel case indexing approach is proposed for case-based reasoning (CBR). This new approach, called the tree-indexing approach, is a modified form of the inductive learning-indexing (IL-indexing) approach and is especially applied to assist CBR in numeric prediction. The tree-indexing approach organizes the cases in the memory by inducting a tree-shaped structure, in order to improve the efficiency and effectiveness of case retrieval. The experiments, using three real world problems from the UCI repository, show that the CBR with the tree-indexing approach (T-CBR) is superior to the conventional CBR. This study also applies T-CBR for solving the due date assignment problem in a dynamic job shop environment in order to investigate whether T-CBR’s expected benefits can be observed in practice. The results of the experiments show that our proposed T-CBR can indeed more accurately predict the job due date than the other methods presently in use.
Software:
UCI-mlReferences:
| [1] | Aamodt A, AI Communications 7 pp 39– (1994) |
| [2] | Blake CL, UCI Repository of Machine Learning Databases (1998) |
| [3] | Breiman L, Classification and Regression Trees (1984) |
| [4] | Chang, P-C, Hsieh, J-C and Liao, TW. A case-based reasoning approach for due-date assignment in a wafer fabrication factory. Proceedings of the 4th International Conference on Case-Based Reasoning. pp.648–659. Berlin, Germany: Springer-Verlag. · Zbl 0982.68844 |
| [5] | DOI: 10.1023/A:1024693524603 · doi:10.1023/A:1024693524603 |
| [6] | Conway RW, J. Indust. Eng 16 pp 228– (1965) |
| [7] | DOI: 10.1080/00207547608956596 · doi:10.1080/00207547608956596 |
| [8] | Finnie, GR, Witting, GE and Desharnais, J. Estimating software development effort with case-based reasoning. Proceedings of the 2nd International Conference on Case-Based Reasoning. pp.13–22. Berlin, Germany: Springer Verlag. |
| [9] | DOI: 10.1080/00207549308956826 · doi:10.1080/00207549308956826 |
| [10] | DOI: 10.1016/S0957-4174(97)00011-0 · doi:10.1016/S0957-4174(97)00011-0 |
| [11] | DOI: 10.1016/S0957-4174(01)00036-7 · doi:10.1016/S0957-4174(01)00036-7 |
| [12] | DOI: 10.1016/S0957-4174(99)00062-7 · doi:10.1016/S0957-4174(99)00062-7 |
| [13] | Kolodner J, Case-Based Reasoning (1993) |
| [14] | Lawrence S, Resource Constrained Project Scheduling: an Experimental Investigation of Heuristics Scheduling Techniques (1984) |
| [15] | DOI: 10.1016/S0952-1976(99)00052-4 · doi:10.1016/S0952-1976(99)00052-4 |
| [16] | Lopez de Mantaras, R. 2001.Case-based Reasoning. Lecture Notes in Computer Science 2049, 127–145. Heidelberg: Springer-Verlag. · Zbl 0980.68613 |
| [17] | DOI: 10.1111/j.1540-5915.1994.tb01871.x · doi:10.1111/j.1540-5915.1994.tb01871.x |
| [18] | DOI: 10.1002/(SICI)1520-6750(199702)44:1<21::AID-NAV2>3.0.CO;2-O · Zbl 0882.90073 · doi:10.1002/(SICI)1520-6750(199702)44:1<21::AID-NAV2>3.0.CO;2-O |
| [19] | DOI: 10.1016/0272-6963(84)90005-6 · doi:10.1016/0272-6963(84)90005-6 |
| [20] | Riesbeck CK, Inside Case-Based Reasoning (1989) |
| [21] | DOI: 10.1016/S0305-0483(02)00058-0 · doi:10.1016/S0305-0483(02)00058-0 |
| [22] | DOI: 10.1016/S0957-4174(98)00063-3 · doi:10.1016/S0957-4174(98)00063-3 |
| [23] | DOI: 10.1016/S0167-9236(01)00099-9 · doi:10.1016/S0167-9236(01)00099-9 |
| [24] | Slade S, AI Magazine 12 pp 42– (1991) |
| [25] | DOI: 10.1080/00207549508904821 · Zbl 0909.90182 · doi:10.1080/00207549508904821 |
| [26] | DOI: 10.1016/0925-5273(93)90026-H · doi:10.1016/0925-5273(93)90026-H |
| [27] | DOI: 10.1080/00207549108948016 · doi:10.1080/00207549108948016 |
| [28] | DOI: 10.1017/S0269888900007098 · doi:10.1017/S0269888900007098 |
| [29] | Watson, I and Watson, H. CAIRN: a case-based document retrieval system. Proceedings of the 3rd United Kingdom Case-Based Reasoning Workshop. Edited by: Filer, N and Watson, I. University of Manchester. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
