DM: RE: CARTŪ s and CHAIDs

[Blaise Egan]

Uwe,

CARTŪ  is described in detail in the eponymous book Classification and
Regression Trees, by Breiman, Friedman, Olshen and Stone. Chapman and
Hall 1983
ISBN 0-412-04841-8

CHAID is described in 

A method of choosing multiway partitions for classification and 
decision
trees

by Biggs, D, de Ville, B, and Suen, E.

Journal of Applied  Statistics Vol 18, No 1, 1991

Blaise F Egan
Data Mining Group
BT Laboratories

>----------
>From:  uwe.eichler@cp.novartis.com[SMTP:uwe.eichler@cp.novartis.com]
>Sent:  Wednesday, June 17, 1998 10:35 AM
>To:    datamine-l@nautilus-sys.com
>Subject:       DM: CARTŪ s and CHAIDs
>
>
>Dear Colleagues,
>
>I'm new in the field of data mining and also in this mailing list.
>I'll try to apply its methods to chemical databases.
>Is there a FAQ of this mailing list ?
>I'm looking for an article in which the algorithms of
>CARTŪ s (Classification And Regression Trees) and 
>CHAIDS (Chi-square Automatic Interaction Detection)
>are described in detail. A review article would also
>be nice.
>
>Thanks for your help,
>
>    Uwe Eichler
>