Sciweavers

2712 search results - page 105 / 543
» On learning algorithm selection for classification
Sort
View
IDA
2006
Springer
13 years 9 months ago
Classification of symbolic objects: A lazy learning approach
Symbolic data analysis aims at generalizing some standard statistical data mining methods, such as those developed for classification tasks, to the case of symbolic objects (SOs). ...
Annalisa Appice, Claudia d'Amato, Floriana Esposit...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 26 days ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ISMIS
2000
Springer
14 years 16 days ago
Prediction of Ordinal Classes Using Regression Trees
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
Stefan Kramer, Gerhard Widmer, Bernhard Pfahringer...
JMLR
2002
144views more  JMLR 2002»
13 years 8 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz
LION
2010
Springer
190views Optimization» more  LION 2010»
14 years 29 days ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber