Hierarchical mining algorithm for high dimensional spatiotemporal big data based on association rules

¹ Big Data Center of State Grid Corporation of China, Beijing, 100052, China
² AnHui Jiyuan Software Co., Ltd, Hefei, Anhui, 230088, China
³ Beijing Sgitg Accenture Information Technology Center Co., Ltd, Beijing, 100052 China

^* E-mail: dongxinwei@sgitg.sgcc.com.cn

Abstract

The traditional data mining algorithm focuses too much on a single dimension of data time or space, ignoring the association between time and space, which leads to a large amount of computation and low processing efficiency of the mining algorithm and makes it difficult to guarantee the final data mining effect. In response to the above problems, a hierarchical mining algorithm based on association rules for high-dimensional spatio-temporal big data is proposed. Based on the traditional association rules, after establishing the association rules of spatio-temporal data, the data to be mined are cleaned for redundancy. After selecting the local linear embedding algorithm to reduce the dimensionality of the data, a hierarchical mining strategy is developed to realize high-dimensional spatio-temporal big data mining by searching frequent predicates to form a spatio-temporal transaction database. The simulation experiment results verify that the algorithm has high complexity and can effectively reduce the processing volume, which can improve the processing efficiency by at least 56.26% compared with other algorithms.