메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 1132-1137

An incremental algorithm for mining privacy-preserving frequent itemsets

Author keywords

Data mining; Incremental; Privacy preserving

Indexed keywords

ALGORITHMS; DATA PRIVACY; DATA REDUCTION; DATABASE SYSTEMS; STATISTICAL METHODS;

EID: 33947202250     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLC.2006.258592     Document Type: Conference Paper
Times cited : (14)

References (18)
  • 3
    • 33947279033 scopus 로고    scopus 로고
    • The Economist. The end of Privacy. May 1st, 1999. pp.15.
    • The Economist. The end of Privacy. May 1st, 1999. pp.15.
  • 4
    • 0003504808 scopus 로고    scopus 로고
    • ACM SIGMOD WOrkshop on Research Issues on Data Mining and Knowledge Discovery
    • C. Clifton and D. Marks. Security and privacy implications of data mining. ACM SIGMOD WOrkshop on Research Issues on Data Mining and Knowledge Discovery, 1996. pp. 15-19.
    • (1996) Security and privacy implications of data mining , pp. 15-19
    • Clifton, C.1    Marks, D.2
  • 5
    • 0003585005 scopus 로고    scopus 로고
    • Data mining and privacy: A conflict in making. DS
    • November
    • K. Thearling. Data mining and privacy: a conflict in making. DS, November 1998.
    • (1998)
    • Thearling, K.1
  • 6
    • 0041783510 scopus 로고    scopus 로고
    • Privacy-preserving data mining
    • R. Agrawal and R. Srikant. Privacy-preserving data mining. SIGMOD 2000. pp. 439-450.
    • (2000) SIGMOD , pp. 439-450
    • Agrawal, R.1    Srikant, R.2
  • 7
    • 84974555530 scopus 로고    scopus 로고
    • Privacy preserving data mining
    • Y. Lindell and B. Pinkas. Privacy preserving data mining. Crypto 2000. pp. 36-54.
    • (2000) Crypto , pp. 36-54
    • Lindell, Y.1    Pinkas, B.2
  • 8
    • 0024914229 scopus 로고
    • Security Control Methods for Statistical Databases: A Comparison Study
    • N. R. Adam and J. C. Wortmann. Security Control Methods for Statistical Databases: A Comparison Study. ACM Comput. Surv. 21(4), 1989. pp. 515-556.
    • (1989) ACM Comput. Surv , vol.21 , Issue.4 , pp. 515-556
    • Adam, N.R.1    Wortmann, J.C.2
  • 10
    • 33947280069 scopus 로고    scopus 로고
    • S. R, M. Oliveira and Osmar R. Zaiane. Toward Standardization in Privacy-Preserving Data Mining. DMSSP 2004 (In conjunction with SIGKDD 2004).
    • S. R, M. Oliveira and Osmar R. Zaiane. Toward Standardization in Privacy-Preserving Data Mining. DMSSP 2004 (In conjunction with SIGKDD 2004).
  • 11
    • 0034827009 scopus 로고    scopus 로고
    • On the Design and Quantification of Privacy Preserving Data Mining Algorithms
    • D. Agrawal and C. Aggarwal. On the Design and Quantification of Privacy Preserving Data Mining Algorithms. PODS 2001. pp. 247-255.
    • (2001) PODS , pp. 247-255
    • Agrawal, D.1    Aggarwal, C.2
  • 13
    • 1142294784 scopus 로고    scopus 로고
    • Maintaining data privacy in association rule mining
    • S. Rizvi and J. Haritsa. Maintaining data privacy in association rule mining. VLDB 2002. pp. 682-693.
    • (2002) VLDB , pp. 682-693
    • Rizvi, S.1    Haritsa, J.2
  • 14
    • 77952334884 scopus 로고    scopus 로고
    • Using Randomized Response Techniques for Privacy-Preserving Data Mining
    • W. Du and Z. Zhan. Using Randomized Response Techniques for Privacy-Preserving Data Mining. SIGKDD 2003. pp. 505-510.
    • (2003) SIGKDD , pp. 505-510
    • Du, W.1    Zhan, Z.2
  • 15
    • 26944482104 scopus 로고    scopus 로고
    • S. Agrawal and J. Haritsa. On addressing efficiency concerns in privacy-preserving mining. DASFAA 2004. pp. 113-124.
    • S. Agrawal and J. Haritsa. On addressing efficiency concerns in privacy-preserving mining. DASFAA 2004. pp. 113-124.
  • 16
    • 0020312165 scopus 로고
    • Protocols for secure computations (Extended Abstract)
    • A. C. Yao. Protocols for secure computations (Extended Abstract). FOCS 1982. pp. 160-164.
    • (1982) FOCS , pp. 160-164
    • Yao, A.C.1
  • 17
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • R. Agrawal, T. Imielinski and A. N. Swami. Mining association rules between sets of items in large databases. SIGMOD 1993. pp. 207-216.
    • (1993) SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.N.3
  • 18
    • 0002221136 scopus 로고
    • Fast Algorithms for Mining Association Rules
    • R.Agrawal and R.Srikant. Fast Algorithms for Mining Association Rules. VLDB 1994. pp. 487-499.
    • (1994) VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2


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