.png){kind=icon}
返回
MCHT: A maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2021.114830.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Co-location patterns refer to subsets of Boolean spatial features with instances of these features frequently appear in nearby geographic space. Maximal co-location patterns are a compact representation of these patterns that lead users more easily to absorb results and make meaningful inferences. The current algorithms for maximal colocation pattern mining are based on a generate-test candidate model. The main execution time of this model is occupied by collecting co-location instances of candidates, which makes discovering maximal co-location patterns is still very challenging when data is big and/or dense. To take up the challenge, a novel maximal colocation pattern mining framework based on maximal cliques and hash tables (MCHT) is developed in this study. First, all maximal cliques that can compactly represent neighbor relationships between instances of a spatial data set are enumerated. The advantages of bit string operations are fully utilized to speed up the process of enumerating maximal cliques. Next, a participating instance hash table structure is constructed based on these maximal cliques. Then information about the co-location instances of maximal patterns can be queried and collected efficiently from the hash table. After that, by calculating participation indexes of these patterns to measure their prevalence, maximal prevalent co-location patterns can be filtered efficiently. Finally, a series of experiments is conducted on both synthetic and real-facility data sets to demonstrate that the proposed algorithm can efficiently reduce both the computational time and the memory consumption compared with the existing algorithms.
Keyword:
Spatial data mining
Maximal co-location pattern
Maximal clique
Hash table
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
Exploratory analysis of the interrelations between co-located boolean spatial features using network graphs使用网络图探索性分析共址布尔空间特征之间的相互关系
PREAI
分享收藏
分享收藏Spatial co-location pattern mining of facility points-of-interest improved by network neighborhood and distance decay effects网络邻域和距离衰减效应改进的设施兴趣点空间co-location模式挖掘
PREAI
分享收藏
查看更多内容