This page contains the complete material related to "An implementation of the BFPART algorithm for WEKA".
Class for generating a BFPART (Best-First PART) decision list. Incorporates the Best-First local search algorithm to determine the next node to be considered for analysis (to be split or not) in the construction of each partial C4.5 decision tree. In addition to leaves, also takes into account non-analyzed nodes (neither split, nor leaf) in order to select the branch used to generate the next rule.
For more information, see:
Igor Ibarguren, Aritz Lasarguren, Jesús M. Pérez, Javier Muguerza, Olatz Arbelaitz and Ibai Gurrutxaga. "BFPART: Best-First PART". Information Sciences (2016). Vol. 367-368. pp. 927-952. doi:10.1016/j.ins.2016.07.023
The source code of the five classes that implement the BFPART classifier (on stable-3-6-14 version of Weka) can be found in:
In order to complete the whole source code of the implementation, download the Weka source code from http://www.cs.waikato.ac.nz/ml/weka/downloading.html.
The executable file in Weka is a .jar file. The file with the current BFPART implementation included in the stable-3-6-14 version of Weka can be found in:
To run Weka type:
java -Xmx1000M -jar Weka-BFPART.jar
(see http://www.cs.waikato.ac.nz/ml/weka/downloading.html for more information)
Last modification: 2016/08/29