LBS连续查询的匿名序列规则挖掘方法研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Investigation on Anonymous Sequential Rules Mining Method with LBS Continuous Query
  • 作者:陈泽伟 ; 张海涛
  • 英文作者:CHEN Ze-wei;ZHANG Hai-tao;College of Telecommunications and Information Engineering,Nanjing University of Posts and Telecommunications;College of Geographic and Biologic Information,Nanjing University of Posts and Telecommunications;
  • 关键词:位置服务 ; 位置隐私保护 ; 时空K-匿名 ; 序列规则
  • 英文关键词:location based service;;location privacy protection;;spatial temporal K-anonymity;;sequence rules
  • 中文刊名:WJFZ
  • 英文刊名:Computer Technology and Development
  • 机构:南京邮电大学通信与信息工程学院;南京邮电大学地理与生物信息学院;
  • 出版日期:2017-04-28 17:02
  • 出版单位:计算机技术与发展
  • 年:2017
  • 期:v.27;No.242
  • 基金:国家自然科学基金资助项目(41201465)
  • 语种:中文;
  • 页:WJFZ201706027
  • 页数:6
  • CN:06
  • ISSN:61-1450/TP
  • 分类号:130-135
摘要
随着LBS的深入发展与广泛应用,隐私保护成为LBS深入发展中亟待解决的关键技术问题。时空K-匿名是LBS隐私保护的主要类型,当前研究尚未涉及匿名集数据的可用性和隐私保护的安全性。针对上述问题,基于匿名集数据具有时空序列的特性,提出了一种基于双向不可逆扩展的匿名集序列规则挖掘算法。该算法在扫描序列数据库的过程中,对相应的项集进行位置标记,从而保证了对序列数据库一次扫描即能挖掘出用户移动的序列规则。通过对频繁模式进行扩展并发现用户的移动规律、行为模式,对所提出的算法进行了验证实验及其结果分析。实验结果表明,所提出算法的挖掘结果会涉及到敏感区域,如军事领域等,因此对于实现LBS位置隐私保护具有重要的实践意义,对于丰富隐私保护数据挖掘领域的研究具有一定的理论价值。
        With the deep development and wide use of Location-Based Services(LBS),privacy protection has become the key technology to be solved urgently in LBS.The temporal and spatial K-anonymity is the main type of LBS privacy protection,in which the availability of anonymous datasets and the security of privacy protection have not been involved so far.Aimed at this problem and found on a characteristic of spatial-temporal sequences in anonymous dataset,a mining algorithm of anonymity dataset sequence rules has been presented with bidirectional irreversible expansion,which has marked the position of item sets in the process of scanning the sequence database to guarantee mining mobile sequential rules at just one scan of sequence database.Experiments of data mining and result validation have been conducted.Result mined by the algorithm covers sensitive regions like military possessions,which has been proved to have important practical value for realizing LBS privacy protection and certain theoretical value for enriching the study in privacy protection data mining area.
引文
[1]赵文斌,张登荣.移动计算环境中的地理信息系统[J].地理与地理信息科学,2003,19(2):19-23.
    [2]彭志宇,李善平.移动环境下LBS位置隐私保护[J].电子与信息学报,2011,33(5):1211-1216.
    [3]张海涛,高莎莎,徐亮.空时K-匿名数据的关联规则挖掘研究[J].地理与地理信息科学,2012,28(6):13-16.
    [4]Gedik B,Liu L.Location privacy in mobile systems:a personalized anonymization model[C]//Proceedings of ICDCS.[s.l.]:[s.n.],2005:620-629.
    [5]Xu T,Cai Y.Feeling-based location privacy protection for location-based services[C]//ACM conference on computer and communications security.[s.l.]:ACM,2009:348-357.
    [6]Mokbel M F,Chow C,Aref W G.The new casper:query processing for location services without compromising privacy[C]//Proceedings of VLDB.[s.l.]:[s.n.],2006:763-774.
    [7]Ku Wei-Shinn,Zimmermann R,Peng Wen-Chih,et al.Privacy protected query processing on spatial networks[C]//Proceedings of ICDE workshops.[s.l.]:[s.n.],2007:215-220.
    [8]林欣,李善平,杨朝晖.LBS中连续查询攻击算法及匿名性度量[J].软件学报,2009,20(4):1058-1068.
    [9]Xu T,Cai Y.Location anonymity in continuous location-based services[C]//Proceedings of the 15th annual ACM international symposium on advances in geographic information systems.[s.l.]:ACM,2007:39.
    [10]Chow C Y,Mokbel M F.Enabling private continuous queries for revealed user locations[C]//Proceedings of SSTD.[s.l.]:[s.n.],2007:258-275.
    [11]Chen J,Cheng R,Mokbel M,et al.Scalable processing of snapshot and continuous nearest-neighbor queries over onedimensional uncertain data[J].The VLDB Journal,2009,18(5):1219-1240.
    [12]Wang Yiming,Wang Lingyu,Fung B C M.Preserving privacy for location-based services with continuous queries[C]//Proceedings of ICC.[s.l.]:[s.n.],2009:1-5.
    [13]王虎,丁世飞.序列模式挖掘研究与发展[J].计算机科学,2009,36(12):14-17.
    [14]汪林林,范军.基于Prefixspan的序列模式挖掘改进算法[J].计算机工程,2009,35(23):56-58.
    [15]常鹏,陈耿,朱玉全.一种分布式序列模式挖掘算法[J].计算机应用,2008,28(11):2964-2966.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700