Multiuser Incomplete Preference K-Nearest Neighbor Query Method Based on Differential Privacy in Road Network

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

Publisher

MDPI AG

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3