Masters Theses

Abstract

"Inductive machine learning algorithms are knowledge-based learning algorithms which take training instances as input and produce knowledge as output. One popular induction algorithm is Quinlan's ID3 [1986]. This algorithm produces knowledge in the form of a decision tree. Each path in the tree can be interpreted as a rule with the leaves representing rule conclusions. Selected attributes which describe the training instances form the interior nodes of the tree.

The ID3 algorithm is extremely sensitive to noisy training data. In an effort to reduce the effects of noise on tree construction, Quinlan used the ��2 test to identify noisy attribute values and exclude them at certain points in tree construction. This approach has proven to be effective in some cases and not effective in others.

This paper examines ID3 trees produced from noisy training data. To determine the effects of the ��2 test in various situations, several test domains were used. Various levels of noise were injected into each training set and the corresponding trees were evaluated. It was observed that the effectiveness of the ��2 test on noisy data is related to both the type of matching criteria used at leaf nodes and the size of the training set"--Abstract, page iv.

Advisor(s)

St. Clair, Daniel C.

Committee Member(s)

Rigler, A. K.
Hahn, James H.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Comments

A report which is substantially this thesis is available here for download.

Publisher

University of Missouri--Rolla

Publication Date

Spring 1995

Pagination

viii, 20 pages

Note about bibliography

Includes bibliographical references (page 19).

Rights

© 1995 Mayank Thakore, All rights reserved.

Document Type

Thesis - Restricted Access

File Type

text

Language

English

Thesis Number

T 6958

Print OCLC #

32844749

Download
Off-campus S&T users

Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.

Share

 
COinS