A Heuristic Program that Constructs Decision Trees

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6175

Full metadata record

DC Field	Value	Language
dc.creator	Winston, Patrick	-
dc.date	2004-10-04T14:44:14Z	-
dc.date	2004-10-04T14:44:14Z	-
dc.date	1969-03-01	-
dc.date.accessioned	2013-10-09T02:43:46Z	-
dc.date.available	2013-10-09T02:43:46Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-173	-
dc.identifier	http://hdl.handle.net/1721.1/6175	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Suppose 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.	-
dc.format	15630995 bytes	-
dc.format	1075245 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-173	-
dc.title	A Heuristic Program that Constructs Decision Trees	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI