DSpace Repository

Construction of Decision Trees

Show simple item record

dc.creator Banks, Edwin Roger
dc.date 2004-10-01T20:49:22Z
dc.date 2004-10-01T20:49:22Z
dc.date 1970-02-01
dc.date.accessioned 2013-10-09T02:41:32Z
dc.date.available 2013-10-09T02:41:32Z
dc.date.issued 2013-10-09
dc.identifier AIM-189
dc.identifier http://hdl.handle.net/1721.1/5845
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description The construction of optimal decision trees for the problem stated within can be accomplished by an exhaustive enumeration. This paper discusses two approaches. The section on heuristic methods gives mostly negative results (E.G. there is no merit factor that will always yield the optimal tests, etc.), but most to these methods do give good results. The section entitled "Exhaustive Enumeration Revisited" indicates some powerful shortcuts that can be applied to an exhaustive enumeration, extending the range of this method.
dc.format 21 p.
dc.format 7908059 bytes
dc.format 508870 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-189
dc.title Construction of Decision Trees


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account