Machine learningMachine learning
在线决策树
在线决策树是一种决策树，它从连续的数据流中增量式地生长，而不重新访问过去的样本。占主导地位的算法是 Hoeffding 树（VFDT），它使用 Hoeffding 界来决定何时在节点上看到了足够多的样本可以有信心地进行分裂，从而能够对潜在的无限数据流进行可扩展的实时分类。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Domingos, P., & Hulten, G. (2000). Mining very fast data streams. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 71–80). ACM. link ↗
- Hulten, G., Spencer, L., & Domingos, P. (2001). Mining time-changing data streams. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 97–106). ACM. DOI: 10.1145/502512.502529 ↗
如何引用本页
ScholarGate. (2026, June 3). Online Decision Tree (Incremental / Streaming Decision Tree Learning). ScholarGate. https://scholargate.app/zh/machine-learning/online-decision-tree
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 决策树机器学习↔ compare
- 在线梯度提升机器学习↔ compare
- 在线学习机器学习↔ compare
- 在线朴素贝叶斯机器学习↔ compare
- 在线随机森林机器学习↔ compare
- 半监督决策树机器学习↔ compare