{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:24Z","timestamp":1742914104796,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398469"},{"type":"electronic","value":"9783031398476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39847-6_13","type":"book-chapter","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:46Z","timestamp":1692291766000},"page":"186-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Co-location Pattern Mining Under the\u00a0Spatial Structure Constraint"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4087-7056","authenticated-orcid":false,"given":"Rodrigue","family":"Govan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1667-3819","authenticated-orcid":false,"given":"Nazha","family":"Selmaoui-Folcher","sequence":"additional","affiliation":[]},{"given":"Aristotelis","family":"Giannakos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7680-9899","authenticated-orcid":false,"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"key":"13_CR1","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.: A clique-based approach for co-location pattern mining. Inf. Sci. 490, 244\u2013264 (2019)","journal-title":"Inf. Sci."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","volume":"65","author":"G Boeing","year":"2017","unstructured":"Boeing, G.: OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urban Syst. 65, 126\u2013139 (2017)","journal-title":"Comput. Environ. Urban Syst."},{"issue":"1\u20133","key":"13_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1\u20133), 564\u2013568 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W., et al.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10707-014-0209-3","volume":"19","author":"F Flouvat","year":"2015","unstructured":"Flouvat, F., Van Soc, J.F.N., Desmier, E., Selmaoui-Folcher, N.: Domain-driven co-location mining: extraction, visualization and integration in a GIS. GeoInformatica 19, 147\u2013183 (2015)","journal-title":"GeoInformatica"},{"issue":"12","key":"13_CR6","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.: Discovering colocation patterns from spatial data sets: a general approach. IEEE Trans. Knowl. Data Eng. 16(12), 1472\u20131485 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11042-012-1007-2","volume":"71","author":"SK Kim","year":"2014","unstructured":"Kim, S.K., Lee, J.H., Ryu, K.H., Kim, U.: A framework of spatial co-location pattern mining for ubiquitous GIS. Multimed. Tools Appl. 71(1), 199\u2013218 (2014)","journal-title":"Multimed. Tools Appl."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-60159-7_4","volume-title":"Advances in Spatial Databases","author":"K Koperski","year":"1995","unstructured":"Koperski, K., Han, J.: Discovery of spatial association rules in geographic information databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 47\u201366. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60159-7_4"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-47724-1_13","volume-title":"Advances in Spatial and Temporal Databases","author":"S Shekhar","year":"2001","unstructured":"Shekhar, S., Huang, Y.: Discovering spatial co-location patterns: a summary of results. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 236\u2013256. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47724-1_13"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363, 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114830","volume":"175","author":"V Tran","year":"2021","unstructured":"Tran, V., Wang, L., Chen, H., Xiao, Q.: MCHT: a maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm. Expert Syst. Appl. 175, 114830 (2021)","journal-title":"Expert Syst. Appl."},{"key":"13_CR12","first-page":"422","volume":"224","author":"G Vaira","year":"2011","unstructured":"Vaira, G., Kurasova, O.: Parallel bidirectional Dijkstra\u2019s shortest path algorithm. Databases Inf. Syst. VI Front. Artif. Intell. Appl. 224, 422\u2013435 (2011)","journal-title":"Databases Inf. Syst. VI Front. Artif. Intell. Appl."},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"13_CR14","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.: A joinless approach for mining spatial colocation patterns. IEEE Trans. Knowl. Data Eng. 18(10), 1323\u20131337 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR15","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.: Spatial co-location pattern mining for location-based services in road networks. Expert Syst. Appl. 46, 324\u2013335 (2016)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39847-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:27:58Z","timestamp":1710332878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39847-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398469","9783031398476"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39847-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}