Matching case history patterns in case-based reasoning
Tools
Tools
Zhao, Guoxing, Luo, Bin and Ma, Jixin (2006) Matching case history patterns in case-based reasoning. In: Intelligent computing in signal processing and pattern recognition: International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Lecture notes in control and information sciences, 345 (345). Springer Verlag, Berlin, pp. 312-321. ISBN 9783540372578 ISSN 0170-8643
Full text not available from this repository.Abstract
This paper introduces a mechanism for representing and recognizing case history patterns with rich internal temporal aspects. A case history is characterized as a collection of elemental cases as in conventional case-based reasoning systems, together with the corresponding temporal constraints that can be relative and/or with absolute values. A graphical representation for case histories is proposed as a directed, partially weighted and labeled simple graph. In terms of such a graphical representation, an eigen-decomposition graph matching algorithm is proposed for recognizing case history patterns.
| Item Type: | Book Section |
|---|---|
| Additional Information: | This research is supported in part by National Nature Science Foundation of China (No.60375010). Paper presented at International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. |
| Uncontrolled Keywords: | case history patterns, case-based reasoning systems |
| Subjects: | Q Science > QA Mathematics |
| School / Department / Research Groups: | School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Computer & Computational Science Research Group School of Computing & Mathematical Sciences > Department of Computer Science |
| Related URLs: | |
| Last Modified: | 31 Mar 2011 18:20 |
| URI: | http://gala.gre.ac.uk/id/eprint/1027 |
Actions (login required)
| View Item |