@inbook{4534e495385d48eda5da876e1ef19f08,
title = "Look-ahead mechanism integration in decision tree induction models",
abstract = "Most of decision tree induction algorithms use a greedy splitting criterion. One of the possible solutions to avoid this greediness is looking ahead to make better splits. Look-Ahead has not been used in most decision tree methods primarily because of its high computational complexity and its questionable contribution to predictive accuracy. In this paper we describe a new Look-Ahead approach to induction of decision tree models. We present a computationally efficient algorithm which evaluates quality of subtrees of variable-depth in order to determine the best split attribute out of a set of candidate attributes with a splitting criterion statistically indifferent from the best one.",
author = "Michael Roizman and Mark Last",
year = "2006",
month = sep,
day = "27",
doi = "10.1007/3-540-33880-2\_29",
language = "English",
isbn = "3540338799",
series = "Studies in Computational Intelligence",
pages = "285--294",
editor = "Mark Last and Piotr Szczepaniak and Piotr Szczepaniak and Zeev Vlvolkov and Abraham Kandel",
booktitle = "Advances in Web Intelligence and Data Mining",
}