保护测量回路是电力系统继电保护的基石,其误差评估对电网安稳运维举足轻重。针对保护测量回路静态隐藏误差可能诱发保护误动/拒动的风险且难以在线监测问题,提出了一种基于递推主元分析和改进灰狼算法优化极限学习机(recursive princip...保护测量回路是电力系统继电保护的基石,其误差评估对电网安稳运维举足轻重。针对保护测量回路静态隐藏误差可能诱发保护误动/拒动的风险且难以在线监测问题,提出了一种基于递推主元分析和改进灰狼算法优化极限学习机(recursive principal component analysis and extreme learning machine optimized by grey wolf optimization,RPCA-GELM)数据驱动的保护测量回路误差评估方法。首先基于电力系统正常运行下历史数据与实时数据,应用RPCA技术在线更新主元特征模型以缩短评估时间,进一步引入4种统计算法生成4类误差监测特征量,构建误差综合评判方法进行特征优选,提升误差评估准确率。然后针对模型评估精度取决于关键参数C、σ,引入国际无限折叠混沌映射策略对灰狼算法进行优化,以提升参数寻优精度和收敛速度,在此基础上结合ELM算法提出了基于GELM的保护测量回路误差评估方法。最后通过多组对比实验验证了所提方法能实现模型性能优化,且相对其他方法有效提升了保护测量回路误差评估准确率与精度。展开更多
A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is oppo...A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.展开更多
文摘保护测量回路是电力系统继电保护的基石,其误差评估对电网安稳运维举足轻重。针对保护测量回路静态隐藏误差可能诱发保护误动/拒动的风险且难以在线监测问题,提出了一种基于递推主元分析和改进灰狼算法优化极限学习机(recursive principal component analysis and extreme learning machine optimized by grey wolf optimization,RPCA-GELM)数据驱动的保护测量回路误差评估方法。首先基于电力系统正常运行下历史数据与实时数据,应用RPCA技术在线更新主元特征模型以缩短评估时间,进一步引入4种统计算法生成4类误差监测特征量,构建误差综合评判方法进行特征优选,提升误差评估准确率。然后针对模型评估精度取决于关键参数C、σ,引入国际无限折叠混沌映射策略对灰狼算法进行优化,以提升参数寻优精度和收敛速度,在此基础上结合ELM算法提出了基于GELM的保护测量回路误差评估方法。最后通过多组对比实验验证了所提方法能实现模型性能优化,且相对其他方法有效提升了保护测量回路误差评估准确率与精度。
基金supported by the National Natural Science Foundation of China(51006052)the NUST Outstanding Scholar Supporting Program
文摘A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.
