Ara
Toplam kayıt 4, listelenen: 1-4
Budding trees
(IEEE Computer Soc, 2014-08-24)
We propose a new decision tree model, named the budding tree, where a node can be both a leaf and an internal decision node. Each bud node starts as a leaf node, can then grow children, but then later on, if necessary, its ...
VC-dimension of rule sets
(IEEE Computer Soc, 2014-12-04)
In this paper, we give and prove lower bounds of the VC-dimension of the rule set hypothesis class where the input features are binary or continuous. The VC-dimension of the rule set depends on the VC-dimension values of ...
Incremental construction of rule ensembles using classifiers produced by different class orderings
(IEEE, 2016)
In this paper, we discuss a novel approach to incrementally construct a rule ensemble. The approach constructs an ensemble from a dynamically generated set of rule classifiers. Each classifier in this set is trained by ...
Soft decision trees
(IEEE, 2012)
We discuss a novel decision tree architecture with soft decisions at the internal nodes where we choose both children with probabilities given by a sigmoid gating function. Our algorithm is incremental where new nodes are ...