Konu "Search problems" için MF - Bildiri Koleksiyonu | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 3, listelenen: 1-3
-
Calculating the VC-dimension of decision trees
(IEEE, 2009)We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the ... -
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 ... -
Searching for the optimal ordering of classes in rule induction
(IEEE, 2012-11-15)Rule induction algorithms such as Ripper, solve a K > 2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing ...