Sciweavers

6 search results - page 1 / 2
» Learning Nested Halfspaces and Uphill Decision Trees
Sort
View
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
13 years 10 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
COLT
2001
Springer
13 years 9 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour
AAAI
2011
12 years 4 months ago
Incorporating Boosted Regression Trees into Ecological Latent Variable Models
Important ecological phenomena are often observed indirectly. Consequently, probabilistic latent variable models provide an important tool, because they can include explicit model...
Rebecca A. Hutchinson, Li-Ping Liu, Thomas G. Diet...
TCBB
2010
112views more  TCBB 2010»
12 years 11 months ago
A Study of Hierarchical and Flat Classification of Proteins
Automatic classification of proteins using machine learning is an important problem that has received significant attention in the literature. One feature of this problem is that e...
Arthur Zimek, Fabian Buchwald, Eibe Frank, Stefan ...