Decision tree toolkit: A component-based library of decision tree algorithms

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper reports on the development of a library of decision tree algorithms in Java. The basic model of a decision tree algorithm is presented and then used to justify the design choices and system architecture issues. The library has been designed for flexibility and adaptability. Its basic goal was an open system that could easily embody parts of different conventional as well as new algorithms, without the need of knowing the inner organization of the system in detail. The system has an integrated interface (ClassExplorer), which is used for controlling and combining components that comprise decision trees. The ClassExplorer can create objects "on the fly", from classes unknown during compilation time. Conclusions and considerations about extensions towards a more visual system are also described.

Cite

CITATION STYLE

APA

Drossos, N., Papagelis, A., & Kalles, D. (2000). Decision tree toolkit: A component-based library of decision tree algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1910, pp. 381–387). Springer Verlag. https://doi.org/10.1007/3-540-45372-5_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free