arrow
Return

k-Anonymity Location Privacy Algorithm Based on Clustering

delete2018-01-01
delete19
delete
OA
AI
郑丽娟 (Lijuan Zheng) *
H
Huanhuan Yue
李沼萱 cover
李沼萱 (Zhaoxuan Li)
潘晓 (Xiao Pan)
M
Mei Wu
杨帆 cover
杨帆 (Fan Yang)
DOI:10.1109/ACCESS.2017.2780111delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The accuracy of user location information is inversely proportional to the user's privacy preserving degree k, and is proportional to quality of query service. In order to balance the conflict between privacy preserving security and query quality caused by the accuracy of location information, a clustering algorithm aiming at eliminating outliers based on the k-anonymity location privacy preserving model is proposed, which is used to realize the establishment of anonymous group in the anonymous model. The distribution of user in the anonymous group is optimized. The idea of replacing the user location query by the center of the anonymous group is proposed. The number of repeated queries is reduced, and the quality of query service is improved on the premise of ensuring security through the experimental analysis and comparison with other schemes.
Keywords:
Clustering
k-anonymity
location privacy
quality of query service
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

S
Shijiazhuang Tiedao University
Scholars:
4.1K
Papers: 2.4K
Citations: 1.7K
W
wuhan institute of technology
Scholars:
1.0W
Papers: 6.5K
Citations: 11