메뉴 건너뛰기




Volumn , Issue , 2005, Pages 217-228

Data privacy through optimal k-anonymization

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL CHALLENGE; DE-IDENTIFICATION; K-ANONYMIZATION; OPTIMAL SOLUTIONS;

EID: 28444449426     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.42     Document Type: Conference Paper
Times cited : (1012)

References (16)
  • 10
  • 15
    • 0000835392 scopus 로고
    • Opus: An efficient admissible algorithm for unordered search
    • G I. Webb. Opus: an efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research:3, 431-465, 1995.
    • (1995) Journal of Artificial Intelligence Research , vol.3 , pp. 431-465
    • Webb, G.I.1


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