language: en

Where Do SE-trees Perform? (Part I)

Ron Rymon
Intelligent Systems Program
901 Cathedral of Learning
University of Pittsburgh
Pittsburgh, PA 15260
E-mail: Rymon@ISP.Pitt.edu March 5, 1995

Abstract As a classifier, a Set Enumeration (SE) tree can be viewed as a generalization of decision trees. We empirically characterize domains in which SE-trees are particularly advantageous relative to decision trees. Specifically, we show that: 1. SE-trees excel in domains in which relatively few examples are available; and