Gaines, B.R. (1995), "Structured and Unstructured Induction with EDAGs," Proceedings of the First International Conference on Knowledge Discovery and Data Mining, Montreal, Canada, (AAAI Press, San Mateo, CA). Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Comparing Simplification Procedures for Decision Trees on an.. - Aha, Breslow (1998) (3 citations) (Correct)
....union need only be a subset of the parent s cases, which means that some cases will find their classification predictions at the parent node. Second, a case s feature values may satisfy more than one branch from a node, and these cases must find their classifications by traversing multiple paths. Gaines (1995; 1996) describes a method for translating decision trees to EDAGs and some promising EDAG applications for yielding simpler indexing structures. 5. EMPIRICAL COMPARISON We compared the selected suite of algorithms on the symbolic economics data set using a 10 fold crossvalidation strategy. That ....
Gaines, B.R. (1995), "Structured and Unstructured Induction with EDAGs," Proceedings of the First International Conference on Knowledge Discovery and Data Mining, Montreal, Canada, (AAAI Press, San Mateo, CA).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC