Enhancing the performance of entropy algorithm using minimum tree in decision tree classifier

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we proposed a new algorithm called enhanced entropy algorithm has a major advantage of reducing the complexity and execution time w.r.t the original entropy algorithm and at the same time yields the same sequence that can be found by applying entropy algorithm. The presented Enhance Entropy Algorithm (EEP) finds the sequence of the minimum tree in a simple manner compared to entropy algorithm (which uses complex mathematical operations to find the sequence of the minimum tree) using simple logical operations. © Springer Science+Business Media B.V. 2009.

Cite

CITATION STYLE

APA

Khatatneh, K., & El Emary, I. M. M. (2009). Enhancing the performance of entropy algorithm using minimum tree in decision tree classifier. In Lecture Notes in Electrical Engineering (Vol. 14 LNEE, pp. 333–347). https://doi.org/10.1007/978-1-4020-8919-0_23

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