Sciweavers

1683 search results - page 104 / 337
» Learning with Mixtures of Trees
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 7 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
MLDM
2007
Springer
14 years 3 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...
ECML
2005
Springer
14 years 2 months ago
On Discriminative Joint Density Modeling
Abstract. We study discriminative joint density models, that is, generative models for the joint density p(c, x) learned by maximizing a discriminative cost function, the condition...
Jarkko Salojärvi, Kai Puolamäki, Samuel ...
ICMCS
2009
IEEE
97views Multimedia» more  ICMCS 2009»
13 years 7 months ago
Some new directions in graph-based semi-supervised learning
In this position paper, we first review the state-of-the-art in graph-based semi-supervised learning, and point out three limitations that are particularly relevant to multimedia ...
Xiaojin Zhu, Andrew B. Goldberg, Tushar Khot
ECML
2007
Springer
14 years 1 months ago
Ensembles of Multi-Objective Decision Trees
Abstract. Ensemble methods are able to improve the predictive performance of many base classifiers. Up till now, they have been applied to classifiers that predict a single target ...
Dragi Kocev, Celine Vens, Jan Struyf, Saso Dzerosk...