Abstract—It is important to use a better criterion in selection and discretization of attributes for the generation of decision trees to construct a better classifier in the area of pattern recognition in order to intelligently access huge amount of data efficiently. Two well-known criteria are gain and gain ratio, both based on the entropy of partitions. We propose in this paper a new criterion based also on entropy, and use both theoretical analysis and computer simulation to demonstrate that it works better than gain or gain ratio in a wide variety of situations. We use the usual entropy calculation where the base of the logarithm is not two but the number of successors to the node. Our theoretical analysis leads some specific situations...
Two problems of the ID3 and C4.5 decision tree building methods will be mentioned and solutions will...
In this paper we present a new entropy measure to grow decision trees. This measure has the characte...
We compare four discretization methods, all based on entropy: the original C4.5 approach to discreti...
Decision Trees are well known for their training efficiency and their interpretable knowledge repres...
Decision Trees are well known for their training efficiency and their interpretable knowledge repres...
Decision Trees are well known for their training efficiency and their interpretable knowledge repres...
In [7], a new information-theoretic attribute selection method for decision tree induction was intro...
In the fields of finance, engineering and varied sciences, Data Mining/ Machine Learning has held an...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
We present a result applicable to classification learning algorithms that generate decision trees or...
© 2016 The construction of efficient and effective decision trees remains a key topic in machine lea...
In this paper, we consider decision trees that use both conventional queries based on one attribute ...
International audienceIn this contribution, we propose an approach in order to construct a set of ru...
Entropy gain is widely used for learning decision trees. However, as we go deeper downward the tree,...
Two problems of the ID3 and C4.5 decision tree building methods will be mentioned and solutions will...
In this paper we present a new entropy measure to grow decision trees. This measure has the characte...
We compare four discretization methods, all based on entropy: the original C4.5 approach to discreti...
Decision Trees are well known for their training efficiency and their interpretable knowledge repres...
Decision Trees are well known for their training efficiency and their interpretable knowledge repres...
Decision Trees are well known for their training efficiency and their interpretable knowledge repres...
In [7], a new information-theoretic attribute selection method for decision tree induction was intro...
In the fields of finance, engineering and varied sciences, Data Mining/ Machine Learning has held an...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
We present a result applicable to classification learning algorithms that generate decision trees or...
© 2016 The construction of efficient and effective decision trees remains a key topic in machine lea...
In this paper, we consider decision trees that use both conventional queries based on one attribute ...
International audienceIn this contribution, we propose an approach in order to construct a set of ru...
Entropy gain is widely used for learning decision trees. However, as we go deeper downward the tree,...
Two problems of the ID3 and C4.5 decision tree building methods will be mentioned and solutions will...
In this paper we present a new entropy measure to grow decision trees. This measure has the characte...
We compare four discretization methods, all based on entropy: the original C4.5 approach to discreti...