期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
A Novel Reduced Error Pruning Tree Forest with Time-Based Missing Data Imputation(REPTF-TMDI)for Traffic Flow Prediction
1
作者 Yunus Dogan Goksu Tuysuzoglu +4 位作者 Elife Ozturk Kiyak Bita Ghasemkhani Kokten Ulas Birant Semih Utku Derya Birant 《Computer Modeling in Engineering & Sciences》 2025年第8期1677-1715,共39页
Accurate traffic flow prediction(TFP)is vital for efficient and sustainable transportation management and the development of intelligent traffic systems.However,missing data in real-world traffic datasets poses a sign... Accurate traffic flow prediction(TFP)is vital for efficient and sustainable transportation management and the development of intelligent traffic systems.However,missing data in real-world traffic datasets poses a significant challenge to maintaining prediction precision.This study introduces REPTF-TMDI,a novel method that combines a Reduced Error Pruning Tree Forest(REPTree Forest)with a newly proposed Time-based Missing Data Imputation(TMDI)approach.The REP Tree Forest,an ensemble learning approach,is tailored for time-related traffic data to enhance predictive accuracy and support the evolution of sustainable urbanmobility solutions.Meanwhile,the TMDI approach exploits temporal patterns to estimate missing values reliably whenever empty fields are encountered.The proposed method was evaluated using hourly traffic flow data from a major U.S.roadway spanning 2012-2018,incorporating temporal features(e.g.,hour,day,month,year,weekday),holiday indicator,and weather conditions(temperature,rain,snow,and cloud coverage).Experimental results demonstrated that the REPTF-TMDI method outperformed conventional imputation techniques across various missing data ratios by achieving an average 11.76%improvement in terms of correlation coefficient(R).Furthermore,REPTree Forest achieved improvements of 68.62%in RMSE and 70.52%in MAE compared to existing state-of-the-art models.These findings highlight the method’s ability to significantly boost traffic flow prediction accuracy,even in the presence of missing data,thereby contributing to the broader objectives of sustainable urban transportation systems. 展开更多
关键词 Machine learning traffic flow prediction missing data imputation reduced error pruning tree(repTree) sustainable transportation systems traffic management artificial intelligence
在线阅读 下载PDF
基于改进决策树的安全约束经济调度的冗余约束识别方法
2
作者 夏卓延 张大海 +3 位作者 严嘉豪 李振宇 毛文博 杨大坤 《电力系统保护与控制》 北大核心 2026年第5期61-75,共15页
针对安全约束经济调度(security-constrained economic dispatch,SCED)中冗余约束的识别目前尚缺乏快速有效的识别方法。同时,数据驱动方法容易产生假正例(false positive,FP)误判,从而影响系统安全性。为此,提出了一种改进的决策树(dec... 针对安全约束经济调度(security-constrained economic dispatch,SCED)中冗余约束的识别目前尚缺乏快速有效的识别方法。同时,数据驱动方法容易产生假正例(false positive,FP)误判,从而影响系统安全性。为此,提出了一种改进的决策树(decision tree,DT)算法,即改进的分类回归树(classification and regression tree,CART)算法,以及改进的错误率降低剪枝(reduced error pruning,REP)算法,以实现对冗余约束的快速识别。首先,阐述SCED模型与CART原理。其次,构建了冗余约束识别的特征工程及数据预处理方法。然后,提出了融合FP惩罚机制的改进CART算法及基于FP比的REP剪枝策略。最后,通过SG-126系统验证了所提改进算法在较好地适应极端FP敏感场景的同时,能够快速、准确地识别冗余约束。冗余约束识别准确率达到95.13%,FP误判率为0,在削减冗余约束后系统调度时间减少了88.22%。 展开更多
关键词 安全约束经济调度 冗余约束识别 分类回归树 错误率降低剪枝
在线阅读 下载PDF
CDC与REP结合的决策树剪枝优化算法 被引量:4
3
作者 常旭 李义杰 刘万军 《计算机工程》 CAS CSCD 2012年第14期32-34,共3页
为改善剪枝算法单一的事前剪枝或事后剪枝导致分类响应时间长、准确度低的问题,在REP事后剪枝的基础上,提出一种CDC与REP结合的决策树剪枝优化算法。使用CDC算法在生成决策树的同时,利用左右子树节点差异比来排除部分非叶子节点,决策树... 为改善剪枝算法单一的事前剪枝或事后剪枝导致分类响应时间长、准确度低的问题,在REP事后剪枝的基础上,提出一种CDC与REP结合的决策树剪枝优化算法。使用CDC算法在生成决策树的同时,利用左右子树节点差异比来排除部分非叶子节点,决策树生成后再通过REP算法对决策树进一步剪枝。实验结果表明,该算法可避免庞大决策树的生成过程过于细化导致过于拟合的现象,与其他算法相比,能减少分裂时间,提高决策树分裂的正确率。 展开更多
关键词 决策树 剪枝 CDC算法 rep算法 叶子节点
在线阅读 下载PDF
决策树剪枝方法的比较 被引量:43
4
作者 魏红宁 《西南交通大学学报》 EI CSCD 北大核心 2005年第1期44-48,共5页
为在决策树剪枝中正确选择剪枝方法,基于理论分析和算例详细地比较了当前主要的4种剪枝方法的计算复杂性、剪枝方式、误差估计和理论基础.与PEP相比,MEP产生的树精度较小且树较大;REP是最简单的剪枝方法之一,但需要独立剪枝集;在同样精... 为在决策树剪枝中正确选择剪枝方法,基于理论分析和算例详细地比较了当前主要的4种剪枝方法的计算复杂性、剪枝方式、误差估计和理论基础.与PEP相比,MEP产生的树精度较小且树较大;REP是最简单的剪枝方法之一,但需要独立剪枝集;在同样精度情况下,CCP比REP产生的树小.如果训练数据集丰富,可以选择REP,如果训练数据集较少且剪枝精度要求较高,则可以选用PEP. 展开更多
关键词 数据挖掘 决策树 事后剪枝 PEP MEP rep CCP
在线阅读 下载PDF
Improved Prediction of Slope Stability under Static and Dynamic Conditions Using Tree-BasedModels 被引量:3
5
作者 Feezan Ahmad Xiaowei Tang +2 位作者 Jilei Hu Mahmood Ahmad Behrouz Gordan 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第10期455-487,共33页
Slope stability prediction plays a significant role in landslide disaster prevention and mitigation.This paper’s reduced error pruning(REP)tree and random tree(RT)models are developed for slope stability evaluation a... Slope stability prediction plays a significant role in landslide disaster prevention and mitigation.This paper’s reduced error pruning(REP)tree and random tree(RT)models are developed for slope stability evaluation and meeting the high precision and rapidity requirements in slope engineering.The data set of this study includes five parameters,namely slope height,slope angle,cohesion,internal friction angle,and peak ground acceleration.The available data is split into two categories:training(75%)and test(25%)sets.The output of the RT and REP tree models is evaluated using performance measures including accuracy(Acc),Matthews correlation coefficient(Mcc),precision(Prec),recall(Rec),and F-score.The applications of the aforementionedmethods for predicting slope stability are compared to one another and recently established soft computing models in the literature.The analysis of the Acc together with Mcc,and F-score for the slope stability in the test set demonstrates that the RT achieved a better prediction performance with(Acc=97.1429%,Mcc=0.935,F-score for stable class=0.979 and for unstable case F-score=0.935)succeeded by the REP tree model with(Acc=95.4286%,Mcc=0.896,F-score stable class=0.967 and for unstable class F-score=0.923)for the slope stability dataset The analysis of performance measures for the slope stability dataset reveals that the RT model attains comparatively better and reliable results and thus should be encouraged in further research. 展开更多
关键词 Slope stability seismic excitation static condition random tree reduced error pruning tree
在线阅读 下载PDF
Comparative Study on Decision Tree Techniques for Mobile Call Detail Record
6
作者 Suban Ravichandran Vijay Bhanu Srinivasan Chandrasekaran Ramasamy 《通讯和计算机(中英文版)》 2012年第12期1331-1335,共5页
Every mobile operator of today's world switches their technology over from 2G(second generation)to 3G(third generation)network.Operators are keen analyzing their CDR(call detail record)obtained over the past usage... Every mobile operator of today's world switches their technology over from 2G(second generation)to 3G(third generation)network.Operators are keen analyzing their CDR(call detail record)obtained over the past usage for predicting the behavior of their customers and their usage.The operators are willing to mine knowledge from real-world dataset which implies the pattern of user mentality on this changing world.To identify the usage of 2G and 3G services the classification models were trained using the data collected from PAKDD 2006 dataset.In order to obtain the prediction accuracy,the classifiers were evaluated using 10 folds cross validation.On comparing the results of the experiment,J48 performed more accurately and random tree consumed less time. 展开更多
关键词 DTT(decision tree techniques) J48 random forest random tree repTree(reduced error pruning tree) PAKDD CDR WEKA(Waikato environment for knowledge analysis).
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部