{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:44:31Z","timestamp":1772163871991,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NO.62366061"],"award-info":[{"award-number":["NO.62366061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yunnan Fundamental Research Projects, China","award":["NO.202301AU070152"],"award-info":[{"award-number":["NO.202301AU070152"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EPJ Data Sci."],"DOI":"10.1140\/epjds\/s13688-025-00605-2","type":"journal-article","created":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T14:53:39Z","timestamp":1764946419000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining spatial co-location patterns via \u03b3-quasi-clique detection"],"prefix":"10.1140","volume":"15","author":[{"given":"Peijie","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhu","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pan","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"issue":"12","key":"605_CR1","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TKDE.2004.90","volume":"16","author":"Y Huang","year":"2004","unstructured":"Huang Y, Shekhar S, Xiong H (2004) Discovering colocation patterns from spatial data sets: a general approach. IEEE Trans Knowl Data Eng 16(12):1472\u20131485","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"605_CR2","doi-asserted-by":"publisher","first-page":"3911","DOI":"10.1109\/TIP.2017.2708506","volume":"26","author":"X Chang","year":"2017","unstructured":"Chang X, Ma Z, Lin M, Yang Y, Hauptmann AG (2017) Feature interaction augmented sparse learning for fast kinect motion detection. IEEE Trans Image Process 26(8):3911\u20133920","journal-title":"IEEE Trans Image Process"},{"issue":"10","key":"605_CR3","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1109\/TKDE.2006.150","volume":"18","author":"JS Yoo","year":"2006","unstructured":"Yoo JS, Shekhar S (2006) A joinless approach for mining spatial colocation patterns. IEEE Trans Knowl Data Eng 18(10):1323\u20131337","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"605_CR4","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.eswa.2015.10.010","volume":"46","author":"W Yu","year":"2016","unstructured":"Yu W (2016) Spatial co-location pattern mining for location-based services in road networks. Expert Syst Appl 46:324\u2013335","journal-title":"Expert Syst Appl"},{"issue":"2","key":"605_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H Matsuda","year":"1999","unstructured":"Matsuda H, Ishihara T, Hashimoto A (1999) Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor Comput Sci 210(2):305\u2013325","journal-title":"Theor Comput Sci"},{"key":"605_CR6","first-page":"570","volume-title":"VLDB","author":"L Arge","year":"1998","unstructured":"Arge L, Procopiuc O, Ramaswamy S, Suel T, Vitter JS (1998) Scalable sweeping-based spatial join. In: VLDB, vol\u00a098, pp\u00a0570\u2013581"},{"key":"605_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.ins.2019.03.072","volume":"490","author":"X Bao","year":"2019","unstructured":"Bao X, Wang L (2019) A clique-based approach for co-location pattern mining. Inf Sci 490:244\u2013264","journal-title":"Inf Sci"},{"key":"605_CR8","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1145\/1458082.1458333","volume-title":"Proceedings of the 17th ACM conference on information and knowledge management","author":"Z Lin","year":"2008","unstructured":"Lin Z, Lim S (2008) Fast spatial co-location mining without cliqueness checking. In: Proceedings of the 17th ACM conference on information and knowledge management, pp\u00a01461\u20131462"},{"key":"605_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/CIT.2008.4594673","volume-title":"2008 8th IEEE international conference on computer and information technology","author":"L Wang","year":"2008","unstructured":"Wang L, Bao Y, Lu J, Yip J (2008) A new join-less approach for co-location pattern mining. In: 2008 8th IEEE international conference on computer and information technology, pp\u00a0197\u2013202"},{"issue":"19","key":"605_CR10","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. Inf Sci 179(19):3370\u20133382","journal-title":"Inf Sci"},{"issue":"4","key":"605_CR11","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1007\/s10115-019-01381-y","volume":"62","author":"JS Yoo","year":"2020","unstructured":"Yoo JS, Boulware D, Kimmey D (2020) Parallel co-location mining with mapreduce and nosql systems. Knowl Inf Syst 62(4):1433\u20131463","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"605_CR12","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10619-019-07278-7","volume":"38","author":"P Yang","year":"2020","unstructured":"Yang P, Wang L, Wang X (2020) A mapreduce approach for spatial co-location pattern mining via ordered-clique-growth. Distrib Parallel Databases 38(2):531\u2013560","journal-title":"Distrib Parallel Databases"},{"key":"605_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ins.2018.01.011","volume":"436","author":"L Wang","year":"2018","unstructured":"Wang L, Bao X, Chen H, Cao L (2018) Effective lossless condensed representation and discovery of spatial co-location patterns. Inf Sci 436:197\u2013213","journal-title":"Inf Sci"},{"key":"605_CR14","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 Syst Appl 63:310\u2013323","journal-title":"Expert Syst Appl"},{"issue":"1","key":"605_CR15","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TKDE.2017.2759110","volume":"30","author":"L Wang","year":"2017","unstructured":"Wang L, Bao X, Zhou L (2017) Redundancy reduction for prevalent co-location patterns. IEEE Trans Knowl Data Eng 30(1):142\u2013155","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"605_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TKDE.2019.2930598","volume":"33","author":"Y Ge","year":"2019","unstructured":"Ge Y, Yao Z, Li H (2019) Computing co-location patterns in spatial data with extended objects: a scalable buffer-based approach. IEEE Trans Knowl Data Eng 33(2):401\u2013414","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"605_CR17","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/952532.952630","volume-title":"Proceedings of the 2003 ACM symposium on applied computing","author":"Y Huang","year":"2003","unstructured":"Huang Y, Xiong H, Shekhar S, Pei J (2003) Mining confident co-location rules without a support threshold. In: Proceedings of the 2003 ACM symposium on applied computing, pp\u00a0497\u2013501"},{"key":"605_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10115-012-0506-9","volume":"33","author":"F Qian","year":"2012","unstructured":"Qian F, He Q, Chiew K, He J (2012) Spatial co-location pattern discovery without thresholds. Knowl Inf Syst 33:419\u2013445","journal-title":"Knowl Inf Syst"},{"key":"605_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2017.02.040","volume":"396","author":"X Yao","year":"2017","unstructured":"Yao X, Chen L, Peng L, Chi T (2017) A co-location pattern-mining algorithm with a density-weighted distance thresholding consideration. Inf Sci 396:144\u2013161","journal-title":"Inf Sci"},{"key":"605_CR20","first-page":"1514","volume-title":"2019 IEEE 35th international conference on data engineering","author":"HK-H Chan","year":"2019","unstructured":"Chan HK-H, Long C, Yan D, Wong RC-W (2019) Fraction-score: a new support measure for co-location pattern mining. In: 2019 IEEE 35th international conference on data engineering, pp\u00a01514\u20131525"},{"key":"605_CR21","volume":"133","author":"J Wang","year":"2024","unstructured":"Wang J, Li G, Ai T (2024) Revealing association rules within intricate ecosystems: a spatial co-location mining method based on geo-eco knowledge graph. Int J Appl Earth Obs Geoinf 133:104116","journal-title":"Int J Appl Earth Obs Geoinf"},{"issue":"1","key":"605_CR22","doi-asserted-by":"publisher","DOI":"10.1080\/17538947.2024.2390434","volume":"17","author":"J Wang","year":"2024","unstructured":"Wang J, Ai T, Wu H, Xu H, Xiao T, Li G (2024) Graph-based spatial co-location pattern mining: integrate geospatial analysis and logical reasoning. Int J Digit Earth 17(1):2390434","journal-title":"Int J Digit Earth"},{"key":"605_CR23","volume-title":"Proceedings of annual ADFSL conference on digital forensics","author":"D Weiss","year":"2015","unstructured":"Weiss D, Warner G (2015) Tracking criminals on Facebook: a case study from a digital forensics reu program. In: Proceedings of annual ADFSL conference on digital forensics"},{"key":"605_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-87481-2_3","volume-title":"Joint European conference on machine learning and knowledge discovery in databases","author":"G Liu","year":"2008","unstructured":"Liu G, Wong L (2008) Effective pruning techniques for mining quasi-cliques. In: Joint European conference on machine learning and knowledge discovery in databases, pp\u00a033\u201349"},{"key":"605_CR25","doi-asserted-by":"crossref","unstructured":"Yan D, Guo G, Khalil J, \u00d6zsu MT, Ku W-S, Lui JC (2022) G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing. VLDB J, 1\u201334","DOI":"10.1007\/s00778-021-00688-z"},{"key":"605_CR26","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1145\/2939672.2939848","volume-title":"Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","author":"Y Yang","year":"2016","unstructured":"Yang Y, Yan D, Wu H, Cheng J, Zhou S, Lui JC (2016) Diversified temporal subgraph pattern mining. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a01965\u20131974"},{"key":"605_CR27","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/BigData.2018.8622352","volume-title":"2018 IEEE international conference on big data","author":"S-V Sanei-Mehri","year":"2018","unstructured":"Sanei-Mehri S-V, Das A, Tirthapura S (2018) Enumerating top-k quasi-cliques. In: 2018 IEEE international conference on big data, pp\u00a01107\u20131112"},{"issue":"1","key":"605_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-018-0497-y","volume":"8","author":"P Conde-Cespedes","year":"2018","unstructured":"Conde-Cespedes P, Ngonmang B, Viennet E (2018) An efficient method for mining the maximal \u03b1-quasi-clique-community of a given node in complex networks. Soc Netw Anal Min 8(1):20","journal-title":"Soc Netw Anal Min"},{"issue":"11","key":"605_CR29","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.14778\/3551793.3551854","volume":"15","author":"K Yao","year":"2022","unstructured":"Yao K, Chang L, Yu JX (2022) Identifying similar-bicliques in bipartite graphs. Proc VLDB Endow 15(11):3085\u20133097","journal-title":"Proc VLDB Endow"},{"key":"605_CR30","first-page":"1900","volume-title":"2022 IEEE 38th international conference on data engineering","author":"G Guo","year":"2022","unstructured":"Guo G, Yan D, Yuan L, Khalil J, Long C, Jiang Z, Zhou Y (2022) Maximal directed quasi -clique mining. In: 2022 IEEE 38th international conference on data engineering, pp\u00a01900\u20131913"},{"issue":"6","key":"605_CR31","doi-asserted-by":"publisher","first-page":"3731","DOI":"10.1109\/TSMC.2021.3071721","volume":"52","author":"L Lin","year":"2021","unstructured":"Lin L, Yuan P, Li R-H, Wang J, Liu L, Jin H (2021) Mining stable quasi-cliques on temporal networks. IEEE Trans Syst Man Cybern Syst 52(6):3731\u20133745","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"605_CR32","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/1081870.1081898","volume-title":"Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining","author":"J Pei","year":"2005","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, pp\u00a0228\u2013238"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-025-00605-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-025-00605-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-025-00605-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T13:17:55Z","timestamp":1768223875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1140\/epjds\/s13688-025-00605-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["605"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-025-00605-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6817418\/v1","asserted-by":"object"}]},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"4 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"1"}}