Sciweavers

1683 search results - page 159 / 337
» Learning with Mixtures of Trees
Sort
View
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
14 years 3 months ago
Ensembles of Balanced Nested Dichotomies for Multi-class Problems
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
Lin Dong, Eibe Frank, Stefan Kramer
ICMLA
2010
13 years 7 months ago
Boosting Multi-Task Weak Learners with Applications to Textual and Social Data
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
Jean Baptiste Faddoul, Boris Chidlovskii, Fabien T...
ICML
2000
IEEE
14 years 10 months ago
Discovering Homogeneous Regions in Spatial Data through Competition
If all features causing heterogeneity were observed, a mixture of experts approach (Jacobs et al., 1991) is likely to be superior to using a single model. When unobserved or very n...
Slobodan Vucetic, Zoran Obradovic
ICML
2005
IEEE
14 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ECML
2007
Springer
14 years 3 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou