{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:33:41Z","timestamp":1759530821773,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811528095"},{"type":"electronic","value":"9789811528101"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-2810-1_17","type":"book-chapter","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T18:03:11Z","timestamp":1580580191000},"page":"167-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LSR-Forest: An LSH-Based Approximate k-Nearest Neighbor Query Algorithm on High-Dimensional Uncertain Data"],"prefix":"10.1007","author":[{"given":"Jiagang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anbang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangbo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,2]]},"reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1109\/TFUZZ.2016.2516562","volume":"24","author":"M Xiaoye","year":"2016","unstructured":"Xiaoye, M., Yunjun, G., Gang, C.: Processing incomplete k nearest neighbor search. IEEE Trans. Fuzzy Syst. 24(6), 1349\u20131363 (2016)","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00778-014-0361-2","volume":"24","author":"A Sistla","year":"2015","unstructured":"Sistla, A., Wolfson, O., Xu, B.: Continuous nearest-neighbor queries with location uncertainty. VLDB 24(1), 25\u201350 (2015)","journal-title":"VLDB"},{"issue":"1","key":"17_CR3","first-page":"32","volume":"609","author":"L Jian","year":"2016","unstructured":"Jian, L., Haiao, W.: Range queries on uncertain data. Theoret. Comput. Sci. 609(1), 32\u201348 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR4","unstructured":"Lin, J.C.W., Gan, W., Fournier-Viger, P., Hong, T.P., Chao, H.C.: Mining weighted frequent itemsets without candidate generation in uncertain databases. Int. J. Inf. Technol. Decis. Making 16(06), 1549\u20131579 (2017)"},{"key":"17_CR5","unstructured":"Ebrahimnejad, A., Tavana, M., Nasseri, S.H., Gholami, O.F.: A new method for solving dual DEA problems with fuzzy stochastic data. Int. J. Inf. Technol. Decis. Making 18(01), 147\u2013170 (2019)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.physa.2019.03.012","volume":"523","author":"J Jianhua","year":"2019","unstructured":"Jianhua, J., Yujun, C., Xianqiu, M., Limin, W., Keqin, L.: A novel density peaks clustering algorithm based on k nearest neighbours for improving assignment process. Phys. A 523, 702\u2013713 (2019)","journal-title":"Phys. A"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.physa.2018.09.002","volume":"514","author":"J Jiang","year":"2019","unstructured":"Jiang, J., Chen, Y., Hao, D., Li, K.: DPC-LG: density peaks clustering based on logistic distribution and gravitation. Phys. A 514, 25\u201335 (2019)","journal-title":"Phys. A"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD International Conference on Management of Data, New York, NY, USA, vol. 14(2), pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Peng, Y., Li, H., Cui, J.: An efficient range query model over encrypted outsourced data using secure k-d tree. In: International Conference on Networking and Network Applications, pp. 250\u2013253 (2016)","DOI":"10.1109\/NaNA.2016.31"},{"key":"17_CR10","unstructured":"Weber, R., Schek, H., Blot, S.: A quantitative analysis and performance study for similarity search methods in high-dimensional spaces. In: International Conference on Very Large Data Bases, New York, pp. 194\u2013205 (1998)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.neucom.2015.08.112","volume":"195","author":"D Zhenyun","year":"2016","unstructured":"Zhenyun, D., Xiaoshu, Z., Debo, C., Ming, Z., Shichao, Z.: Efficient kNN classification algorithm for big data. Neurocomputing 195, 143\u2013148 (2016)","journal-title":"Neurocomputing"},{"issue":"03","key":"17_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1142\/S0219622018500141","volume":"17","author":"F Giyasettin Ozcan","year":"2018","unstructured":"Giyasettin Ozcan, F.: Unsupervised learning from multi-dimensional data: a fast clustering algorithm utilizing canopies and statistical information. Int. J. Inf. Technol. Decis. Making 17(03), 841\u2013856 (2018)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, R., Dmitri, V., Sunil, P.: Evaluating probabilistic queries over imprecise data. In: ACM SIGMOD International Conference on Management of Data, New York, USA, pp. 551\u2013562 (2003)","DOI":"10.1145\/872757.872823"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"48935","DOI":"10.1109\/ACCESS.2019.2909752","volume":"7","author":"J Lianmeng","year":"2019","unstructured":"Lianmeng, J., Xiaojiao, G., Quanpan, B.: KNN: k-nearest neighbor classifier with pairwise distance metrics and belief function theory. IEEE Access 7, 48935\u201348947 (2019)","journal-title":"IEEE Access"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Ljosa, V., Singh, A.: APLA: indexing arbitrary probability distributions. In: Proceedings ICDE, Turkey, pp. 946\u2013955 (2007)","DOI":"10.1109\/ICDE.2007.367940"},{"issue":"9","key":"17_CR16","first-page":"1112","volume":"16","author":"C Reynold","year":"2003","unstructured":"Reynold, C., Prabhakar, S., Dmitri, V.: Querying imprecise data in moving object environments. IEEE Trans. Knowl. Data Eng. J. 16(9), 1112\u20131127 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng. J."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-71703-4_30","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"H-P Kriegel","year":"2007","unstructured":"Kriegel, H.-P., Kunath, P., Renz, M.: Probabilistic nearest-neighbor query on uncertain objects. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 337\u2013348. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71703-4_30"},{"key":"17_CR18","unstructured":"Reynold, C., Jinchuan, C., Mohamed, M.: Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data. In: Proceedings of International Conference on Data Engineering (ICDE). Piscataway, NJ, pp. 973\u2013982. IEEE (2008)"},{"key":"17_CR19","unstructured":"Reynold, C., Lei, C., Jinchuan, C.: Evaluating probability threshold k-nearest-neighbor queries over uncertain data. In: Proceedings of International Conference on Extending Database Technology, New York, pp. 672\u2013683 (2009)"},{"key":"17_CR20","unstructured":"Gionis, A., Indyky, P., Motwaniz, R.: Similarity search in high dimensions via hashing. In: International Conference on Very Large Data Bases, Cairo, Egypt, pp. 518\u2013529 (1998)"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-2810-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T10:04:38Z","timestamp":1587809078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-2810-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811528095","9789811528101"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-2810-1_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Service","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icds2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vcrab.com.au\/ICDS2019\/home.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"210","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":"64","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":"30% - 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":"14","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)"}}]}}