메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1425-1429

Blocking inference channels in frequent pattern sharing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA PRIVACY;

EID: 34548769227     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.369027     Document Type: Conference Paper
Times cited : (14)

References (16)
  • 1
    • 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
  • 2
    • 0041783510 scopus 로고    scopus 로고
    • Privacy-preserving data mining
    • R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD Conference, pages 439-450, 2000.
    • (2000) SIGMOD Conference , pp. 439-450
    • Agrawal, R.1    Srikant, R.2
  • 4
    • 3142693990 scopus 로고    scopus 로고
    • Computational complexity of itemset frequency satisfiability
    • T. Calders. Computational complexity of itemset frequency satisfiability. In PODS, pages 143-154, 2004.
    • (2004) PODS , pp. 143-154
    • Calders, T.1
  • 7
    • 32344446366 scopus 로고    scopus 로고
    • Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
    • G. Jagannathan and R. N. Wright. Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In KDD, pages 593-599, 2005.
    • (2005) KDD , pp. 593-599
    • Jagannathan, G.1    Wright, R.N.2
  • 8
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov, 1(3):241-258, 1997.
    • (1997) Data Min. Knowl. Discov , vol.1 , Issue.3 , pp. 241-258
    • Mannila, H.1    Toivonen, H.2
  • 10
    • 84879121553 scopus 로고    scopus 로고
    • Algorithms for balancing privacy and knowledge discovery in association rule mining
    • S. R. M. Oliveira and O. R. Zaïane. Algorithms for balancing privacy and knowledge discovery in association rule mining. In IDEAS, pages 54-65, 2003.
    • (2003) IDEAS , pp. 54-65
    • Oliveira, S.R.M.1    Zaïane, O.R.2
  • 12
    • 1142294784 scopus 로고    scopus 로고
    • Maintaining data privacy in association rule mining
    • S. Rizvi and J. R. Haritsa. Maintaining data privacy in association rule mining. In VLDB, pages 682-693, 2002.
    • (2002) VLDB , pp. 682-693
    • Rizvi, S.1    Haritsa, J.R.2
  • 13
    • 0344990562 scopus 로고    scopus 로고
    • Using unknowns to prevent discovery of association rules
    • Y. Saygin, V. S. Verykios, and C. Clifton. Using unknowns to prevent discovery of association rules. SIGMOD Record, 30(4):45-54, 2001.
    • (2001) SIGMOD Record , vol.30 , Issue.4 , pp. 45-54
    • Saygin, Y.1    Verykios, V.S.2    Clifton, C.3
  • 15
    • 33746093272 scopus 로고    scopus 로고
    • An effective approach for hiding sensitive knowledge in data publishing
    • Z. Wang, B. Liu, W. Wang, H. Zhou, and B. Shi. An effective approach for hiding sensitive knowledge in data publishing. In WAIM, pages 146-157, 2006.
    • (2006) WAIM , pp. 146-157
    • Wang, Z.1    Liu, B.2    Wang, W.3    Zhou, H.4    Shi, B.5


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