메뉴 건너뛰기




Volumn 2, Issue , 2009, Pages 23-27

A cost-efficient and versatile sanitizing algorithm by using a greedy approach

Author keywords

Association rule; FCET index tree; Greedy approximation; Greedy method; Maximal frequent itemsets

Indexed keywords

COST-EFFICIENT; DATABASE SECURITY; DATABASE SIZE; EFFICIENT DATA STRUCTURES; FREQUENT ITEMSETS; GREEDY APPROXIMATION; GREEDY APPROXIMATION ALGORITHMS; GREEDY METHOD; INDEX TREES; LONG-TERM GOALS; MAXIMAL FREQUENT ITEMSETS; MINING ASSOCIATION RULES; RETRIEVAL ENGINES; SENSITIVE INFORMATIONS; SIDE EFFECT; VERY LARGE DATABASE;

EID: 76349104193     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FSKD.2009.914     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 2
    • 0041783510 scopus 로고    scopus 로고
    • Privacy-preserving data mining
    • R.Agrawal, R. Srikant, "Privacy-preserving data mining", ACM SIGMOD Record archive Volume 29 , Issue 2, 2000, pp.439-450.
    • (2000) ACM SIGMOD Record archive , vol.29 , Issue.2 , pp. 439-450
    • Agrawal, R.1    Srikant, R.2
  • 5
    • 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," ACM SIGMOD Record, vol. 30, no. 4,, 2001, pp. 45-54.
    • (2001) ACM SIGMOD Record , vol.30 , Issue.4 , pp. 45-54
    • Saygin, Y.1    Verykios, V.S.2    Clifton, C.3
  • 9
    • 17044438212 scopus 로고    scopus 로고
    • Efficient algorithms for mining closed itemsets and their lattice structure
    • April
    • M.J. Zaki, C.-J. Hsiao, "Efficient algorithms for mining closed itemsets and their lattice structure" IEEE Transactions on Knowledge and Data Engineering, Volume 17, Issue 4, April ,2005, pp. 462-478.
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.4 , pp. 462-478
    • Zaki, M.J.1    Hsiao, C.-J.2
  • 11
    • 76349105349 scopus 로고    scopus 로고
    • http://www.almaden.ibm.com/software/quest/Resource


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