Claudio Silvestri
ABSTRACT
The discovery of co-location patterns among spatial events is an important task in spatial data mining. We introduce a new kind of spatial co-location patterns, named condensed spatial co-location patterns, that can be considered as a lossy compressed representation of all the co-location patterns. Each condensed pattern is the representative, and a superset, of a group of spatial co-location patterns in the full set of patterns such that the difference between the interestingness measure of the representative and the measures of the patterns belonging to the associated group are negligible. Our preliminary experiments show that condensed spatial co-location patterns are less sensitive to parameter changes and more robust in presence of missing data than closed spatial co-location patterns.
- R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. SIGMOD Rec., 22(2):207--216, June 1993. Google Scholar
Digital Library
- D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the 17th International Conference on Data Engineering, pages 443--452. IEEE, 2001. Google ScholarDigital Library
- J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53--87, Jan. 2004. Google ScholarDigital Library
- S. Shekhar and Y. Huang. Discovering spatial co-location patterns: A summary of results. In Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases, SSTD '01, pages 236--256. Springer-Verlag, 2001. Google ScholarDigital Library
- J. S. Yoo and M. Bow. Mining maximal co-located event sets. In Proceedings of the 15th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining - Volume Part I, PAKDD'11, pages 351--362. Springer-Verlag, 2011. Google ScholarDigital Library
- J. S. Yoo and M. Bow. Mining top-k closed co-location patterns. In IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services, ICSDM 2011, Fuzhou, China, June 29 -- July 1, 2011, pages 100--105. IEEE, 2011.Google ScholarCross Ref
- J. S. Yoo and S. Shekhar. A joinless approach for mining spatial colocation patterns. IEEE Trans. on Knowl. and Data Eng., 18(10):1323--1337, Oct. 2006. Google ScholarDigital Library
- M. J. Zaki. Mining non-redundant association rules. Data Min. Knowl. Discov., 9(3):223--248, Nov. 2004. Google ScholarDigital Library
Index Terms
- Mining condensed spatial co-location patterns
Recommendations
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in regions with poor mosquito control and the presence of birds. For co-location ...
Discovering spatial contrast and common sets with statistically significant co-location patterns
SAC '17: Proceedings of the Symposium on Applied ComputingCo-location pattern mining is a spatial data mining technique which can be used to find associations among spatial features. Our work is motivated by an application in environmental health where the goal is to investigate whether the maternal exposure ...
Mining frequent geographic patterns with knowledge constraints
GIS '06: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systemsThe large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large amount of patterns, many are well known geographic domain associations. ...
Comments