{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:32:14Z","timestamp":1777696334935,"version":"3.51.4"},"reference-count":34,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2023,1,30]]},"abstract":"<jats:p>A co-location pattern is a set of spatial features that are strongly correlated in space. However, some of these patterns could be neglected if the prevalence metrics are based solely on the clique (or star) relationship. Hence, the l-reachability co-location pattern is proposed by introducing the l-reachability clique where the members of each instance pair can be reachable to each other in a given step length l. Because the average size of l-reachability co-location patterns tends to be longer, maximal l-reachability co-location pattern mining is researched in this paper. First, some sparsification strategies are introduced to shorten star neighborhood lists of instances in an updated graph called the l-reachability neighbor relationship graph, and then, they are grouped by their corresponding patterns. Second, candidate maximal l-reachability co-location patterns are iteratively detected in a size-independent way on bi-graphs that contain group keys and their intersection sets. Third, the prevalence of each candidate maximal l-reachability co-location pattern is checked in a binary search way with a natural l-reachability clique called the \u230al\/2\u230b-reachability neighborhood list. Finally, the effectiveness and efficiency of our model and algorithms are analyzed by extensive comparison experiments on synthetic and real-world spatial data sets.<\/jats:p>","DOI":"10.3233\/ida-216515","type":"journal-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T11:23:40Z","timestamp":1675164220000},"page":"269-295","source":"Crossref","is-referenced-by-count":3,"title":["Efficiently mining maximal l-reachability co-location patterns from spatial data sets"],"prefix":"10.1177","volume":"27","author":[{"given":"Muquan","family":"Zou","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Yunnan University, Kunming, Yunnan, China"},{"name":"Department of Computer Science and Technology, Kunming University, Kunming, Yunnan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhen","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Yunnan University, Kunming, Yunnan, China"},{"name":"Dianchi College of Yunnan University, Kunming, Yunnan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingping","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Yunnan University, Kunming, Yunnan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanha","family":"Tran","sequence":"additional","affiliation":[{"name":"FPT University, Hanoi, Viet Nam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-216515_ref1","doi-asserted-by":"publisher","first-page":"125882","DOI":"10.1016\/J.JHAZMAT.2021.125882","article-title":"Spatial pattern analysis reveals multiple sources of organophosphorus flame retardants in coastal waters","volume":"417","author":"Gao","year":"2021","journal-title":"Journal of Hazardous Materials"},{"key":"10.3233\/IDA-216515_ref2","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/S10707-016-0254-1","article-title":"On discovering co-location patterns in datasets: A case study of pollutants and child cancers","volume":"20","author":"Li","year":"2016","journal-title":"GeoInformatica 2016 20:4"},{"key":"10.3233\/IDA-216515_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3292500"},{"key":"10.3233\/IDA-216515_ref4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TKDE.2017.2759110","article-title":"Redundancy reduction for prevalent co-location patterns","volume":"30","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216515_ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00136"},{"key":"10.3233\/IDA-216515_ref6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/S10707-006-9827-8","article-title":"Mining co-location patterns with rare events from spatial data sets","volume":"10","author":"Huang","year":"2006","journal-title":"GeoInformatica"},{"key":"10.3233\/IDA-216515_ref7","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1080\/13658816.2018.1431839","article-title":"A spatial co-location mining algorithm that includes adaptive proximity improvements and distant instance references","volume":"32","author":"Yao","year":"2018","journal-title":"https:\/\/doi.org\/10.1080\/13658816.2018.1431839"},{"key":"10.3233\/IDA-216515_ref8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TKDE.2004.90","article-title":"Discovering colocation patterns from spatial data sets: A general approach","volume":"16","author":"Huang","year":"2004","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216515_ref9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.14445\/22312803\/IJCTT-V7P140","article-title":"A survey on spatial co-location patterns discovery from spatial datasets","volume":"7","author":"Zala","year":"2014","journal-title":"International Journal of Computer Trends and Technology"},{"key":"10.3233\/IDA-216515_ref10","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1109\/TKDE.2006.150","article-title":"A joinless approach for mining spatial colocation patterns","volume":"18","author":"Yoo","year":"2006","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216515_ref11","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.GISCIENCE.2018.10"},{"key":"10.3233\/IDA-216515_ref12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-68783-4_14","article-title":"Maximal sub-prevalent co-location patterns and efficient mining algorithms","volume":"10569 LNCS","author":"Wang","year":"2017","journal-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"10.3233\/IDA-216515_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35910-1_9"},{"key":"10.3233\/IDA-216515_ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CITS.2016.7546421"},{"key":"10.3233\/IDA-216515_ref15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-47724-1-13","article-title":"Discovering Spatial Co-location Patterns: A Summary of Results","volume":"2121","author":"Shekhar","year":"2001","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"10.3233\/IDA-216515_ref16","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TNNLS.2020.2979875","article-title":"Mining Maximal Dynamic Spatial Co-Location Patterns","volume":"32","author":"Hu","year":"2018","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.3233\/IDA-216515_ref17","doi-asserted-by":"publisher","DOI":"10.1109\/KST.2017.7886070"},{"key":"10.3233\/IDA-216515_ref19","doi-asserted-by":"publisher","first-page":"5551","DOI":"10.1109\/IGARSS.2017.8128262","article-title":"An adaptive maximal co-location mining algorithm","volume":"2017-July","author":"Yao","year":"2017","journal-title":"International Geoscience and Remote Sensing Symposium (IGARSS)"},{"key":"10.3233\/IDA-216515_ref20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-37453-1_15","article-title":"Discovery of regional co-location patterns with k-nearest neighbor graph","volume":"7818 LNAI","author":"Qian","year":"2013","journal-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"10.3233\/IDA-216515_ref21","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/J.INS.2017.02.040","article-title":"A co-location pattern-mining algorithm with a density-weighted distance thresholding consideration","volume":"396","author":"Yao","year":"2017","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-216515_ref22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-981-10-8569-7_10","article-title":"Spatial co-location pattern mining using delaunay triangulation","volume":"705","author":"Kumar","year":"2018","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"10.3233\/IDA-216515_ref23","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/S11069-014-1499-3","article-title":"Identification of long-term annual pattern of meteorological drought based on spatiotemporal methods: Evaluation of different geostatistical approaches","volume":"76","author":"Bayat","year":"2015","journal-title":"Natural Hazards"},{"key":"10.3233\/IDA-216515_ref24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1142\/S0218213008003777","article-title":"On the relationships between clustering and spatial co-location pattern mining","volume":"17","author":"Huang","year":"2011","journal-title":"http:\/\/dx.doi.org\/10.1142\/S0218213008003777"},{"key":"10.3233\/IDA-216515_ref25","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/J.INS.2019.03.072","article-title":"A clique-based approach for co-location pattern mining","volume":"490","author":"Bao","year":"2019","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-216515_ref26","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/S10619-019-07278-7","article-title":"A MapReduce approach for spatial co-location pattern mining via ordered-clique-growth","volume":"38","author":"Yang","year":"2019","journal-title":"Distributed and Parallel Databases"},{"key":"10.3233\/IDA-216515_ref27","doi-asserted-by":"crossref","unstructured":"V. Tran, L. Wang and L. Zhou, Mining Spatial Co-Location Patterns Based on Overlap Maximal Clique Partitioning, in: 2019 20th IEEE International Conference on Mobile Data Management (MDM), 2019.","DOI":"10.1109\/MDM.2019.00007"},{"key":"10.3233\/IDA-216515_ref28","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/TKDE.2011.256","article-title":"Finding probabilistic prevalent colocations in spatially uncertain data sets","volume":"25","author":"Wang","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216515_ref29","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/J.IPL.2011.02.013","article-title":"A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph","volume":"111","author":"Berry","year":"2011","journal-title":"Information Processing Letters"},{"key":"10.3233\/IDA-216515_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1097064.1097077"},{"key":"10.3233\/IDA-216515_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"10.3233\/IDA-216515_ref32","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-216515_ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICSDM.2011.5969013"},{"key":"10.3233\/IDA-216515_ref34","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/J.ESWA.2016.07.007","article-title":"A fast space-saving algorithm for maximal co-location pattern mining","volume":"63","author":"Yao","year":"2016","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-216515_ref35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.AML.2011.06.008","article-title":"Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem","volume":"25","author":"Aini","year":"2012","journal-title":"Applied Mathematics Letters"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-216515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:19:52Z","timestamp":1777454392000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-216515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,30]]},"references-count":34,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/ida-216515","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,30]]}}}