Show simple item record

A Heuristic Program that Constructs Decision Trees

dc.date.accessioned2004-10-04T14:44:14Z
dc.date.accessioned2018-11-24T10:12:15Z
dc.date.available2004-10-04T14:44:14Z
dc.date.available2018-11-24T10:12:15Z
dc.date.issued1969-03-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6175
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6175
dc.description.abstractSuppose there is a set of objects, {A, B,...E} and a set of tests, {T1, T2,...TN). When a test is applied to an object, the result is wither T or F. Assume the test may vary in cost and the object may vary in probability or occurrence. One then hopes that an unknown object may be identified by applying a sequence if tests. The appropriate test at any point in the sequence in general should depend on the results of previous tests. The problem is to construct a good test scheme using the test cost, the probabilities of occurrence, and a table of test outcomes.en_US
dc.format.extent15630995 bytes
dc.format.extent1075245 bytes
dc.language.isoen_US
dc.titleA Heuristic Program that Constructs Decision Treesen_US


Files in this item

FilesSizeFormatView
AIM-173.pdf1.075Mbapplication/pdfView/Open
AIM-173.ps15.63Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record