Nested hyper-rectangles for exemplar-based learning

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Exemplar-based learning is a theory in which learning is accomplished by storing points in Euclidean n-space, En. This paper presents a new theory in which these points are generalized to become hyper-rectangles. These hyper-rectangles, in turn, may be nested to arbitrary depth inside one another. This representation scheme is sharply different from the usual inductive learning paradigms, which learn by replacing boolean formulae by more general formulae, or by creating decision trees. The theory is described and then compared to other inductive learning theories. An implementation, Each, has been tested empirically on three different domains: predicting the recurrence of breast cancer, classifying iris flowers, and predicting survival times for heart attack patients. In each case, the results are compared to published results using the same data sets and different machine learning algorithms. Each performs as well as or better than other algorithms on all of the data sets.

Original languageEnglish (US)
Title of host publicationAnalogical and Inductive Inference - International Workshop, All 1989, Proceedings
PublisherSpringer Verlag
Pages184-201
Number of pages18
Volume397 LNAI
ISBN (Print)9783540517344
DOIs
StatePublished - Jan 1 1989
Event2nd International Workshop on Analogical and Inductive Inference, AII 1989 - Reinhardsbrunn Castle, Germany
Duration: Oct 1 1989Oct 6 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume397 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Workshop on Analogical and Inductive Inference, AII 1989
CountryGermany
CityReinhardsbrunn Castle
Period10/1/8910/6/89

Fingerprint

Decision trees
Rectangle
Learning algorithms
Inductive Learning
Learning systems
Learning Theory
Iris
Survival Time
Breast Cancer
Decision tree
Recurrence
Learning Algorithm
Euclidean
Machine Learning
Paradigm
Attack
Arbitrary
Learning

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Salzberg, S. L. (1989). Nested hyper-rectangles for exemplar-based learning. In Analogical and Inductive Inference - International Workshop, All 1989, Proceedings (Vol. 397 LNAI, pp. 184-201). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 397 LNAI). Springer Verlag. https://doi.org/10.1007/3-540-51734-0_61

Nested hyper-rectangles for exemplar-based learning. / Salzberg, Steven L.

Analogical and Inductive Inference - International Workshop, All 1989, Proceedings. Vol. 397 LNAI Springer Verlag, 1989. p. 184-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 397 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Salzberg, SL 1989, Nested hyper-rectangles for exemplar-based learning. in Analogical and Inductive Inference - International Workshop, All 1989, Proceedings. vol. 397 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 397 LNAI, Springer Verlag, pp. 184-201, 2nd International Workshop on Analogical and Inductive Inference, AII 1989, Reinhardsbrunn Castle, Germany, 10/1/89. https://doi.org/10.1007/3-540-51734-0_61
Salzberg SL. Nested hyper-rectangles for exemplar-based learning. In Analogical and Inductive Inference - International Workshop, All 1989, Proceedings. Vol. 397 LNAI. Springer Verlag. 1989. p. 184-201. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-51734-0_61
Salzberg, Steven L. / Nested hyper-rectangles for exemplar-based learning. Analogical and Inductive Inference - International Workshop, All 1989, Proceedings. Vol. 397 LNAI Springer Verlag, 1989. pp. 184-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4e2ee227c6564cbc8e08c88d0543d399,
title = "Nested hyper-rectangles for exemplar-based learning",
abstract = "Exemplar-based learning is a theory in which learning is accomplished by storing points in Euclidean n-space, En. This paper presents a new theory in which these points are generalized to become hyper-rectangles. These hyper-rectangles, in turn, may be nested to arbitrary depth inside one another. This representation scheme is sharply different from the usual inductive learning paradigms, which learn by replacing boolean formulae by more general formulae, or by creating decision trees. The theory is described and then compared to other inductive learning theories. An implementation, Each, has been tested empirically on three different domains: predicting the recurrence of breast cancer, classifying iris flowers, and predicting survival times for heart attack patients. In each case, the results are compared to published results using the same data sets and different machine learning algorithms. Each performs as well as or better than other algorithms on all of the data sets.",
author = "Salzberg, {Steven L}",
year = "1989",
month = "1",
day = "1",
doi = "10.1007/3-540-51734-0_61",
language = "English (US)",
isbn = "9783540517344",
volume = "397 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "184--201",
booktitle = "Analogical and Inductive Inference - International Workshop, All 1989, Proceedings",

}

TY - GEN

T1 - Nested hyper-rectangles for exemplar-based learning

AU - Salzberg, Steven L

PY - 1989/1/1

Y1 - 1989/1/1

N2 - Exemplar-based learning is a theory in which learning is accomplished by storing points in Euclidean n-space, En. This paper presents a new theory in which these points are generalized to become hyper-rectangles. These hyper-rectangles, in turn, may be nested to arbitrary depth inside one another. This representation scheme is sharply different from the usual inductive learning paradigms, which learn by replacing boolean formulae by more general formulae, or by creating decision trees. The theory is described and then compared to other inductive learning theories. An implementation, Each, has been tested empirically on three different domains: predicting the recurrence of breast cancer, classifying iris flowers, and predicting survival times for heart attack patients. In each case, the results are compared to published results using the same data sets and different machine learning algorithms. Each performs as well as or better than other algorithms on all of the data sets.

AB - Exemplar-based learning is a theory in which learning is accomplished by storing points in Euclidean n-space, En. This paper presents a new theory in which these points are generalized to become hyper-rectangles. These hyper-rectangles, in turn, may be nested to arbitrary depth inside one another. This representation scheme is sharply different from the usual inductive learning paradigms, which learn by replacing boolean formulae by more general formulae, or by creating decision trees. The theory is described and then compared to other inductive learning theories. An implementation, Each, has been tested empirically on three different domains: predicting the recurrence of breast cancer, classifying iris flowers, and predicting survival times for heart attack patients. In each case, the results are compared to published results using the same data sets and different machine learning algorithms. Each performs as well as or better than other algorithms on all of the data sets.

UR - http://www.scopus.com/inward/record.url?scp=85037532122&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85037532122&partnerID=8YFLogxK

U2 - 10.1007/3-540-51734-0_61

DO - 10.1007/3-540-51734-0_61

M3 - Conference contribution

AN - SCOPUS:85037532122

SN - 9783540517344

VL - 397 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 184

EP - 201

BT - Analogical and Inductive Inference - International Workshop, All 1989, Proceedings

PB - Springer Verlag

ER -