You are here

Efficient C4.5

An optimized version of the C4.5 algorithm for constructing decision trees.


A pre-processing data-reduction algorithm for constrained frequent patterns mining. Described in the paper: F. Bonchi, F. Giannotti, A. Mazzanti, D. Pedreschi ExAnte: Anticipated Data Reduction in Constrained Pattern Mining In Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'03) Lecture Notes in Computer Science, Volume 2838, ©Springer. September 22-26, 2003, Cavtat-Dubrovnik, Croatia.


KDDML (KDD Markup Language) is a middleware language and system designed to support the development of final applications or higher level systems which deploy a mixture of data access, data preprocessing, data mining models extraction and deployment. The KDDML language is XML-based, both for query syntax and data/model representation. A KDDML query is an XML-document where XML tags corresponds to operations on data/models, XML attributes corresponds to parameters of those operations and XML sub-elements define arguments passed to the operators.