Discovering Partial Periodic Spatial Patterns in Spatiotemporal Databases
Rage Uday Kiran, C. Saideep, Koji Zettsu, Masashi Toyoda, Masaru Kitsuregawa, P. Krishna Reddy · 2019
Finding partial periodic patterns in very large databases is a challenging problem of great importance in many real-world applications. Most previous work focused on finding these patterns in temporal (or transactional) databases and did not recognize the spatial characteristics of items. In this paper, we propose a more flexible model of partial periodic spatial pattern that may be present in spatiotemporal database. Three constraints, maximum inter-arrival time(maxIAT), minimum period-support(minPS) and maximum distance(maxDist), have been employed to determine the interestingness of a pattern in a spatiotemporal database. The maxIAT controls the maximum duration in which a pattern must reappear to consider its occurrence as periodic within the data. The minPS controls the minimum number of periodic occurrences of a pattern within the data. The maxDist controls the maximum distance between the items in a pattern. All patterns satisfying these three constraints are returned. An efficient algorithm, called SpatioTemporal-Equivalence CLAss Transformation (ST-ECLAT), has also been described to discover all partial periodic spatial patterns in a spatiotemporal database. This algorithm employs a novel smart depth-first search technique to discover desired patterns effectively. Experimental results demonstrate that the proposed algorithm is efficient. We also present a case study in which we apply our model to find useful information in the air pollution database.