Inductive Learning in Less Than One Sequential Data Scan

Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the number of sequential data scans. However, state-of-the-art decision tree construction algorithms still require multiple scans over the data set and use sophisticated control mechanisms and data structures. We first discuss a general inductive learning framework that scans the dataset exactly once. Then, we propose an extension based on Hoeffding's inequality that scans the dataset less than once. Our frameworks are applicable to a wide range of inductive learners.

Authors

• Wei Fan University of Oxford
• Haixun Wang
• Philip S. Yu University of Illinois, Chicago
• Shaw-Hwa Lo

Keywords

No keywords are indexed for this paper.