Sciweavers

92 search results - page 8 / 19
» Efficient Algorithms for Decision Tree Cross-validation
Sort
View
ICAART
2010
INSTICC
14 years 4 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
ICIP
2009
IEEE
13 years 5 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
IPPS
1999
IEEE
13 years 12 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
SGAI
2007
Springer
14 years 1 months ago
Towards a Computationally Efficient Approach to Modular Classification Rule Induction
Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision T...
Frederic T. Stahl, Max Bramer