一种基于类四叉树的位置K-匿名算法  

A Similar Quadtree Based on Location K-Anonymity Algorithm

作　　者：金福生[1] 叶子石 宋红[1] 

机构地区：[1]北京理工大学软件学院,北京100081

出　　处：《北京理工大学学报》2014年第1期68-71,76,共5页Transactions of Beijing Institute of Technology

基　　金：国家自然科学基金资助项目(61003065)

摘　　要：通过对Casper模型在匿名度和位置服务精准度方面优化,提出了一种基于类四叉树的位置K-匿名算法.该算法采用自底向上的机制,在扩大扫描区域时,对请求用户所在网格的周边网格进行优先扫描,然后再进行层级和空间分辨率上的提高.实验结果表明,该算法能够更好地提高位置服务的质量和匿名区域的准确度.Through optimizing the degree of anonymity and accuracy of location-based on services of the Casper model, a similar quadtree based location K-anonymity algorithm is proposed. The algorithm uses a bottom-up mechanism, and in expanding the scanning area, the grids located around requesting user＇s grid are first scanned, then the level and spatial resolution are increased. Experiment results show the proposed algorithm can improve the quality of location-based services and the accuracy of the anonymous areas.

关 键 词：类四叉树 位置K-匿名 Casper优化 自底向上 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]