{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:54:48Z","timestamp":1743004488949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031210464"},{"type":"electronic","value":"9783031210471"}],"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-21047-1_18","type":"book-chapter","created":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T13:02:34Z","timestamp":1668862954000},"page":"195-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tree-Based Graph Indexing for\u00a0Fast kNN Queries"],"prefix":"10.1007","author":[{"given":"Suomi","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shohei","family":"Matsugu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"Shiokawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abeywickrama, T., Cheema, M.A.: Efficient landmark-based candidate generation for kNN queries on road networks. In: Proceedings of the 22nd International Conference on Database Systems for Advanced Applications (DASFAA 2017), pp. 425\u2013440 (2017)","DOI":"10.1007\/978-3-319-55699-4_26"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Alom, Z., Carminati, B., Ferrari, E.: Detecting spam accounts on twitter. In: 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 1191\u20131198 (2018). https:\/\/doi.org\/10.1109\/ASONAM.2018.8508495","DOI":"10.1109\/ASONAM.2018.8508495"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D.: Ultrafast shortest-path queries via transit nodes. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) The Shortest Path Problem, pp. 175\u2013392. AMS (2006)","DOI":"10.1090\/dimacs\/074\/07"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-42058-1_22","volume-title":"Intelligent Information and Database Systems","author":"J-S Chen","year":"2020","unstructured":"Chen, J.-S., Huang, H.-Y., Hsu, C.-Y.: A kNN based position prediction method for SNS places. In: Nguyen, N.T., Jearanaitanakij, K., Selamat, A., Trawi\u0144ski, B., Chittayasothorn, S. (eds.) ACIIDS 2020. LNCS (LNAI), vol. 12034, pp. 266\u2013273. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42058-1_22"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Chen, Z., Li, P., Xiao, J., Nie, L., Liu, Y.: An order dispatch system based on reinforcement learning for ride sharing services. In: 2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), pp. 758\u2013763 (2020). https:\/\/doi.org\/10.1109\/HPCC-SmartCity-DSS50907.2020.00099","DOI":"10.1109\/HPCC-SmartCity-DSS50907.2020.00099"},{"key":"18_CR6","unstructured":"Demetrescu, C.: The 9th DIMACS Implementation Challenge (June 2010). http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N Jing","year":"1998","unstructured":"Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3), 409\u2013432 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of Multilevel Graph Partitioning. In: Proceedings of the IEEE\/ACM SC95 Conference (SC 1995), pp. 29-es (1995)","DOI":"10.1145\/224170.224229"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Kesarwani, A., Chauhan, S.S., Nair, A.R.: fake news detection on social media using k-nearest neighbor classifier. In: 2020 International Conference on Advances in Computing and Communication Engineering (ICACCE), pp. 1\u20134 (2020). https:\/\/doi.org\/10.1109\/ICACCE49060.2020.9154997","DOI":"10.1109\/ICACCE49060.2020.9154997"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Kobayashi, S., Matsugu, S., Shiokawa, H.: Fast indexing algorithm for efficient k NN queries on complex networks. In: Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 343\u2013347 (2021)","DOI":"10.1145\/3487351.3489442"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Komamizu, T., Amagasa, T., Shaikh, S.A., Shiokawa, H., Kitagawa, H.: Towards real-time analysis of smart city data: A case study on city facility utilizations. In: 2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), pp. 1357\u20131364 (2016)","DOI":"10.1109\/HPCC-SmartCity-DSS.2016.0192"},{"key":"18_CR14","first-page":"545","volume":"3","author":"KCK Lee","year":"2012","unstructured":"Lee, K.C.K., Lee, W., Zheng, B., Tian, Y.: ROAD: A new spatial object search framework for road networks. IEEE Trans. Knowl. Data Eng. 3, 545\u2013560 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR15","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection (June 2014). http:\/\/snap.stanford.edu\/data"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Li, H., Zhang, Q., Lu, K.: Integrating mobile sensing and social network for personalized health-care application. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, SAC 2015, pp. 527\u2013534. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2695664.2695767,https:\/\/doi.org\/10.1145\/2695664.2695767","DOI":"10.1145\/2695664.2695767 10.1145\/2695664.2695767"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Li, Z., Chen, L., Wang, Y.: G*-Tree: An Efficient Spatial Index on Road Networks. In: Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE 2019), pp. 268\u2013279 (2019)","DOI":"10.1109\/ICDE.2019.00032"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Mei, S., Li, H., Fan, J., Zhu, X., Dyer, C.R.: Inferring air pollution by sniffing social media. In: 2014 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), pp. 534\u2013539 (2014). https:\/\/doi.org\/10.1109\/ASONAM.2014.6921638","DOI":"10.1109\/ASONAM.2014.6921638"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Ni, M., Li, T., Li, Q., Zhang, H., Ye, Y.: FindMal: a file-to-file social network based malware detection framework. Knowl. Based Syst. 112, 142\u2013151 (2016). https:\/\/doi.org\/10.1016\/j.knosys.2016.09.004,https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705116303215","DOI":"10.1016\/j.knosys.2016.09.004,"},{"issue":"6","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD), p. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.14778\/1687627.1687763","volume":"2","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. Proc. VLDB Endow. 2(1), 1210\u20131221 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Shiokawa, H.: Fast ObjectRank for large knowledge databases. In: Proceedings of the 20th International Semantic Web Conference (ISWC 2021) (2021)","DOI":"10.1007\/978-3-030-88361-4_13"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Shiokawa, H.: Scalable affinity propagation for massive datasets. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI 2021), vol. 35, 9639\u20139646, May 2021","DOI":"10.1609\/aaai.v35i11.17160"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Amagasa, T., Kitagawa, H.: Scaling fine-grained modularity clustering for massive graphs. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019), pp. 4597\u20134604, July 2019","DOI":"10.24963\/ijcai.2019\/639"},{"issue":"11","key":"18_CR26","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.14778\/2809974.2809980","volume":"8","author":"H Shiokawa","year":"2015","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: SCAN++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. Proc. VLDB 8(11), 1178\u20131189 (2015)","journal-title":"Proc. VLDB"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Takahashi, T.: DSCAN: distributed structural graph clustering for billion-edge graphs. In: Database and Expert Systems Applications: 31st International Conference, DEXA 2020, Bratislava, Slovakia, 14\u201317 September 2020, Proceedings, Part I, pp. 38\u201354 (2020)","DOI":"10.1007\/978-3-030-59003-1_3"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Kobayashi, S., Matsugu, H.S.: Indexing complex networks for fast attributed kNN queries. Soc. Netw. Anal. Mining 12(82) (2022)","DOI":"10.1007\/s13278-022-00904-w"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Suzuki, Y., Sato, M., Shiokawa, H., Yanagisawa, M., Kitagawa, H.: Masc: automatic sleep stage classification based on brain and myoelectric signals. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 1489\u20131496 (2017). https:\/\/doi.org\/10.1109\/ICDE.2017.218","DOI":"10.1109\/ICDE.2017.218"},{"issue":"8","key":"18_CR30","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-Tree: an efficient and Scalable Index for spatial search on road networks. IEEE Trans. Knowl. Data Eng. 27(8), 2175\u20132189 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Information Integration and Web Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21047-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T03:56:22Z","timestamp":1728446182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21047-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210464","9783031210471"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21047-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"iiWAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Integration and Web","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iiwas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iiwas.org\/conferences\/iiwas2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mix","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":"97","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":"26","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":"25","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":"27% - 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":"4","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":"5","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":"This volume includes 2 keynote speakers abstracts and a forum abstract.","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)"}}]}}