Nautilus Systems, Inc. logo and menu bar Site Index Home
News Books
Button Bar Menu- Choices also at bottom of page About Nautilus Services Partners Case Studies Contact Us
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] [Subscribe]

DM: RE: RE: Pruning methods


From: Helberg, Clay
Date: Wed, 15 Mar 2000 09:21:38 -0600
To make life easier for some of you, the Michie et al. book cited below can
be downloaded in postscript or PDF format from
http://www.amsta.leeds.ac.uk/~charles/statlog/.

								--Clay

-----Original Message-----
From: Donal Lyons [mailto:Donal.Lyons@tcd.ie]
Sent: Wednesday, March 15, 2000 6:41 AM
To: datamine-l@nautilus-sys.com
Subject: DM: RE: Pruning methods


For CART the definitive book is Leo Breiman et al., Classification and
Regression Trees (CART), Wadsworth & Brooks, 1984.
For C4.5 see J. Ross Quinlan, C4.5: Programs for Machine Learning, Morgan
Kaufmann, 1993.
I'm unsure about pruning in CHAID - there's a brief description of the
algorithm on the SPSS Web site

Summaries for at least some algorithms can be found in D. Michie, D.J.
Spiegelhalter and C.C. Taylor (eds.), Machine Learning, Neural and
Statistical Classification Ellis Horwood, 1994.  Another good overview book
is D. J. Hand, Construction and Assessment of Classification Rules, Wiley,
1997




[ Home | About Nautilus | Case Studies | Partners | Contact Nautilus ]
[ Subscribe to Lists | Recommended Books ]

logo Copyright © 1999 Nautilus Systems, Inc. All Rights Reserved.
Email: firschng@nautilus-systems.com
Mail converted by MHonArc 2.2.0