This page contains the complete material related to "JCHAIDStar: An implementation of the CHAID* algorithm for WEKA".
Class for generating a decision tree based on the CHAID* algorithm,a modified version of the CHAID decision tree induction algorithm that also handles continuous features and includes the same post-pruning mechanism used by C4.5.
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
G. V. Kass. "An Exploratory Technique for Investigating Large Quantities of Categorical Data". Journal of the Royal Statistical Society - Series C (Applied Statistics) (1980), Vol. 29(2), pp 119-127. http://www.jstor.org/stable/2986296
The source code of the classes that implement the JCHAIDStar classifier (on dev-3-9-1 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 JCHAIDStar implementation included in the dev-3-9-1 version of Weka can be found in:
To run Weka type:
java -Xmx1000M -jar Weka-JCHAIDStar.jar
(see http://www.cs.waikato.ac.nz/ml/weka/downloading.html for more information)
Last modification: 2017/12/21