An accurate method for mining top-k frequent pattern under differential privacy

被引：0
|
作者：
Zhang, Xiaojian [1 ,2 ]
Wang, Miao [1 ]
Meng, Xiaofeng [1 ]
机构：
[1] School of Information, Renmin University of China, Beijing 100872, China
[2] School of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou 450002, China
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2014年 / 51卷 / 01期
关键词：
Compendex;
D O I：
10.7544/issn1000-1239.2014.20130685
中图分类号：
学科分类号：
摘要：
Laplace transforms
引用
收藏
页码：104 / 114
相关论文
共 50 条
  • [1] An effective scheme for top-k frequent itemset mining under differential privacy conditions
    Wenjuan LIANG
    Hong CHEN
    Jing ZHANG
    Dan ZHAO
    Cuiping LI
    Science China(Information Sciences), 2020, 63 (05) : 200 - 202
  • [2] An effective scheme for top-k frequent itemset mining under differential privacy conditions
    Liang, Wenjuan
    Chen, Hong
    Zhang, Jing
    Zhao, Dan
    Li, Cuiping
    SCIENCE CHINA-INFORMATION SCIENCES, 2020, 63 (05)
  • [3] An effective scheme for top-k frequent itemset mining under differential privacy conditions
    Wenjuan Liang
    Hong Chen
    Jing Zhang
    Dan Zhao
    Cuiping Li
    Science China Information Sciences, 2020, 63
  • [4] Frequent sequential pattern mining under differential privacy
    Lu, Guoqing
    Zhang, Xiaojian
    Ding, Liping
    Li, Yanfeng
    Liao, Xin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2015, 52 (12): : 2789 - 2801
  • [5] Discovering top-k patterns with differential privacy-an accurate approach
    Xiaojian Zhang
    Xiaofeng Meng
    Frontiers of Computer Science, 2014, 8 : 816 - 827
  • [6] Discovering top-k patterns with differential privacy-an accurate approach
    Zhang, Xiaojian
    Meng, Xiaofeng
    FRONTIERS OF COMPUTER SCIENCE, 2014, 8 (05) : 816 - 827
  • [7] Distributed Top-k Pattern Mining
    Wang, Xin
    Xiang, Mingyue
    Zhan, Huayi
    Lan, Zhuo
    He, Yuang
    He, Yanxiao
    Sha, Yuji
    WEB AND BIG DATA, APWEB-WAIM 2021, PT II, 2021, 12859 : 203 - 220
  • [8] TKG: Efficient Mining of Top-K Frequent Subgraphs
    Fournier-Viger, Philippe
    Cheng, Chao
    Lin, Jerry Chun-Wei
    Yun, Unil
    Kiran, R. Uday
    BIG DATA ANALYTICS (BDA 2019), 2019, 11932 : 209 - 226
  • [9] Mining top-k frequent closed iternsets is not in APX
    Wu, Chienwen
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2006, 3918 : 435 - 439
  • [10] TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support
    Li, Yuhua
    Lin, Quan
    Li, Ruixuan
    Duan, Dongsheng
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2010, PT I, 2010, 6440 : 537 - 548
12345