Show simple item record

dc.contributor.authorBanks, Edwin Rogeren_US
dc.date.accessioned2004-10-01T20:49:22Z
dc.date.available2004-10-01T20:49:22Z
dc.date.issued1970-02-01en_US
dc.identifier.otherAIM-189en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5845
dc.description.abstractThe 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.en_US
dc.format.extent21 p.en_US
dc.format.extent7908059 bytes
dc.format.extent508870 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-189en_US
dc.titleConstruction of Decision Treesen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record