Issue No. 10 - October (2008 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.97
Mete Celik , University of Minnesota, Minneapolis
Shashi Shekhar , University of Minnesota, Minneapolis
James P. Rogers , U.S. Army ERDC, Alexandria
James A. Shine , U.S. Army ERDC, Alexandria
Mixed-drove spatio-temporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximity. Discovering MDCOPs is an important problem with many applications such as identifying tactics in battlefields, games, and predator-prey interactions. However, mining MDCOPs is computationally very expensive because the interest measures are computationally complex, datasets are larger due to the archival history, and the set of candidate patterns is exponential in the number of object-types. We propose a monotonic composite interest measure for discovering MDCOPs and novel MDCOP mining algorithms. Analytical results show that the proposed algorithms are correct and complete. Experimental results also show that the proposed methods are computationally more efficient than naive alternatives.
Mining methods and algorithms, Data mining, Spatial databases and GIS
J. A. Shine, S. Shekhar, J. P. Rogers and M. Celik, "Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining," in IEEE Transactions on Knowledge & Data Engineering, vol. 20, no. , pp. 1322-1335, 2008.