A Novel and Efficient Spatio-Temporal Colocation Pattern Mining Algorithm

被引:0
作者
Meshram, Swati [1 ,2 ]
Wagh, Kishor P. [3 ]
机构
[1] Govt Coll Engn, Dept Comp Sci & Engn, Amravati, Maharashtra, India
[2] SNDT Womens Univ, Dept Comp Sci, Mumbai, Maharashtra, India
[3] Govt Coll Engn, Dept Informat Technol, Amravati, Maharashtra, India
关键词
Co-location; pattern mining; spatio-temporal; neighbourhood; clustering; CO-LOCATION PATTERN;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Colocation pattern mining approaches aim at discovering neighboring relationships of distinct spatial features in geographic and temporal space.With big spatio-temporal dataset, there is large number of patterns often discovered. Then it is of importance to discover meaningful and patterns of interest which come as an aid in applications in use for humans and commercial use. To discover interesting patterns, we present in this article a co -location pattern mining algorithmic framework by considering neighbourhood, clustering, hashing, and mining methods. Neighbourhood relationship describes the closeness between the entities. The results of neighbourhood could be varied by varying the distance threshold. These objects exhibiting neighbouring entities are grouped using clustering technique. Clustering is a classical research approach that produces grouping of the entities. A clustering technique has been presented in the paper for spatio-temporal dimension that offers the advantage of faster grouping based on the neighbourhood relationship. Finally, a hash structure is utilized for faster access and retrieval of patterns. The proposed mining algorithm along with the distance and time threshold efficiently discovers the interesting spatio-temporal patterns and validates the patterns. The experiment conducted shows that the proposed co -location algorithm method yields effective and efficient outcome.
引用
收藏
页码:1436 / 1446
页数:11
相关论文
共 50 条
  • [21] STenSr: Spatio-temporal tensor streams for anomaly detection and pattern discovery
    Lei Shi
    Aryya Gangopadhyay
    Vandana P. Janeja
    Knowledge and Information Systems, 2015, 43 : 333 - 353
  • [22] A novel spatio-temporal clustering algorithm with applications on COVID-19 data from the United States
    Deb, Soudeep
    Karmakar, Sayar
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2023, 188
  • [23] Windowed nearest neighbour method for mining spatio-temporal clusters in the presence of noise
    Pei, Tao
    Zhou, Chenghu
    Zhu, A-Xing
    Li, Baolin
    Qin, Chengzhi
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2010, 24 (06) : 925 - 948
  • [24] Access patterns mining from massive spatio-temporal data in a smart city
    Xiong, Lian
    Liu, Xiaojun
    Guo, Daixin
    Hu, Zhihua
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S6031 - S6041
  • [25] Moving Object Grouping Rule Mining Based on Accumulated Spatio-temporal Data
    Yang, Guodong
    Wang, Xiang
    Huang, Zhitao
    2017 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND APPLICATIONS (ICCIA), 2017, : 57 - 62
  • [26] Mining of Cascading Spatio-Temporal Frequent Patterns from Massive Data Sets
    Vasavi, M.
    Murugan, A.
    Sharma, K. Venkatesh
    IMPENDING INQUISITIONS IN HUMANITIES AND SCIENCES, ICIIHS-2022, 2024, : 334 - 343
  • [27] Access patterns mining from massive spatio-temporal data in a smart city
    Lian Xiong
    Xiaojun Liu
    Daixin Guo
    Zhihua Hu
    Cluster Computing, 2019, 22 : 6031 - 6041
  • [28] Spatio-temporal convolution kernels
    Konstantin Knauf
    Daniel Memmert
    Ulf Brefeld
    Machine Learning, 2016, 102 : 247 - 273
  • [29] Spatio-temporal convolution kernels
    Knauf, Konstantin
    Memmert, Daniel
    Brefeld, Ulf
    MACHINE LEARNING, 2016, 102 (02) : 247 - 273
  • [30] Spatio-temporal image segmentation using optical flow and clustering algorithm
    Galic, S
    Loncaric, S
    IWISPA 2000: PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS, 2000, : 63 - 68