Multiuser Incomplete Preference K-Nearest Neighbor Query Method Based on Differential Privacy in Road Network
-
Published:2023-07-15
Issue:7
Volume:12
Page:282
-
ISSN:2220-9964
-
Container-title:ISPRS International Journal of Geo-Information
-
language:en
-
Short-container-title:IJGI
Author:
Zhang Liping1ORCID,
Zhang Xiaojing1,
Li Song1
Affiliation:
1. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Abstract
In view of the existing research in the field of k-nearest neighbor query in the road network, the incompleteness of the query user’s 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’ 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.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Heilongjiang Province
National Key R&D Program of China
Subject
Earth and Planetary Sciences (miscellaneous),Computers in Earth Sciences,Geography, Planning and Development
Reference38 articles.
1. High-dimensional data approximate k-nearest neighbor query based on dimension grouping dimensionality reduction;Li;Comput. Res. Dev.,2021
2. OIQ-tree: An Index Supporting Continuous k-Nearest Neighbor Query over Large Scale Spatial Text Data Streams;Yang;Chin. J. Comput.,2021
3. A method for k nearest neighbor query of line segment in obstructed spaces;Zhang;J. Inf. Process. Syst.,2020
4. Efficient Probabilistic K-NN Computation in Uncertain Sensor Networks;Ding;IEEE Trans. Netw. Sci. Eng.,2021
5. Ranking spatial data by quality preferences;You;IEEE Trans. Knowl. Data Eng.,2010