Topic
Decision tree model
About: Decision tree model is a research topic. Over the lifetime, 2256 publications have been published within this topic receiving 38142 citations.
Papers published on a yearly basis
Papers
More filters
16 Oct 1978
37 citations
25 Jun 2010
TL;DR: Specific solution for the problems of property value vacancy, multiple-valued property selection, property selection criteria, and weighted and simplified entropy into decision tree algorithm is proposed so as to achieve the improvement of ID3 algorithm.
Abstract: Decision tree algorithm is a kind of data mining model to make induction learning algorithm based on examples. It is easy to extract display rule, has smaller computation amount, and could display important decision property and own higher classification precision. For the study of data mining algorithm based on decision tree, this article put forward specific solution for the problems of property value vacancy, multiple-valued property selection, property selection criteria, propose to introduce weighted and simplified entropy into decision tree algorithm so as to achieve the improvement of ID3 algorithm. The experimental results show that the improved algorithm is better than widely used ID3 algorithm at present on overall performance.
37 citations
TL;DR: It is proposed to define the complexity of an ecological model as the statistical complexity of the output it produces, and it is suggested that model complexity so defined better captures the difficulty faced by a user in managing and understanding the behaviour of an ecology model than measures based on a model ‘size’.
37 citations
TL;DR: The 2N-ary choice tree model accounts for response times and choice probabilities in multi-alternative preferential choice, which implements pairwise comparison of alternatives on weighted attributes into an information sampling process which, in turn, results in a preference process.
Abstract: The 2N-ary choice tree model accounts for response times and choice probabilities in multi-alternative preferential choice. It implements pairwise comparison of alternatives on weighted attributes into an information sampling process which, in turn, results in a preference process. The model provides expected choice probabilities and response time distributions in closed form for optional and fixed stopping times. The theoretical background of the 2N-ary choice tree model is explained in detail with focus on the transition probabilities that take into account constituents of human preferences such as expectations, emotions, or socially influenced attention. Then it is shown how the model accounts for several context-effects observed in human preferential choice like similarity, attraction, and compromise effects and how long it takes, on average, for the decision. The model is extended to deal with more than three choice alternatives. A short discussion on how the 2N-ary choice tree model differs from the multi-alternative decision field theory and the leaky competing accumulator model is provided.
37 citations
TL;DR: This work gives a review of some works on the complexity of implementation of arithmetic operations in finite fields by Boolean circuits.
Abstract: We give a review of some works on the complexity of implementation of arithmetic operations in finite fields by Boolean circuits.
36 citations