fc45

C4.5 is a well-known machine learning algorithm used widely, but its runtime performance is sacrificed for the consideration of the limited main memory at that time. We present a fast implementation of C4.5 algorithm, named FC4.5(Fast C4.5). It organizes novel data structures, uses the indirect bucket-sort combined with the bit-parallel technique, and confines the binary-search of the cutoff within the narrowest range. The combination of these techniques enables FC4.5 greatly accelerate the tree construction process of C4.5 algorithm. Experiments show that FC4.5 can build the same decision tree as C4.5(Release 8) system with a runtime performance gain up to 5.8 times. Besides, FC4.5 also achieves a good scalability on different kinds of datasets.

bin
c45
c45.bat
create
create.bat
cv
cv.bat
nul
dataset
UCI
docs
allclasses-frame.html
allclasses-noframe.html
constant-values.html
deprecated-list.html
help-doc.html
index-all.html
index.html
ml
overview-frame.html
overview-summary.html
overview-tree.html
package-list
resources
stylesheet.css
lib
c45.jar
classes
dTree.zip
xstream-1.3.1.jar
readme
Data Format.html
How to cite and contact.html
._Usage Of Bin.html
Usage Of Bin.html
src
ml
work
golf
iris