TY - GEN
T1 - Sustained emerging spatio-temporal co-occurrence pattern mining
T2 - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006
AU - Celik, Mete
AU - Shekhar, Shashi
AU - Rogers, James P.
AU - Shine, James A.
PY - 2006
Y1 - 2006
N2 - Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs is important due to many applications, e.g., predicting emerging infectious diseases, predicting defensive and offensive intent from troop movement patterns, and novel predator-prey interactions. However, mining SECOPs 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 interest measure for mining SECOPs and a novel SECOP mining algorithm. Analytical and experimental results show that the proposed algorithm is correct, complete, and computationally faster than related approaches. Results also show the proposed algorithm is computationally more efficient than naïve alternatives.
AB - Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs is important due to many applications, e.g., predicting emerging infectious diseases, predicting defensive and offensive intent from troop movement patterns, and novel predator-prey interactions. However, mining SECOPs 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 interest measure for mining SECOPs and a novel SECOP mining algorithm. Analytical and experimental results show that the proposed algorithm is correct, complete, and computationally faster than related approaches. Results also show the proposed algorithm is computationally more efficient than naïve alternatives.
UR - http://www.scopus.com/inward/record.url?scp=38949169199&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38949169199&partnerID=8YFLogxK
U2 - 10.1109/ICTAI.2006.108
DO - 10.1109/ICTAI.2006.108
M3 - Conference contribution
AN - SCOPUS:38949169199
SN - 0769527280
SN - 9780769527284
T3 - Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI
SP - 106
EP - 115
BT - Procedings - 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006
Y2 - 13 October 2006 through 15 October 2006
ER -