G. I. Webb. Inclusive pruning: A new class of pruning rule for unordered search and its application to classication learning. In Proceedings of the Nineteenth Australasian Computer Science Conference, pages 1-10, Melbourne, January 1996.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constructing Conjunctions using Systematic Search on Decision Trees - Zheng (1998) (Correct)
....rules. Rymon [18, 19] uses systematic search with pruning to learn SE trees, a type of tree structure containing rules that predict classes using attributes. Schlimmer [20] adopts systematic search with pruning for inducing determinations that identify which factors influence others. Webb [21, 22] further explores the systematic search in a more general way. In addition, Webb [22] proposes a few new pruning rules for systematic search. 6 Conclusions and Future Work This paper has investigated a dynamic path based approach to constructing new attributes for decision tree learning. For ....
....of tree structure containing rules that predict classes using attributes. Schlimmer [20] adopts systematic search with pruning for inducing determinations that identify which factors influence others. Webb [21, 22] further explores the systematic search in a more general way. In addition, Webb [22] proposes a few new pruning rules for systematic search. 6 Conclusions and Future Work This paper has investigated a dynamic path based approach to constructing new attributes for decision tree learning. For each path of a tree, a conjunction is generated by searching over the path. A ....
[Article contains additional citation context not shown here]
G.I. Webb, Inclusive pruning: a new class of pruning rule for unordered search and its application to classification learning. Proceedings of the Nineteenth Australian Computer Science Conference (Australian Computer Science Communications, 18, 1996) 1-10.
Efficient Search for Association Rules - Webb (2000) (13 citations) Self-citation (Webb) (Correct)
....the space associated with the least promising search operator 4 . This is illustrated in Fig. 4. The OPUS algorithms have been demonstrated to support ecient complete search of a number of standard rule discovery search tasks[18] A further approach to pruning is provided by inclusive pruning [19]. Whereas the (exclusive) pruning actions illustrated above involve excluding from the search space those nodes containing a particular condition, inclusive pruning results in the exclusion of all nodes that do not contain a given condition. Like exclusive pruning, each inclusive pruning action ....
G. I. Webb. Inclusive pruning: A new class of pruning rule for unordered search and its application to classication learning. In Proceedings of the Nineteenth Australasian Computer Science Conference, pages 1-10, Melbourne, January 1996.
Constructing Conjunctions using Systematic Search on Decision Trees - Zheng (1998) (Correct)
No context found.
G.I. Webb, Inclusive pruning: a new class of pruning rule for unordered search and its application to classification learning. Proceedings of the Nineteenth Australian Computer Science Conference, Australian Computer Science Communications, 18, 1-10 (1996).
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