{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:23:41Z","timestamp":1770679421452,"version":"3.49.0"},"reference-count":38,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"National Natural Science Foundation of China","award":["LH2023F031"],"award-info":[{"award-number":["LH2023F031"]}]},{"name":"National Natural Science Foundation of China","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["LH2023F031"],"award-info":[{"award-number":["LH2023F031"]}]},{"name":"Natural Science Foundation of Heilongjiang Province","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]},{"name":"National Key R&amp;D Program of China","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"National Key R&amp;D Program of China","award":["LH2023F031"],"award-info":[{"award-number":["LH2023F031"]}]},{"name":"National Key R&amp;D Program of China","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>In view of the existing research in the field of k-nearest neighbor query in the road network, the incompleteness of the query user\u2019s preference for data objects and the privacy protection of the query results are not considered, this paper proposes a multiuser incomplete preference k-nearest neighbor query algorithm based on differential privacy in the road network. The algorithm is divided into four parts; the first part proposes a multiuser incomplete preference completion algorithm based on association rules. The algorithm firstly uses the frequent pattern tree proposed in this paper to mine frequent item sets, then uses frequent item sets to mine strong correlation rules, and finally completes multiuser incomplete preference based on strong correlation rules. The second part proposes attribute preference weight coefficient based on multiuser\u2019 s different preferences and clusters users accordingly. The third part compares the dominance of the query object, filters the data with low dominance, and performs a k-neighbor query. The fourth part proposes a privacy budget allocation method based on differential privacy technology. The method uses the Laplace mechanism to add noise to the result release and balance the privacy and availability of data. Theoretical research and experimental analysis show that the proposed method can better deal with the multiuser incomplete preference k-nearest neighbor query and privacy protection problems in the road network.<\/jats:p>","DOI":"10.3390\/ijgi12070282","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:41:05Z","timestamp":1689554465000},"page":"282","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiuser Incomplete Preference K-Nearest Neighbor Query Method Based on Differential Privacy in Road Network"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7365-4836","authenticated-orcid":false,"given":"Liping","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojing","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,15]]},"reference":[{"key":"ref_1","first-page":"609","article-title":"High-dimensional data approximate k-nearest neighbor query based on dimension grouping dimensionality reduction","volume":"58","author":"Li","year":"2021","journal-title":"Comput. Res. Dev."},{"key":"ref_2","first-page":"1732","article-title":"OIQ-tree: An Index Supporting Continuous k-Nearest Neighbor Query over Large Scale Spatial Text Data Streams","volume":"44","author":"Yang","year":"2021","journal-title":"Chin. J. Comput."},{"key":"ref_3","first-page":"406","article-title":"A method for k nearest neighbor query of line segment in obstructed spaces","volume":"16","author":"Zhang","year":"2020","journal-title":"J. Inf. Process. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2575","DOI":"10.1109\/TNSE.2021.3099864","article-title":"Efficient Probabilistic K-NN Computation in Uncertain Sensor Networks","volume":"8","author":"Ding","year":"2021","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TKDE.2010.119","article-title":"Ranking spatial data by quality preferences","volume":"23","author":"You","year":"2010","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.14778\/1921071.1921076","article-title":"Efficient processing of top-k spatial preference queries","volume":"4","author":"Vlachou","year":"2010","journal-title":"Proc. VLDB Endow."},{"key":"ref_7","first-page":"284","article-title":"An efficient multiple-user location-based query authentication approach for social networking","volume":"47","author":"Wang","year":"2019","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3567","DOI":"10.1109\/TITS.2020.2995856","article-title":"Vehicle Trajectory Clustering Based on Dynamic Representation Learning of Internet of Vehicles","volume":"22","author":"Wang","year":"2021","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yang, Y., Li, H., Wang, J., Hu, Q., Wang, X., and Leng, M. (2019). A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks. Complexity, 1\u201318.","DOI":"10.1155\/2019\/4829164"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/TKDE.2010.181","article-title":"Group enclosing queries","volume":"23","author":"Li","year":"2010","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_11","first-page":"1993","article-title":"Target-aware holistic influence maximization in spatial social networks","volume":"13","author":"Cai","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3701","DOI":"10.1109\/TKDE.2020.2975998","article-title":"Flexible aggregate nearest neighbor queries and its keyword-aware variant on road networks","volume":"33","author":"Chen","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"100169","DOI":"10.1016\/j.bdr.2020.100169","article-title":"Knowledge graph-based spatial-aware user community preference query algorithm for lbsns","volume":"23","author":"Wang","year":"2021","journal-title":"Big Data Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1587\/transinf.2017EDP7375","article-title":"Processing Multiple-user Location-based Keyword Queries","volume":"101","author":"Wang","year":"2018","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"96975","DOI":"10.1109\/ACCESS.2021.3094547","article-title":"Efficient Skyline Computation on Uncertain Dimensions","volume":"9","author":"Saad","year":"2021","journal-title":"IEEE Access"},{"key":"ref_16","unstructured":"O\u2019connor, M., Cosley, D., Konstan, J.A., and Riedl, J. (2001, January 16\u201320). PolyLens: A Recommender System for Groups of Users. Proceedings of the Seventh European Conference on Computer Supported Cooperative Work, Bonn, Germany."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"754","DOI":"10.14778\/1687627.1687713","article-title":"Group recommendation: Semantics and efficiency","volume":"2","author":"Roy","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Yu, Z., Yu, Z., Zhou, X., and Nakamura, Y. (2009, January 8\u201311). Handling conditional preferences in recommender systems. Proceedings of the 14th International Conference on Intelligent User Interfaces, Sanibel Island, FL, USA.","DOI":"10.1145\/1502650.1502709"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Zheng, K., Su, H., Zheng, B., Shang, S., Xu, J., Liu, J., and Zhou, X. (2015, January 13\u201317). Interactive top-k spatial keyword queries. Proceedings of the 2015 IEEE 31st International Conference on Data Engineering, Seoul, Republic of Korea.","DOI":"10.1109\/ICDE.2015.7113303"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Dritsas, E., Maria, T., Panagiotis, G., and Spyros, S. (2018). Trajectory Clustering and k-NN for Robust Privacy Preserving Spatiotemporal Databases. Algorithms, 11.","DOI":"10.3390\/a11120207"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Dritsas, E., Kanavos, A., Trigka, M., Sioutas, S., and Tsakalidis, A. (2019). Storage Efficient Trajectory Clustering and k-NN for Robust Privacy Preserving Spatio-Temporal Databases. Algorithms, 12.","DOI":"10.3390\/a12120266"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"20492","DOI":"10.1109\/JIOT.2022.3177474","article-title":"EPGQ:Efficient and Private Feature-based Group Nearest Neighbor Query over Road Networks","volume":"9","author":"Guan","year":"2022","journal-title":"IEEE Internet Things J."},{"key":"ref_23","first-page":"471","article-title":"K-nearest neighbor Query method for protecting location privacy and query content privacy in road network","volume":"31","author":"Zhou","year":"2020","journal-title":"J. Softw."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork","year":"2014","journal-title":"Found. Trends Theor. Comput.Sci."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/TIFS.2013.2253320","article-title":"Utility-privacy tradeoffs in databases:An information-theoretic approach","volume":"8","author":"Sankar","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_26","unstructured":"Kaaniche, N., Masmoudi, S., Znina, S., and Laurent, M. (April, January 30). Privacy preserving cooperative computation for personalized web search applications. Proceedings of the 35th Annual ACM Symposium on Applied Computing, Brno, Czech Republic."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Rahali, S., Laurent, M., Masmoudi, S., Roux, C., and Mazeau, B. (2021, January 20\u201322). A Validated Privacy-Utility Preserving Recommendation System with Local Differential Privacy. Proceedings of the 2021 IEEE 15th International Conference on Big Data Science and Engineering (BigDataSE), Shenyang, China.","DOI":"10.1109\/BigDataSE53435.2021.00026"},{"key":"ref_28","first-page":"1610","article-title":"Spatial Data Approximate k-Nearest Neighbor Query Based on Localized Differential Privacy","volume":"59","author":"Zhang","year":"2022","journal-title":"Comput. Res. Dev."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Fan, Z., and Xu, X. (2019, January 10\u201312). APDPk-means: A new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation. Proceedings of the 2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems(HPCC\/SmartCity\/DSS), Zhangjiajie, China.","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00238"},{"key":"ref_30","first-page":"824","article-title":"A privacy-preserving distributed contextual federated online learning framework with big data support in social recommender systems","volume":"33","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"103328","DOI":"10.1016\/j.artint.2020.103328","article-title":"On the equivalence of optimal recommendation sets and myopically optimal query sets","volume":"286","author":"Viappiani","year":"2020","journal-title":"Artif. Intell."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1080\/13658810701587891","article-title":"Generalized Network Voronoi Diagrams: Concepts, Computational Methods, and Applications","volume":"22","author":"Okabe","year":"2008","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_33","unstructured":"Lukasiewicz, T., Martinez, M.V., and Simari, G.I. (2014). ECAI 2014, IOS Press."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2450142.2450148","article-title":"A learning theory approach to noninteractive database privacy","volume":"60","author":"Blum","year":"2013","journal-title":"J. ACM(JACM)"},{"key":"ref_35","first-page":"227","article-title":"K-dominant spatial Skyline query method in road network environment","volume":"57","author":"Li","year":"2020","journal-title":"Comput. Res. Dev."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJDS.2021.117460","article-title":"Dynamic Sorting and Average Skyline Method for Query Processing in Spatial-temporal Data","volume":"6","author":"John","year":"2021","journal-title":"Int. J. Data Sci."},{"key":"ref_37","first-page":"1","article-title":"Practical Approximate K Nearest Neighbor Queries with Location and Query Privacy","volume":"28","author":"Xun","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.jpdc.2019.07.013","article-title":"Privacy-preserving K Nearest Neighbor Query with Authentication on Road Networks","volume":"134","author":"Yang","year":"2019","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/7\/282\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:12:37Z","timestamp":1760127157000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/7\/282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":38,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,7]]}},"alternative-id":["ijgi12070282"],"URL":"https:\/\/doi.org\/10.3390\/ijgi12070282","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,15]]}}}