首页> 外文会议>IEEE Conference on Energy Internet and Energy System Integration >Frequent Itemsets Mining of SCADA Data Based on FP-Growth Algorithm
【24h】

Frequent Itemsets Mining of SCADA Data Based on FP-Growth Algorithm

机译:基于FP-Grangic算法的SCADA数据频繁出现频繁项目

获取原文

摘要

When the powergrid fails, a large number of fault data will be transmitted to the dispatching center of SCADA system. Effective and fast processing of these data can minimize the loss of fault and restore the power supply quickly. In this paper, FP growth algorithm is used to mine frequent itemsets, and event folding window is used to discretize the data for easy processing. Through the correlation analysis of actual SCADA data, the results show that the method has a strong practical engineering significance for speeding up the fault analysis after the power grid fault occurs.
机译:当PowerGrid失败时,大量故障数据将被传送到SCADA系统的调度中心。这些数据的有效和快速处理可以最大限度地减少故障丢失并快速恢复电源。在本文中,FP生长算法用于频繁的项目集,并且使用事件折叠窗口来离散数据以便于处理。通过实际SCADA数据的相关性分析,结果表明,该方法具有强大的实用工程意义,在电网故障发生后加速故障分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号