CHAID and Earlier Supervised Tree Methods
AbstractThe aim of this paper is twofold. First we discuss the origin of tree methods. Essentially we survey earlier methods that led to CHAID (Kass, 1980; Biggs et al., 1991). The second goal is then to explain in details the functioning of CHAID, especially the differences between the original method as described in Kass (1980) and the nowadays currently implemented extension that was proposed by Biggs et al.(1991).
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Département des Sciences Économiques, Université de Genève in its series Research Papers by the Department of Economics, University of Geneva with number 2010.02.
Length: 30 pages
Date of creation: Jul 2010
Date of revision:
Contact details of provider:
Postal: 40 Boulevard du Pont-d'Arve, CH-1211 Geneva 4, Switzerland
Phone: +41 22 379 8263
Fax: +41 22 379 82 93
Web page: http://www.unige.ch/ses/dsec/
Classification tree; regression tree; recursive partitioning; CHAID; AID; THAID; ELISEE;
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.