Konu "Optimization" için MF - Bildiri Koleksiyonu | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 5, listelenen: 1-5
-
Crossing minimization in weighted bipartite graphs
(Springer, 2007)Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ... -
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 ... -
An incremental model selection algorithm based on cross-validation for finding the architecture of a Hidden Markov model on hand gesture data sets
(IEEE, 2009-12-13)In a multi-parameter learning problem, besides choosing the architecture of the learner, there is the problem of finding the optimal parameters to get maximum performance. When the number of parameters to be tuned increases, ... -
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 ... -
Subset selection for tuning of hyper-parameters in artificial neural networks
(IEEE, 2017)Hyper-parameters of a machine learning architecture define its design. Tuning of hyper-parameters is costly and for large data sets outright impractical, whether it is performed manually or algorithmically. In this study ...