Sciweavers

ICML
2004
IEEE
14 years 4 months ago
Ensembles of nested dichotomies for multi-class problems
Nested dichotomies are a standard statistical technique for tackling certain polytomous classification problems with logistic regression. They can be represented as binary trees ...
Eibe Frank, Stefan Kramer
ICML
2004
IEEE
14 years 4 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
ICML
2004
IEEE
14 years 4 months ago
Redundant feature elimination for multi-class problems
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
Annalisa Appice, Michelangelo Ceci, Simon Rawles, ...
ICML
2004
IEEE
15 years 8 days ago
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
Zhihua Zhang, Dit-Yan Yeung, James T. Kwok
ICML
2004
IEEE
15 years 8 days ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
ICML
2004
IEEE
15 years 8 days ago
Learning and evaluating classifiers under sample selection bias
Classifier learning methods commonly assume that the training data consist of randomly drawn examples from the same distribution as the test examples about which the learned model...
Bianca Zadrozny
ICML
2004
IEEE
15 years 8 days ago
Utile distinction hidden Markov models
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
Daan Wierstra, Marco Wiering
ICML
2004
IEEE
15 years 8 days ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
ICML
2004
IEEE
15 years 8 days ago
A hierarchical method for multi-class support vector machines
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
Volkan Vural, Jennifer G. Dy