Sciweavers

45 search results - page 2 / 9
» Decision Trees Using the Minimum Entropy-of-Error Principle
Sort
View
TIT
1998
123views more  TIT 1998»
13 years 7 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
CCE
2008
13 years 7 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
KDD
1995
ACM
176views Data Mining» more  KDD 1995»
13 years 11 months ago
MDL-Based Decision Tree Pruning
This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal o...
Manish Mehta 0002, Jorma Rissanen, Rakesh Agrawal
CP
2009
Springer
14 years 8 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
COMSIS
2006
156views more  COMSIS 2006»
13 years 7 months ago
A Comparison of the Bagging and the Boosting Methods Using the Decision Trees Classifiers
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
Kristína Machova, Miroslav Puszta, Frantise...