A Nearest Hyperrectangle Learning Method

  • Authors:

  • Steven Salzberg

  • Affiliations:

  • Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218. SALZBERG@CS.JHU.EDU

  • Venue:
  • Machine Learning
  • Year:
  • 1991

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a theory of learning called nested generalized exemplar (NGE) theory, in which learning is accomplished by storing objects in Euclidean n-space, En, as hyperrectangles. The hyperrectangles may be nested inside one another to arbitrary depth. In contrast to generalization processes that replace symbolic formulae by more general formulae, the NGE algorithm modifies hyperrectangles by growing and reshaping them in a well-defined fashion. The axes of these hyperrectangles are defined by the variables measured for each example. Each variable can have any range on the real line; thus the theory is not restricted to symbolic or binary values.This paper describes some advantages and disadvantages of NGE theory, positions it as a form of exemplar-based learning, and compares it to other inductive learning theories. An implementation has been tested in three different domains, for which results are presented below: prediction of breast cancer, classification of iris flowers, and prediction of survival times for heart attack patients. The results in these domains support the claim that NGE theory can be used to create compact representations with excellent predictive accuracy.