Therehasbeensurprisinglylittle researchso far that systematicallyinvestigatedthe possibilityof constructinghybrid learningalgorithmsbysimplelocal modificationsto decision tree lea...
Alexander K. Seewald, Johann Petrak, Gerhard Widme...
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree lea...