| P95-1027 | construction of such trees is binary | recursive partitioning | , which constructs a binary tree |
| E99-1019 | training . The trees were grown using | recursive partitioning | ; the splitting criterion was |
| N04-4005 | The applied strategy is that of | recursive partitioning | , where the resulting rules are |
| J00-4004 | induction , which we employ here , is | recursive partitioning | ( Quinlan 1986 ; Breiman et al. |
| D11-1064 | Decision Tree Construction We use | recursive partitioning | to grow decision trees . In this |
| J00-4004 | portion of the tree created with | recursive partitioning | is shown in Figure 2 ( in Section |
| W06-0107 | Classification Tree is to do a | recursive partitioning | of the variable space to achieve |
| W97-0318 | induction , employed here , is | recursive partitioning | ( Quinlan , 1986 ; Breiman et |
| W09-1603 | . CART uses an exhaus - tive , | recursive partitioning | routine to generate binary splits |
| W10-4167 | clustering of n data points is a | recursive partitioning | of the data into 2 , 3 , 4 , |
| W03-1028 | used to construct the rules is | recursive partitioning | ( or divide-and-conquer ) , which |
| W06-0107 | training dataset . We use the | Recursive Partitioning | and Regression Trees ( Rpart |
| W12-0408 | birth fixation were submitted to a | recursive partitioning | classification algorithm ( Clark |
| P96-1050 | the initial feature set using a | recursive partitioning | algorithm ( Quinlan , 1986 ; |
| W01-0721 | and Boul - ton , 1968 ) with the | recursive partitioning | algo - rithm . In this paper |
