{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21889"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21889","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Toward an intelligent classification-tree approach to problem-solving","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Tu, Pei-Lei"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Business Administration","degree_department":null,"school":null,"contributors":["Blair, Charles E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:22:16Z","date_published":"2011-05-07T13:22:16Z","updated_at":"2026-07-22T22:25:18Z","subjects":["Business Administration, General","Information Science","Artificial Intelligence"],"languages":["eng"],"rights":["Copyright 1989 Tu, Pei-Lei"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9011059","(UMI)AAI9011059"],"render_values":[{"text":"AAI9011059","href":null,"code":true},{"text":"(UMI)AAI9011059","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21889","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Blair, Charles E."]},{"key":"dc:creator","label":"Author","values":["Tu, Pei-Lei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:22:16Z","10000-01-01","1989"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Business Administration"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Business Administration, General","Information Science","Artificial Intelligence"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1989 Tu, Pei-Lei"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9011059","(UMI)AAI9011059","http://hdl.handle.net/2142/21889"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2011-05-07T13:22:16Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9011059.pdf: 4738270 bytes, checksum: 385428417815e91bf70753688bb8fea1 (MD5) Previous issue date: 1989","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:53:53Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:24:58-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Toward an intelligent classification-tree approach to problem-solving"]}]}],"canonical_facts":{"dc:contributor":["Blair, Charles E."],"dc:creator":["Tu, Pei-Lei"],"dc:date":["2011-05-07T13:22:16Z","10000-01-01","1989"],"dc:description":["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.","Made available in DSpace on 2011-05-07T13:22:16Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9011059.pdf: 4738270 bytes, checksum: 385428417815e91bf70753688bb8fea1 (MD5) Previous issue date: 1989","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:53:53Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:24:58-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9011059","(UMI)AAI9011059","http://hdl.handle.net/2142/21889"],"dc:language":["eng"],"dc:rights":["Copyright 1989 Tu, Pei-Lei"],"dc:subject":["Business Administration, General","Information Science","Artificial Intelligence"],"dc:title":["Toward an intelligent classification-tree approach to problem-solving"],"dc:type":["text"],"thesis:degree_discipline":["Business Administration"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:18Z"}