Sciweavers

225 search results - page 23 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 12 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
AIIA
2003
Springer
13 years 11 months ago
Abduction in Classification Tasks
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
Maurizio Atzori, Paolo Mancarella, Franco Turini
WWW
2011
ACM
13 years 2 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
JAIR
2006
105views more  JAIR 2006»
13 years 7 months ago
Active Learning with Multiple Views
Active learners alleviate the burden of labeling large amounts of data by detecting and asking the user to label only the most informative examples in the domain. We focus here on...
Ion Muslea, Steven Minton, Craig A. Knoblock