Toward an intelligent classification-tree approach to problem-solving
Tu, Pei-Lei
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/21889
Description
Title
Toward an intelligent classification-tree approach to problem-solving
Author(s)
Tu, Pei-Lei
Issue Date
1989
Doctoral Committee Chair(s)
Blair, Charles E.
Department of Study
Business Administration
Discipline
Business Administration
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Business Administration, General
Information Science
Artificial Intelligence
Language
eng
Abstract
The objective of this thesis is to design a new classification-tree algorithm which will outperform current algorithms with superior decision trees. The problem of generating a classification tree with the minimum path length is shown to be NP-complete. Therefore, there is no computationally efficient algorithm, only heuristic algorithms are available. One prevalent heuristic algorithm ID3 is analyzed. Since this algorithm selects the locally best attributes, adding a new variable may deteriorate the classification performance if this variable is too closely related to previously selected attributes. A new algorithm IDA is designed. In contrast to ID3, IDA considers the global dependency structure of variables and explores more local alternatives. An analysis on the time complexity of both algorithms shows that when the size of the input instance is large, IDA requires only one half of the computing time taken by ID3. Besides the computational efficiency, this new algorithm has a better performance than ID3 over a variety of situations examined in a simulation study. The number of variables, the number of levels, the distance parameter between the population means, the variance-covariance matrix, and the sample size are five important factors determining the performance of a classification-tree algorithm.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
