{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T22:29:59Z","timestamp":1744237799857,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708437"},{"type":"electronic","value":"9789819708444"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0844-4_13","type":"book-chapter","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T06:02:43Z","timestamp":1708495363000},"page":"173-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Mining Maximal High Utility Co-location Patterns from\u00a0Large-Scale Spatial Data"],"prefix":"10.1007","author":[{"given":"Muquan","family":"Zou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2714-6707","authenticated-orcid":false,"given":"Vanha","family":"Tran","sequence":"additional","affiliation":[]},{"given":"Ducanh","family":"Khuat","sequence":"additional","affiliation":[]},{"given":"Thanhcong","family":"Do","sequence":"additional","affiliation":[]},{"given":"Jinpeng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"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":"53","DOI":"10.1016\/j.compenvurbsys.2017.10.003","volume":"68","author":"J Cai","year":"2018","unstructured":"Cai, J., Liu, Q., Deng, M., Tang, J., He, Z.: Adaptive detection of statistically significant regional spatial co-location patterns. Comput. Environ. Urban Syst. 68, 53\u201363 (2018)","journal-title":"Comput. Environ. Urban Syst."},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.Y., Park, K. (eds.) Algorithms and Computation. ISAAC 2010. LNCS, vol. 6506 pp. 403\u2013414. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17517-6_36","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. J. Exp. Algorithmics (JEA) 18, 3\u20131 (2013)","DOI":"10.1145\/2543629"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Li, Y., Wang, L., Yang, P., Li, J.: EHUCM: an efficient algorithm for mining high utility co-location patterns from spatial datasets with feature-specific utilities. In: Strauss, C., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) Database and Expert Systems Applications. DEXA 2021. LNCS, vol. 12923, pp. 185\u2013191. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86472-9_17","DOI":"10.1007\/978-3-030-86472-9_17"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1080\/13658816.2020.1775235","volume":"35","author":"Q Liu","year":"2021","unstructured":"Liu, Q., Liu, W., Deng, M., Cai, J., Liu, Y.: An adaptive detection of multilevel co-location patterns based on natural neighborhoods. Int. J. Geogr. Inf. Sci. 35(3), 556\u2013581 (2021)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Shu, J., Wang, L., Yang, P., Tran, V.: Mining the potential relationships between cancer cases and industrial pollution based on high-influence ordered-pair patterns. In: Chen, W., Yao, L., Cai, T., Pan, S., Shen, T., Li, X. (eds.) Advanced Data Mining and Applications. ADMA 2022. LNCS, vol. 13725, pp. 27\u201340. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22064-7_3","DOI":"10.1007\/978-3-031-22064-7_3"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Song, W., Qiao, Q.: Mining high utility co-location patterns using the maximum clique and the subsume index. In: Proceedings of the 2020 2nd International Conference on Big Data Engineering, pp. 1\u20136 (2020)","DOI":"10.1145\/3404512.3404516"},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119255","volume":"213","author":"V Tran","year":"2023","unstructured":"Tran, V.: Meta-PCP: a concise representation of prevalent co-location patterns discovered from spatial data. Expert Syst. Appl. 213, 119255 (2023)","journal-title":"Expert Syst. Appl."},{"key":"13_CR10","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."},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Yang, S., Wang, L., Bao, X., Lu, J.: A framework for mining spatial high utility co-location patterns. In: 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), pp. 595\u2013601. IEEE (2015)","DOI":"10.1109\/FSKD.2015.7382010"},{"key":"13_CR13","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.: A fast space-saving algorithm for maximal co-location pattern mining. Expert Syst. Appl. 63, 310\u2013323 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.3233\/IDA-173752","volume":"23","author":"JS Yoo","year":"2019","unstructured":"Yoo, J.S., Bow, M.: A framework for generating condensed co-location sets from spatial databases. Intell. Data Anal. 23(2), 333\u2013355 (2019)","journal-title":"Intell. Data Anal."},{"issue":"10","key":"13_CR15","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_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ipl.2017.05.005","volume":"125","author":"T Yu","year":"2017","unstructured":"Yu, T., Liu, M.: A linear time algorithm for maximal clique enumeration in large sparse graphs. Inf. Process. Lett. 125, 35\u201340 (2017)","journal-title":"Inf. Process. Lett."}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0844-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T01:41:27Z","timestamp":1731375687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0844-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708437","9789819708444"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0844-4_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/dmbd2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79","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":"38","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":"29","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":"48% - 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":"2.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}