A related degree-based frequent pattern mining algorithm for railway fault data

Abstract

It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm. However, high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale up. In the context of such needs, we propose a related degree-based frequent pattern mining algorithm, named Related High Utility Quantitative Item set Mining (RHUQI-Miner), to enable the effective mining of railway fault data. The algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees, reducing redundancy and invalid frequent patterns. Subsequently, it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the algorithm. The experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process, thus providing data support for differentiated and precise maintenance strategies.

Keywords

High utility / Quantitative / Frequent pattern mining / Related degree pruning / Fixed pattern length

Declaration of Competing Interest

The authors declare the following financial interests/personal relationships which may be considered as potential competing interests:Ding Ding reports financial support was provided by Central Universities. If there are other authors, they declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgements

This work was supported by the Research on Key Technologies and Typical Applications of Big Data in Railway Production and Operation (P2023S006) and the Fundamental Research Funds for the Central Universities (2022JBZY023).

References

[1] P. Fournier-Viger, J.C.W. Lin, R.U. Kiran, et al., A survey of sequential pattern mining. Data Sci. Pattern Recogn., 1(1)(2017), pp. 54-77.

[2] R. Agrawal, R. Srikant. Fast algorithms for mining association rules. Proc. 20th Int. Conf. Very Large Data Bases, VLDB, 1215 (1994), pp. 487-499.

[3] S. Krishnamoorthy. Pruning strategies for mining high utility itemsets. Exp. Syst. Appl., 42(5)(2015), pp. 2371-2381.

[4] P. Fournier-Viger, J.C.W. Lin, Q.H. Duong, et al., FHM: Faster high-utility itemset mining using length upper-bound reduction. International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Springer International Publishing, Cham (2016), pp. 115-127.

[5] C.W. Wu, P. Fournier-Viger, J.Y. Gu, et al., Mining closed+ high utility itemsets without candidate generation. 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI), IEEE, New York (2015), pp. 187-194.

[6] C. Zhang, Y.X. Guo. Fault prediction of EMU based on improved FP-Growth algorithm. Railw. Comput. Appl., 26(12)(2017), pp. 1-4.

[7] Q.H. Duong, P. Fournier-Viger, H. Ramampiaro, et al., Efficient high utility itemset mining using buffered utility-lists. Appl. Intel., 48 (2018), pp. 1859-1877.

[8] C.W. Wu, P. Fournier-Viger, J.Y. Gu, et al., Mining compact high utility item sets without candidate generation. High-utility Pattern Mining, Springer, Cham (2019), pp. 279-302.

[9] V.S. Tseng, C.W. Wu, B.E. Shie, et al., UP-Growth: an efficient algorithm for high utility itemset mining. Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discov. Data Min. (2010), pp. 253-262.

[10] V.S. Tseng, B.E. Shie, C.W. Wu, et al., Efficient algorithms for mining high utility item sets from transaction databases. IEEE Trans. Knowl. Data Eng., 25(8)(2012), pp. 1772-1786.

[11] C.H. Li, C.W. Wu, V.S. Tseng. Efficient vertical mining of high utility quantitative itemsets. 2014 IEEE International Conference on Granular Computing (GrC), IEEE, New York (2014), pp. 155-160.

[12] M. Liu, J. Qu. Mining high utility itemsets without candidate generation. Proceedings of the 21st ACM International Conference on Information and Knowledge Management, ACM, New York (2012), pp. 55-64.

[13] C.H. Li, C.W. Wu, J.T. Huang, et al., An efficient algorithm for mining high utility quantitative item sets. Proceedings of the 2019 International Conference on Data Mining Workshops (ICDMW), IEEE, New York (2019), pp. 1005-1012.

[14] M. Nouioua, P. Fournier-Viger, C.W. Wu, et al., FHUQI-Miner: fast high utility quantitative item set mining. Appl. Intel., 51(10)(2021), pp. 6785-6809.

[15] P. Fournier-Viger, C.W. Wu, S. Zida, et al., FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. Foundations of Intelligent Systems: 21st International Symposium, ISMIS 2014, Springer International Publishing, Denmark (2014), pp. 83-92.

[16] M. Nouioua, P. Fournier-Viger, W. Gan, et al., TKQ: Top-k quantitative high utility itemset mining. International Conference on Advanced Data Mining and Applications, Springer International Publishing, Cham (2022), pp. 16-28.

[17] J. Han, J. Pei, Y. Yin. Mining frequent patterns without candidate generation. Acm. Sigmod. Rec., 29(2)(2000), pp. 1-12.

[18] Z.H. Zhang, X.T. Zhang. Fault diagnosis method of railway signal equipment based on association rules. Railw. Stand. Des., 66(4)(2022), pp. 175-181.

[19] W.P. Wu, L. Liu, Y. Xue, et al., Optimization of operation and maintenance strategies for railway catenary based on association mining. Railw. Trans. Econ., 45(11)(2023), pp. 115-121.

[20] R. Agrawal, R. Srikant. Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases., IEEE, New York (1994).

[21] N. Wang, X. Chang, X. Yang, et al., Association analysis method for railway accident hazards based on the improved Apriori algorithm. Shandong Sci., 36(5)(2023), pp. 67-74.

[22] K. Qian, S. Gao, L. Yu. Marginal frequent item set mining for fault prevention of railway overhead contact system. ISA Trans., 126(7)(2022), pp. 276-287.