Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!husc6!endor!reiter
From: reiter@endor.UUCP
Newsgroups: comp.ai
Subject: Re: ID3 vs C4
Message-ID: <2190@husc6.UUCP>
Date: Thu, 4-Jun-87 09:04:17 EDT
Article-I.D.: husc6.2190
Posted: Thu Jun  4 09:04:17 1987
Date-Received: Sat, 6-Jun-87 07:10:54 EDT
References: <114@upba.UUCP>
Sender: news@husc6.UUCP
Reply-To: reiter@harvard.UUCP (Ehud Reiter)
Organization: Aiken Computation Lab Harvard, Cambridge, MA
Lines: 22

In article <114@upba.UUCP> damon@upba.UUCP (Damon Scaggs) writes:
>I understand that Ross Quinlan, author of the ID3 classification algorithm
>has developed a better version with the designation C4.  I am looking for
>any papers or references about this new algorithm as well as any comments
>about what it does better.

The best reference I've seen on statistical algorithms for learning decision
trees is

	CLASSIFICATION AND REGRESSION TREES
		by L. Breiman, J. Friedman, R. Olshen, C. Stone
		Wadsworth Press, 1984

The book makes no specific mention of ID3 or C4, but it gives much more
detail about this class of learning algorithms than I've seen in any of
Quinlan's papers.

I'm posting this reponse to the net because I really do think this is a
superb book.
					Ehud Reiter
					reiter@harvard	(ARPA,BITNET,UUCP)
					reiter@harvard.harvard.EDU  (new ARPA)