一种基于改进FP-Growth算法的动车组故障预测研究
|
摘要
动车组的故障预测和健康管理是目前的研究热点,其中,故障预测的关键是寻找动车组故障信息和状态信息之间的关联关系。频繁模式增长(FP-Growth)算法是关联规则挖掘中的经典算法之一,用来挖掘频繁项集。针对动车组故障数据提出了一种改进的FP-Growth(IFP-Growth,Improved FPGrowth)算法,采用先序遍历FP-tree的方法产生条件模式基。实验结果表明,IFP-Growth算法能够有效提高动车组故障数据挖掘的效率,并且能够有效地挖掘动车组故障信息和状态信息之间的关联关系。
Prognostics and Health Management(PHM) of EMU is the hotspot of current research. The key of fault prediction is to find the relation between fault information and status information of EMU. The FP-Growth algorithm is one of the classical algorithms in association rule mining. It is used to excavate frequent item sets. This paper proposed an improved FP-Growth(IFP-Growth) algorithm for EMU fault data. It adopted pre-traversing FP-tree to generate conditional pattern bases. The experimental results showed that the IFP-Growth algorithm could effectively improve the efficiency of data mining of EMU faults and find the relation between fault information and status information of EMU.
Prognostics and Health Management(PHM) of EMU is the hotspot of current research. The key of fault prediction is to find the relation between fault information and status information of EMU. The FP-Growth algorithm is one of the classical algorithms in association rule mining. It is used to excavate frequent item sets. This paper proposed an improved FP-Growth(IFP-Growth) algorithm for EMU fault data. It adopted pre-traversing FP-tree to generate conditional pattern bases. The experimental results showed that the IFP-Growth algorithm could effectively improve the efficiency of data mining of EMU faults and find the relation between fault information and status information of EMU.
引文
[1]常振臣,张海峰.动车组PHM技术应用现状及展望[J].电力机车与城轨车辆,2016,39(1):1-4.
[2]钟雁,马海漫,张春.改进的FP-tree算法在动车组故障诊断中的应用研究[J].交通运输系统工程与信息,2013,13(6):105-111.
[3]吴宗翰.关联规则挖掘算法研究及其在交通事故分析中的应用[D].天津:南开大学,2015.
[4]尹士闪,马增强,毛晚堆.基于频繁项目集链式存储方法的关联规则算法[J].计算机工程与设计,2012,33(3):1002-1007.
[5]周诗慧.基于Hadoop的改进的并行FP-Growth算法[D].济南:山东大学,2013.
[6]Jiawei Han,Jian Pei,Yiwen Yin.Mining frequent pattems without candidate generation[J].ACM SIGMOD Record,2000,29(2):1-12.
[7]王新宇,杜孝平,谢昆青.FP-growth算法的实现方法研究[J].计算机工程与应用,2004,40(9):174-176.
[8]Shandong Ji,Dengyin Zhang,Liu Zhang.Paths sharing based FP-growth data mining algorithms[C].International Conference on Wireless Communications&Signal Processing(WCSP),2016:1-4.
[9]吕雪骥,李龙澍.FP-Growth算法Map Reduce化研究[J].计算机技术与发展,2012,22(11):123-126.
[10]L.Deng,Y.Lou.Improvement and Research of FP-Growth Algorithm Based on Distributed Spark[C]//International Conference on Cloud Computing and Big Data(CCBD),2015:105-108.
[11]章志刚,吉根林.一种基于FP-Growth的频繁项目集并行挖掘算法[J].计算机工程与应用,2014,50(2):103-106.
[2]钟雁,马海漫,张春.改进的FP-tree算法在动车组故障诊断中的应用研究[J].交通运输系统工程与信息,2013,13(6):105-111.
[3]吴宗翰.关联规则挖掘算法研究及其在交通事故分析中的应用[D].天津:南开大学,2015.
[4]尹士闪,马增强,毛晚堆.基于频繁项目集链式存储方法的关联规则算法[J].计算机工程与设计,2012,33(3):1002-1007.
[5]周诗慧.基于Hadoop的改进的并行FP-Growth算法[D].济南:山东大学,2013.
[6]Jiawei Han,Jian Pei,Yiwen Yin.Mining frequent pattems without candidate generation[J].ACM SIGMOD Record,2000,29(2):1-12.
[7]王新宇,杜孝平,谢昆青.FP-growth算法的实现方法研究[J].计算机工程与应用,2004,40(9):174-176.
[8]Shandong Ji,Dengyin Zhang,Liu Zhang.Paths sharing based FP-growth data mining algorithms[C].International Conference on Wireless Communications&Signal Processing(WCSP),2016:1-4.
[9]吕雪骥,李龙澍.FP-Growth算法Map Reduce化研究[J].计算机技术与发展,2012,22(11):123-126.
[10]L.Deng,Y.Lou.Improvement and Research of FP-Growth Algorithm Based on Distributed Spark[C]//International Conference on Cloud Computing and Big Data(CCBD),2015:105-108.
[11]章志刚,吉根林.一种基于FP-Growth的频繁项目集并行挖掘算法[J].计算机工程与应用,2014,50(2):103-106.