Look-ahead learning algorithm for inductive learning through examples

Ray R. Hashemi, Frederick R. Jelovsek

Research output: Contribution to book or proceedingConference articlepeer-review

1 Scopus citations

Abstract

Previously, the superiority of the LEARN algorithm over the ID3 algorithm was established. In this paper, a look ahead learning algorithm (LA-LEARN) along with its analysis is presented. The algorithm LA-LEARN, in contrast to the algorithm LEARN, guarantees the minimal resulting rules. The algorithms LA-LEARN, LEARN, and ID3 were compared through an empirical approach.

Original languageEnglish
Title of host publicationApplied Computing
Subtitle of host publicationTechnological Challenges of the 1990's
PublisherPubl by ACM
Pages603-607
Number of pages5
ISBN (Print)089791502X
StatePublished - 1992
EventProceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 - Kansas City, KS, USA
Duration: Mar 1 1992Mar 3 1992

Publication series

NameApplied Computing: Technological Challenges of the 1990's

Conference

ConferenceProceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92
CityKansas City, KS, USA
Period03/1/9203/3/92

Fingerprint

Dive into the research topics of 'Look-ahead learning algorithm for inductive learning through examples'. Together they form a unique fingerprint.

Cite this