Sciweavers

1107 search results - page 75 / 222
» Multi-instance tree learning
Sort
View
KI
2002
Springer
14 years 11 months ago
Incremental Fuzzy Decision Trees
Abstract. We present a new classification algorithm that combines three properties: It generates decision trees, which proved a valuable and intelligible tool for classification an...
Marina Guetova, Steffen Hölldobler, Hans-Pete...
NECO
2002
117views more  NECO 2002»
14 years 11 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille
63
Voted
ICML
2006
IEEE
16 years 4 days ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...
ACL
2001
15 years 22 days ago
Automated Subcategorization of Named Entities
There has been much interest in the recent past concerning the possibilities for automated categorization of named entities. The research presented here describes a method for the...
Michael Fleischman
WWW
2011
ACM
14 years 6 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...