Sciweavers

352 search results - page 25 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
ICAART
2010
INSTICC
16 years 3 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 6 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ICIP
2007
IEEE
15 years 10 months ago
H.263 to H.264 Transconding using Data Mining
1 In this paper, we propose the use of data mining algorithms to create a macroblock partition mode decision algorithm for inter-frame prediction, to be used as part of a high-effi...
Gerardo Fernández-Escribano, Jens Bialkowsk...
ICMLA
2010
15 years 4 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa
ICDM
2009
IEEE
146views Data Mining» more  ICDM 2009»
16 years 1 months ago
Induction of Mean Output Prediction Trees from Continuous Temporal Meteorological Data
: In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed Mean Output ...
Dima Alberg, Mark Last, Roni Neuman, Avi Sharon