Fast spatial co-location mining without cliqueness checking

Authors:
Zhongshan Lin;SeungJin Lim
Affiliations:
Utah State University, Logan, UT, USA;Utah State University, Logan, UT, USA
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 5
Cited 0

Mining frequent neighboring class sets in spatial databases

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovering Spatial Co-location Patterns: A Summary of Results

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A Joinless Approach for Mining Spatial Colocation Patterns

IEEE Transactions on Knowledge and Data Engineering
Mining Co-Location Patterns with Rare Events from Spatial Data Sets

Geoinformatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a novel, spatial co-location mining algorithm which automatically generates co-located spatial features without generating any non-clique candidates at each level. Subsequently our algorithm is more efficient than other existing level-wise co-location algorithms because no cliqueness checking is performed in our algorithm. In addition, our algorithm produces a smaller number of co-location candidates than the other existing algorithms.