A framework for historical case-based reasoning

  • Authors:

  • Jixin Ma;Brian Knight

  • Affiliations:

  • School of Computing and Mathematical Sciences, The University of Greenwich, London, U.K.;School of Computing and Mathematical Sciences, The University of Greenwich, London, U.K.

  • Venue:
  • ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a framework for Historical Case-Based Reasoning (HCBR) which allows the expression of both relative and absolute temporal knowledge, representing case histories in the real world. The formalism is founded on a general temporal theory that accommodates both points and intervals as primitive time elements. A case history is formally defined as a collection of (time-independent) elemental cases, together with its corresponding temporal reference. Case history matching is two-fold, i.e., there are two similarity values need to be computed: the non-temporal similarity degree and the temporal similarity degree. On the one hand, based on elemental case matching, the non-temporal similarity degree between case histories is defined by means of computing the unions and intersections of the involved elemental cases. On the other hand, by means of the graphical presentation of temporal references, the temporal similarity degree in case history matching is transformed into conventional graph similarity measurement.