{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:17:05Z","timestamp":1743023825054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031105241"},{"type":"electronic","value":"9783031105258"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10525-8_1","type":"book-chapter","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T19:45:27Z","timestamp":1658519127000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dense Nearest Neighborhood Query"],"prefix":"10.1007","author":[{"given":"Hina","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"Hanxiong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[]},{"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Choi, D., Chung, C.: Nearest neighborhood search in spatial databases. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 699\u2013710, April 2015. https:\/\/doi.org\/10.1109\/ICDE.2015.7113326","DOI":"10.1109\/ICDE.2015.7113326"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TKDE.2010.230","volume":"24","author":"K Deng","year":"2012","unstructured":"Deng, K., Sadiq, S., Zhou, X., Xu, H., Fung, G.P.C., Lu, Y.: On group nearest group query processing. IEEE Trans. Knowl. Data Eng. 24(2), 295\u2013308 (2012). https:\/\/doi.org\/10.1109\/TKDE.2010.230","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR3","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD, vol. 96, no. 34, pp. 226\u2013231 (1996)"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Ishioka, T.: Extended K-means with an efficient estimation of the number of clusters. Data Min. Finan. Eng. Intell. Agents (2000). https:\/\/doi.org\/10.1007\/3-540-44491-2_3","DOI":"10.1007\/3-540-44491-2_3"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1007\/s10115-019-01360-3","volume":"62","author":"H-J Jang","year":"2019","unstructured":"Jang, H.-J., Hyun, K.-S., Chung, J., Jung, S.-Y.: Nearest base-neighbor search on spatial datasets. Knowl. Inf. Syst. 62(3), 867\u2013897 (2019). https:\/\/doi.org\/10.1007\/s10115-019-01360-3","journal-title":"Knowl. Inf. Syst."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Le, S., Dong, Y., Chen, H., Furuse, K.: Balanced nearest neighborhood query in spatial database. In: 2019 IEEE International Conference on Big Data and Smart Computing (BigComp), pp. 1\u20134, February 2019. https:\/\/doi.org\/10.1109\/BIGCOMP.2019.8679425","DOI":"10.1109\/BIGCOMP.2019.8679425"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2020","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2020). https:\/\/doi.org\/10.1109\/TPAMI.2018.2889473","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1_CR8","unstructured":"Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44\u201353 (2000). https:\/\/www.semanticscholar.org\/paper\/Reverse-Nearest-Neighbor-Queries-for-Dynamic-Stanoi-Agrawal\/cb60aef9f2187d4052b36f99aba6e1b8eca9f4ca"}],"container-title":["Communications in Computer and Information Science","Intelligent Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10525-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T19:48:50Z","timestamp":1658519330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10525-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031105241","9783031105258"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10525-8_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INTAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Technologies and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grimstad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intap2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uia.no\/en\/events\/4th-international-conference-on-intelligent-technologies-and-applications-intap-2021","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"243","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":"33","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":"0","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":"14% - 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":"3","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)"}}]}}