Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

AAAI
2006

favoriteEmaildiscussreport

122views Intelligent Agents» more AAAI 2006»

A Fast Decision Tree Learning Algorithm

13 years 6 months ago

A Fast Decision Tree Learning Algorithm

Download www.cs.unb.ca

There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast tree-growing algorithm without substantial decrease in accuracy and substantial increase in space complexity is essential. In this paper, we present a novel, fast decision-tree learning algorithm that is based on a conditional independence assumption. The new algorithm has a time complexity of O(m

Jiang Su, Harry Zhang

Real-time Traffic

AAAI 2006 | Algorithm | Decision-tree Learning Algorithm | Intelligent Agents | Time Complexity |

claim paper

Related Content

» A Fast BottomUp Decision Tree Pruning Algorithm with NearOptimal Generalization

» A Fast MB Mode Decision Algorithm for MPEG2 to H264 PFrame Transcoding

» Inverse halftoning by decision tree learning

» Anytime Induction of Decision Trees An Iterative Improvement Approach

» Learning decision trees from dynamic data streams

» A Simpler Analysis of the Multiway Branching Decision Tree Boosting Algorithm

» Learning with Local Drift Detection

» Generating Better Decision Trees

» Fast Perceptron Decision Tree Learning from Evolving Data Streams

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	AAAI
Authors	Jiang Su, Harry Zhang

Comments (0)