Proceedings

Concept Formation From Very Large Training Sets

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Learning and Knowledge Acquisition. Pages 479-480.

© 1983 International Joint Conferences on Artificial Intelligence

Abstract

This paper proposes an alternative to Ouinlan' s al&o rit hn for forr.ting classification trees fron large sets of exatlples. tty algorithn is gua ranteed to terninate. Qui nlan's a l gor ithm is usually faster.

  1. Everitt, ll S. _C_l_t~s-~e_r_ !~n_a_lxs_i_s_. : 1\einenann 1974.
  2. Kenc!all, r1. J•lultivariate -~n_a_lx~i_s_. Griffin &•c-o T9)T:-- Charles Quinlan, J.R. Discovering Rules hy Induction fron Large Collecti•o,;s--o-{ -r:~•.;-.,;p-ie-8; -pa-ges--16•3--"z"M: Ed-in-bu_r_r,"!l-lfn-rv•e-rsity rr-ess;-i979.
  3. Sturt, E. Computerized Construction in Fortran of a Discriminant Function for Categorical Data.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards