CN2 This algorithm inductively learns a set of propositional if...then... rules from a set of training examples. To do this, it performs a general-to-specific beam search through rule-space for the "best" rule, removes training examples covered by that rule, then repeats until no more "good" rules can be found. The original algorithm (Machine Learning Journal paper below) defined "best" using a combination of entropy and a significance test. The algorithm was later improved to replace this evaluation function wite the Laplace estimate, below), and also to induce unordered rule sets as well as ordered rule lists ("decision lists"). The software implements the latest version (ie. using the Laplace heuristic), but has flags which can be set to return it to the original version.

Current Version:   ?? License Type:   ??

Home Site: http://www.cs.utexas.edu/users/pclark/software.html Source Code Availability:   Yes Available Binary Packages: Debian Package:   No RedHat RPM Package:   No Other Packages:   No Targeted Platforms: SunOS, Solaris, IRIX, HP-UX, Linux Software/Hardware Requirements: C Compiler

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Other Scientific Fields   |   Artificial Intelligence