1 Answers

An incremental decision tree algorithm is an online machine learning algorithm that outputs a decision tree. Many decision tree methods, such as C4.5, construct a tree using a complete dataset. Incremental decision tree methods allow an existing tree to be updated using only new individual data instances, without having to re-process past instances. This may be useful in situations where the entire dataset is not available when the tree is updated , the original data set is too large to process or the characteristics of the data change over time.

6 views

Related Questions

What is Seed tree?
1 Answers 5 Views
What is CTQ tree?
1 Answers 5 Views
What is Tree (graph theory)?
1 Answers 5 Views
What is Early decision?
1 Answers 5 Views
What is Decision stump?
1 Answers 5 Views