YaDT: Yet another Decision Tree Builder

Authors:
Salvatore Ruggieri
Affiliations:
Università di Pisa
Venue:
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Year:
2004

Citing 0
Cited 4

KDDML: a middleware language and system for knowledge discovery in databases

Data & Knowledge Engineering
Rethinking Chinese word segmentation: tokenization, character classification, or wordbreak identification

ACL '07 Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions
Centrality measures in text mining: prediction of noun phrases that appear in abstracts

ACLstudent '05 Proceedings of the ACL Student Research Workshop
Porting decision tree algorithms to multicore using fastflow

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

YaDT is a from-scratch main-memory implementation of the C4.5-like decision tree algorithm. Our presentation will be focused on the design principles that allowed for obtaining an extremely efficient system. Experimental results are reported comparing YaDT withWeka, dti, Xelopes and (E)C4.5.