...
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Incremental Optimization Mechanism for Constructing a Decision Tree in Data Stream Mining
【24h】

Incremental Optimization Mechanism for Constructing a Decision Tree in Data Stream Mining

机译:数据流挖掘中构建决策树的增量优化机制

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Imperfect data stream leads to tree size explosion and detrimental accuracy problems. Overfitting problem and the imbalanced class distribution reduce the performance of the original decision-tree algorithm for stream mining. In this paper, we propose an incremental optimization mechanism to solve these problems. The mechanism is called Optimized Very Fast Decision Tree (OVFDT) that possesses an optimized node-splitting control mechanism. Accuracy, tree size, and the learning time are the significant factors influencing the algorithm’s performance. Naturally a bigger tree size takes longer computation time. OVFDT is a pioneer model equipped with an incremental optimization mechanism that seeks for a balance between accuracy and tree size for data stream mining. It operates incrementally by a test-then-train approach. Three types of functional tree leaves improve the accuracy with which the tree model makes a prediction for a new data stream in the testing phase. The optimized node-splitting mechanism controls the tree model growth in the training phase. The experiment shows that OVFDT obtains an optimal tree structure in both numeric and nominal datasets.
机译:数据流不完善会导致树大小爆炸和准确性下降的问题。过度拟合问题和类分配不平衡降低了原始决策树算法用于流挖掘的性能。在本文中,我们提出了一种增量优化机制来解决这些问题。该机制称为优化超快速决策树(OVFDT),它具有优化的节点拆分控制机制。准确性,树大小和学习时间是影响算法性能的重要因素。自然,树的大小越大,计算时间就越长。 OVFDT是一种先驱模型,配备有递增的优化机制,可以在数据流挖掘的准确性和树大小之间寻求平衡。它通过“测试-然后-训练”方法逐步运行。三种类型的功能树叶子可以提高树模型在测试阶段对新数据流进行预测的准确性。优化的节点拆分机制在训练阶段控制树模型的增长。实验表明,OVFDT在数值和名义数据集上均获得了最佳的树形结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号