메뉴 건너뛰기




Volumn 5, Issue 11, 2012, Pages 1340-1351

Privbasis: Frequent itemset mining with differential privacy

Author keywords

[No Author keywords available]

Indexed keywords

BASIS SETS; DIFFERENTIAL PRIVACIES; FREQUENT ITEMSET MINING; ITEM SETS; ITEMSET; RESEARCH PURPOSE; STATE OF THE ART; TRANSACTION DATABASE;

EID: 84872862536     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350251     Document Type: Article
Times cited : (157)

References (34)
  • 1
    • 84873118092 scopus 로고    scopus 로고
    • AOL search log dataset
    • AOL search log dataset. http://www.gregsadetsky.com/aol-data/.
  • 2
    • 85039661885 scopus 로고    scopus 로고
    • Frequent itemset mining dataset repository
    • Frequent itemset mining dataset repository. http://fimi.ua.ac.be/data/.
  • 3
    • 35348877424 scopus 로고    scopus 로고
    • Why we search: visualizing and predicting user behavior
    • E. Adar, D. S. Weld, B. N. Bershad, and S. D. Gribble. Why we search: visualizing and predicting user behavior. In WWW, pages 161-170, 2007.
    • (2007) WWW , pp. 161-170
    • Adar, E.1    Weld, D.S.2    Bershad, B.N.3    Gribble, S.D.4
  • 4
    • 33745629638 scopus 로고    scopus 로고
    • On k-anonymity and the curse of dimensionality
    • C. C. Aggarwal. On k-anonymity and the curse of dimensionality. In VLDB, pages 901-909, 2005.
    • (2005) VLDB , pp. 901-909
    • Aggarwal, C.C.1
  • 5
    • 0002221136 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487-499, 1994.
    • (1994) VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 7
    • 35448955720 scopus 로고    scopus 로고
    • Privacy, accuracy, and consistency too: a holistic solution to contingency table release
    • B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In PODS, pages 273-282, 2007.
    • (2007) PODS , pp. 273-282
    • Barak, B.1    Chaudhuri, K.2    Dwork, C.3    Kale, S.4    McSherry, F.5    Talwar, K.6
  • 8
    • 77956209107 scopus 로고    scopus 로고
    • Discovering frequent patterns in sensitive data
    • R. Bhaskar, S. Laxman, A. Smith, and A. Thakurta. Discovering frequent patterns in sensitive data. In KDD, pages 503-512, 2010.
    • (2010) KDD , pp. 503-512
    • Bhaskar, R.1    Laxman, S.2    Smith, A.3    Thakurta, A.4
  • 9
    • 33244468835 scopus 로고    scopus 로고
    • Practical privacy: the sulq framework
    • A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In PODS, pages 128-138, 2005.
    • (2005) PODS , pp. 128-138
    • Blum, A.1    Dwork, C.2    McSherry, F.3    Nissim, K.4
  • 10
    • 57049136138 scopus 로고    scopus 로고
    • A learning theory approach to non-interactive database privacy
    • A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In STOC, pages 609-618, 2008.
    • (2008) STOC , pp. 609-618
    • Blum, A.1    Ligett, K.2    Roth, A.3
  • 11
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to correlations
    • S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In SIGMOD, pages 265-276, 1997.
    • (1997) SIGMOD , pp. 265-276
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 12
    • 84976668743 scopus 로고
    • Finding all cliques of an undirected graph (algorithm 457)
    • C. Bron and J. Kerbosch. Finding all cliques of an undirected graph (algorithm 457). Commun. ACM, 16(9):575-576, 1973.
    • (1973) Commun. ACM , vol.16 , Issue.9 , pp. 575-576
    • Bron, C.1    Kerbosch, J.2
  • 13
    • 79956041471 scopus 로고    scopus 로고
    • Rho-uncertainty: Inference-proof transaction anonymization
    • J. Cao, P. Karras, C. Raïssi, and K.-L. Tan. Rho-uncertainty: Inference-proof transaction anonymization. PVLDB, 3(1):1033-1044, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 1033-1044
    • Cao, J.1    Karras, P.2    Raïssi, C.3    Tan, K.-L.4
  • 14
    • 84861595370 scopus 로고    scopus 로고
    • Publishing set-valued data via differential privacy
    • R. Chen, N. Mohammed, B. C. M. Fung, B. C. Desai, and L. Xiong. Publishing set-valued data via differential privacy. PVLDB, 4(11):1087-1098, 2011.
    • (2011) PVLDB , vol.4 , Issue.11 , pp. 1087-1098
    • Chen, R.1    Mohammed, N.2    Fung, B.C.M.3    Desai, B.C.4    Xiong, L.5
  • 15
    • 1142275486 scopus 로고    scopus 로고
    • Revealing information while preserving privacy
    • I. Dinur and K. Nissim. Revealing information while preserving privacy. In PODS, pages 202-210, 2003.
    • (2003) PODS , pp. 202-210
    • Dinur, I.1    Nissim, K.2
  • 16
    • 33746335051 scopus 로고    scopus 로고
    • Differential privacy
    • C. Dwork. Differential privacy. In ICALP, pages 1-12, 2006.
    • (2006) ICALP , pp. 1-12
    • Dwork, C.1
  • 17
    • 33745556605 scopus 로고    scopus 로고
    • Calibrating noise to sensitivity in private data analysis
    • C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, pages 265-284, 2006.
    • (2006) TCC , pp. 265-284
    • Dwork, C.1    McSherry, F.2    Nissim, K.3    Smith, A.4
  • 18
    • 35048856104 scopus 로고    scopus 로고
    • Privacy-preserving datamining on vertically partitioned databases
    • C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, pages 528-544, 2004.
    • (2004) CRYPTO , pp. 528-544
    • Dwork, C.1    Nissim, K.2
  • 19
    • 77956195013 scopus 로고    scopus 로고
    • Data mining with differential privacy.
    • A. Friedman and A. Schuster. Data mining with differential privacy. In KDD, pages 493-502, 2010.
    • (2010) KDD , pp. 493-502
    • Friedman, A.1    Schuster, A.2
  • 22
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53-87, 2004.
    • (2004) Data Min. Knowl. Discov. , vol.8 , Issue.1 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 24
    • 78049372159 scopus 로고    scopus 로고
    • Anonymization of set-valued data via top-down, local generalization
    • Y. He and J. F. Naughton. Anonymization of set-valued data via top-down, local generalization. PVLDB, 2(1):934-945, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 934-945
    • He, Y.1    Naughton, J.F.2
  • 27
    • 70350678967 scopus 로고    scopus 로고
    • Differentially private recommender systems: Building privacy into the netflix prize contenders
    • F. McSherry and I. Mironov. Differentially private recommender systems: Building privacy into the netflix prize contenders. In KDD, pages 627-636, 2009.
    • (2009) KDD , pp. 627-636
    • McSherry, F.1    Mironov, I.2
  • 30
    • 35448955271 scopus 로고    scopus 로고
    • Smooth sensitivity and sampling in private data analysis
    • K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC, pages 75-84, 2007.
    • (2007) STOC , pp. 75-84
    • Nissim, K.1    Raskhodnikova, S.2    Smith, A.3
  • 33
    • 79959540412 scopus 로고    scopus 로고
    • Differential privacy via wavelet transforms
    • X. Xiao, G. Wang, and J. Gehrke. Differential privacy via wavelet transforms. IEEE Trans. Knowl. Data Eng., 23(8):1200-1214, 2011.
    • (2011) IEEE Trans. Knowl. Data Eng. , vol.23 , Issue.8 , pp. 1200-1214
    • Xiao, X.1    Wang, G.2    Gehrke, J.3
  • 34
    • 65449148368 scopus 로고    scopus 로고
    • Anonymizing transaction databases for publication
    • Y. Xu, K. Wang, A. W.-C. Fu, and P. S. Yu. Anonymizing transaction databases for publication. In KDD, pages 767-775, 2008.
    • (2008) KDD , pp. 767-775
    • Xu, Y.1    Wang, K.2    Fu, A.-C.3    Yu, P.S.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.