Abstract
An uncertain geo-referenced transactional database represents the probabilistic data produced by stationary spatial objects observing a particular phenomenon over time. Useful patterns that can empower the users to achieve socio-economic development lie hidden in this database. Finding these patterns is challenging as the existing frequent pattern mining studies ignore the spatial information of the items in a database. This paper proposes a generic model of Geo-referenced Frequent Patterns (GFPs) that may exist in an uncertain geo-referenced transactional database. This paper also introduces two new upper-bound constraints, namely “neighborhood-aware prefix item camp” and “neighborhood-aware expected support”, to effectively reduce the search space and the computational cost of finding the desired patterns. An efficient neighborhood-aware pattern-growth algorithm has also been presented in this paper to find all GFPs in a database. Experimental results demonstrate that our algorithm is efficient.
R. U. Kiran—First three authors have equally contributed to the paper.
This research was partially funded by JSPS Kakenhi 21K12034.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aggarwal, C.C., Yu, P.S.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng. 21(5), 609–623 (2009)
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 207–216 (1993)
Ansari, M., Ahmad, A., Khan, S., Bhushan, G., Siddique, M.: Spatiotemporal clustering: a review. Artif. Intell. Rev. 53, 2381–2423 (2020). https://doi.org/10.1007/s10462-019-09736-1
Chui, C.-K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 47–58. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71701-0_8
GFP: Geo-referenced Frequent Pattern (GFP) (2022). https://github.com/Likhitha-palla/GeoReferencedFrequentPatterns.git. Accessed 8 Dec 2022
Kiran, R.U., Shrivastava, S., Fournier-Viger, P., Zettsu, K., Toyoda, M., Kitsuregawa, M.: Discovering frequent spatial patterns in very large spatiotemporal databases. In: SIGSPATIAL, pp. 445–448 (2020)
Leung, C.K., MacKinnon, R.K., Tanbeer, S.K.: Fast algorithms for frequent itemset mining from uncertain data. In: ICDM, pp. 893–898 (2014)
Leung, C.K.S., Tanbeer, S.K.: PUF-Tree: a compact tree structure for frequent pattern mining of uncertain data. In: PAKDD, pp. 13–25 (2013)
Luna, J.M., Fournier-Viger, P., Ventura, S.: Frequent itemset mining: a 25 years review. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 9(6), e1329 (2019)
Veena, P., et al.: Discovering fuzzy geo-referenced periodic-frequent patterns in geo-referenced time series databases. In: FUZZ-IEEE, pp. 1–8 (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Likhitha, P., Veena, P., Rage, U.K., Zettsu, K. (2023). Discovering Geo-referenced Frequent Patterns in Uncertain Geo-referenced Transactional Databases. In: Kashima, H., Ide, T., Peng, WC. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2023. Lecture Notes in Computer Science(), vol 13937. Springer, Cham. https://doi.org/10.1007/978-3-031-33380-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-33380-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-33379-8
Online ISBN: 978-3-031-33380-4
eBook Packages: Computer ScienceComputer Science (R0)