{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T10:44:25Z","timestamp":1769597065197,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:00:00Z","timestamp":1666224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:00:00Z","timestamp":1666224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"This research has been partially supported by the statutory funds of Poznan University of Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>One of the interesting types of spatio-temporal patterns is the Mixed-Drove Co-occurrence Pattern (MDCOP), which represents types of objects frequently located together in both space and time. To discover such patterns, methods based on the well-known Apriori strategy are widely used. They involve determining multi-element MDCOPs by building them up iteratively starting with the two-element patterns and then successively adding another element in each iteration. This approach can be very costly, particularly when the data is dense enough to form patterns of significant size. In this paper, we introduce a definition of a new pattern type called a Maximal Mixed-Drove Co-occurrence Pattern. We also propose a new algorithm MAXMDCOP-Miner, which resigns from popular Apriori strategy of generating candidates and, therefore, can discover long pattern without processing all their subsets. Experiments performed on synthetic and real datasets show that MAXMDCOP-Miner has high performance, in particular for dense datasets or tasks with low user-defined thresholds of spatial or time prevalence.<\/jats:p>","DOI":"10.1007\/s10796-022-10344-8","type":"journal-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T11:06:51Z","timestamp":1666264011000},"page":"2005-2028","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Maximal Mixed-Drove Co-occurrence Patterns"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9486-929X","authenticated-orcid":false,"given":"Witold","family":"Andrzejewski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4914-9394","authenticated-orcid":false,"given":"Pawel","family":"Boinski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"10344_CR1","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proc. of the 20th international conference on very large data bases (pp. 487\u2013499). Morgan Kaufmann Publishers Inc.,"},{"key":"10344_CR2","doi-asserted-by":"crossref","unstructured":"Andrzejewski, W., & Boinski, P. (2021). Maximal mixed-drove co-occurrence patterns. In L. Bellatreche, M. Dumas, P. Karras, & R. Matulevi\u010dius (Eds.) Advances in databases and information systems (pp. 15\u201329.) Springer","DOI":"10.1007\/978-3-030-82472-3_3"},{"issue":"Supplement C","key":"10344_CR3","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.eswa.2017.10.025","volume":"93","author":"W Andrzejewski","year":"2018","unstructured":"Andrzejewski, W., & Boinski, P. (2018). Efficient spatial co-location pattern mining on multiple gpus. Expert Systems with Applications, 93(Supplement C), 465\u2013483. https:\/\/doi.org\/10.1016\/j.eswa.2017.10.025.","journal-title":"Expert Systems with Applications"},{"key":"10344_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.ins.2018.09.016","volume":"496","author":"W Andrzejewski","year":"2019","unstructured":"Andrzejewski, W., & Boinski, P. (2019). Parallel approach to incremental co-location pattern mining. Information Sciences, 496, 485\u2013505.","journal-title":"Information Sciences"},{"key":"10344_CR5","doi-asserted-by":"crossref","unstructured":"Cao, H., Mamoulis, N., & Cheung, D. W. (2006). Discovery of collocation episodes in spatiotemporal data. In Proc. of the 6th international conference on data mining. ICDM \u201906 (pp. 823\u2013827). IEEE Computer Society, Washington, DC, USA","DOI":"10.1109\/ICDM.2006.59"},{"key":"10344_CR6","doi-asserted-by":"crossref","unstructured":"Celik, M., Shekhar, S., Rogers, J. P., & Shine, J. A. (2006). Sustained emerging spatio-temporal co-occurrence pattern mining: A summary of results. In Proc. of the 18th IEEE international conference on tools with artificial intelligence (ICTAI\u201906) (pp. 106\u2013115)","DOI":"10.1109\/ICTAI.2006.108"},{"issue":"10","key":"10344_CR7","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TKDE.2008.97","volume":"20","author":"M Celik","year":"2008","unstructured":"Celik, M., Shekhar, S., Rogers, J. P., & Shine, J. A. (2008). Mixed-drove spatiotemporal co-occurrence pattern mining. IEEE Transactions on Knowledge and Data Engineering, 20(10), 1322\u20131335.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"10344_CR8","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E. (1960). Trie memory. Communications of the ACM, 3(9), 490\u2013499.","journal-title":"Communications of the ACM"},{"key":"10344_CR9","doi-asserted-by":"crossref","unstructured":"Hamdi, S. M., Aydin, B., & Angryk, R. A. (2016). A pattern growth-based approach for mining spatiotemporal co-occurrence patterns. In Proc. of the 16th IEEE international conference on data mining workshops (pp. 1125\u20131132)","DOI":"10.1109\/ICDMW.2016.0162"},{"issue":"4","key":"10344_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TKDE.2007.190712","volume":"20","author":"Y Huang","year":"2008","unstructured":"Huang, Y., Zhang, L., & Zhang, P. (2008). A framework for mining sequential patterns from spatio-temporal event data sets. IEEE Transactions on Knowledge and Data Engineering, 20(4), 433\u2013448.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10344_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-07821-2_12","volume-title":"Spatiotemporal pattern mining: Algorithms and applications","author":"Z Li","year":"2014","unstructured":"Li, Z. (2014). Spatiotemporal pattern mining: Algorithms and applications (Vol. 9783319078212, pp. 283\u2013306). New York: Springer, International Publishing. https:\/\/doi.org\/10.1007\/978-3-319-07821-2_12."},{"key":"10344_CR12","doi-asserted-by":"crossref","unstructured":"Pillai, K. G., Angryk, R. A., Banda, J. M., Schuh, M. A., & Wylie, T. (2012). Spatio-temporal co-occurrence pattern mining in data sets with evolving regions. In 2012 IEEE 12th international conference on data mining workshops\u00a0(pp. 805\u2013812). IEEE","DOI":"10.1109\/ICDMW.2012.130"},{"key":"10344_CR13","doi-asserted-by":"publisher","unstructured":"Qian, F., Yin, L., He, Q., & He, J. (2009). Mining spatio-temporal co-location patterns with weighted sliding window. In 2009 IEEE international conference on intelligent computing and intelligent systems (Vol. 3 pp. 181\u2013185). https:\/\/doi.org\/10.1109\/ICICISYS.2009.5358192","DOI":"10.1109\/ICICISYS.2009.5358192"},{"key":"10344_CR14","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-02457-3_57","volume-title":"Computational science and its applications - ICCSA 2009","author":"F Qian","year":"2009","unstructured":"Qian, F., He, Q., & He, J. (2009). Mining spread patterns of spatio-temporal co-occurrences over zones. In O. Gervasi, D. Taniar, B. Murgante, A. Lagan\u00e0, Y. Mun, & M. L. Gavrilova (Eds.), Computational science and its applications - ICCSA 2009 (pp. 677\u2013692). Springer."},{"key":"10344_CR15","doi-asserted-by":"crossref","unstructured":"Shekhar, S., & Huang, Y. (2001). Discovering spatial co-location patterns: A summary of results. In Proc. of the 7th international symposium on spatial and temporal databases (SSTD 2001). Lecture Notes in Computer Science, (Vol. 2121 pp. 236\u2013256). Springer","DOI":"10.1007\/3-540-47724-1_13"},{"key":"10344_CR16","doi-asserted-by":"publisher","first-page":"114830","DOI":"10.1016\/j.eswa.2021.114830","volume":"175","author":"V Tran","year":"2021","unstructured":"Tran, V., Wang, L., Chen, H., & Xiao, Q. (2021). Mcht: A maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm. Expert Systems with Applications, 175, 114830.","journal-title":"Expert Systems with Applications"},{"issue":"19","key":"10344_CR17","doi-asserted-by":"publisher","first-page":"3370","DOI":"10.1016\/j.ins.2009.05.023","volume":"179","author":"L Wang","year":"2009","unstructured":"Wang, L., Zhou, L., Lu, J., & Yip, J. (2009). An Order-clique-based approach for mining maximal co-locations. Information Sciences, 179(19), 3370\u20133382.","journal-title":"Information Sciences"},{"issue":"2","key":"10344_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.2174\/1874133900903020069","volume":"3","author":"L Wang","year":"2009","unstructured":"Wang, L., Bao, Y., & Lu, J. (2009). Efficient discovery of spatial Co-Location patterns using the iCPI-tree. The Open Information Systems Journal, 3(2), 69\u201380.","journal-title":"The Open Information Systems Journal"},{"key":"10344_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.2298\/CSIS180828032W","volume":"16","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Han, T., & Yu, H. (2019). Research of MDCOP mining based on time aggregated graph for large spatio-temproal data sets. Computer Science and Information Systems, 16, 32\u201332.","journal-title":"Computer Science and Information Systems"},{"key":"10344_CR20","unstructured":"Wei, W. W. S. (2006). Time series analysis: Univariate and multivariate methods, 2nd edn. Pearson Addison Wesley"},{"key":"10344_CR21","doi-asserted-by":"crossref","unstructured":"Yang, H., Parthasarathy, S., & Mehta, S. (2005). A generalized framework for mining spatio-temporal patterns in scientific data. In Proc. of the 11th ACM SIGKDD international conference on knowledge discovery in data mining. KDD \u201905, (pp. 716\u2013721). ACM","DOI":"10.1145\/1081870.1081962"},{"issue":"C","key":"10344_CR22","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.eswa.2016.07.007","volume":"63","author":"X Yao","year":"2016","unstructured":"Yao, X., Peng, L., Yang, L., & Chi, T. (2016). A fast space-saving algorithm for maximal Co-location pattern mining. Expert Systems with Applications, 63(C), 310\u2013323.","journal-title":"Expert Systems with Applications"},{"key":"10344_CR23","doi-asserted-by":"crossref","unstructured":"Yoo, J. S., & Bow, M. (2011). Mining maximal Co-located event sets. In J.Z. Huang, L. Cao, & J. Srivastava (Eds.) Proc. of the 15th pacific-asia conference on knowledge discovery and data mining (PAKDD 2011). Lecture Notes in Computer Science (Vol. 6634, pp. 351\u2013362). Springer","DOI":"10.1007\/978-3-642-20841-6_29"},{"issue":"10","key":"10344_CR24","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1109\/TKDE.2006.150","volume":"18","author":"JS Yoo","year":"2006","unstructured":"Yoo, J. S., & Shekhar, S. (2006). A joinless approach for mining spatial colocation patterns. IEEE Transactions on Knowledge and Data Engineering, 18(10), 1323\u20131337. https:\/\/doi.org\/10.1109\/TKDE.2006.150.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"15879","key":"10344_CR25","first-page":"1","volume":"10","author":"N Zannoni","year":"2020","unstructured":"Zannoni, N., Wikelski, M., Gagliardo, A., Raza, A., Kramer, S., Seghetti, C., et al. (2020). Identifying volatile organic compounds used for olfactory navigation by homing pigeons. Scientific Reports UK, 10(15879), 1\u201316.","journal-title":"Scientific Reports UK"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-022-10344-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10796-022-10344-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-022-10344-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T08:21:32Z","timestamp":1696234892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10796-022-10344-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,20]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10344"],"URL":"https:\/\/doi.org\/10.1007\/s10796-022-10344-8","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,20]]},"assertion":[{"value":"20 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}