메뉴 건너뛰기




Volumn 22, Issue 3, 2010, Pages 334-347

Efficient multidimensional suppression for k-anonymity

Author keywords

Decision trees; Deindentified data; K anonymity; Privacy preserving data mining

Indexed keywords

ATTRIBUTE VALUES; CLASSIFICATION TREES; CONSISTENT VALUES; DATA MINING TECHNIQUES; DATA RECORDS; DATA SETS; HIERARCHY TREES; K-ANONYMITY; MANIPULATION TECHNIQUES; PREDICTIVE PERFORMANCE; PRIVACY PRESERVING DATA MINING; PRIVATE INFORMATION; SENSITIVE INFORMATIONS;

EID: 76749111694     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2009.91     Document Type: Article
Times cited : (90)

References (40)
  • 2
    • 49549094278 scopus 로고    scopus 로고
    • Negation recognition in medical narrative reports
    • L. Rokach, R. Romano, and O. Maimon, "Negation Recognition in Medical Narrative Reports," Information Retrieval, vol.11, no.6, pp. 499-538, 2008.
    • (2008) Information Retrieval , vol.11 , Issue.6 , pp. 499-538
    • Rokach, L.1    Romano, R.2    Maimon, O.3
  • 3
    • 30744457110 scopus 로고    scopus 로고
    • Local perspective of the impact of the HIPAA privacy rule on research
    • M.S. Wolf and C.L. Bennett, "Local Perspective of the Impact of the HIPAA Privacy Rule on Research," Cancer-Philadelphia Then Hoboken, vol.106, no.2, pp. 474-479, 2006.
    • (2006) Cancer-Philadelphia Then Hoboken , vol.106 , Issue.2 , pp. 474-479
    • Wolf, M.S.1    Bennett, C.L.2
  • 6
    • 0036811143 scopus 로고    scopus 로고
    • Achieving k-anonymity privacy protection using generalization and suppression
    • L. Sweeney, "Achieving k-Anonymity Privacy Protection Using Generalization and Suppression," Int'l J. Uncertainty, Fuzziness, and Knowledge-Based Systems, vol.10, no.5, pp. 571-588, 2002.
    • (2002) Int'l J. Uncertainty, Fuzziness, and Knowledge-Based Systems , vol.10 , Issue.5 , pp. 571-588
    • Sweeney, L.1
  • 9
    • 76749111107 scopus 로고    scopus 로고
    • Optimal k-anonymity with flexible generalization schemes through bottom-up searching
    • L. Tiancheng and I. Ninghui, "Optimal K-Anonymity with Flexible Generalization Schemes through Bottom-Up Searching," Proc. Sixth IEEE Int'l Conf. Data Mining Workshops, pp. 518-523, 2006.
    • (2006) Proc. Sixth IEEE Int'l Conf. Data Mining Workshops , pp. 518-523
    • Tiancheng, L.1    Ninghui, I.2
  • 10
    • 0242625276 scopus 로고    scopus 로고
    • Transforming data to satisfy privacy constraints
    • S.V. Iyengar, "Transforming Data to Satisfy Privacy Constraints," Proc. Eighth ACM SIGKDD, pp. 279-288, 2002.
    • (2002) Proc. Eighth ACM SIGKDD , pp. 279-288
    • Iyengar, S.V.1
  • 11
    • 34047165799 scopus 로고    scopus 로고
    • Anonymizing classification data for privacy preservation
    • May
    • B.C.M. Fung, K. Wang, and P.S. Yu, "Anonymizing Classification Data for Privacy Preservation," IEEE Trans. Knowledge and Data Eng., vol.19, no.5, pp. 711-725, May 2007.
    • (2007) IEEE Trans. Knowledge and Data Eng. , vol.19 , Issue.5 , pp. 711-725
    • Fung, B.C.M.1    Wang, K.2    Yu, P.S.3
  • 14
    • 0031381525 scopus 로고    scopus 로고
    • Wrappers for feature subset selection
    • R. Kohavi and G.H. John, "Wrappers for Feature Subset Selection," Artificial Intelligence, vol.97, nos. 1/2, pp. 273-324, 1997.
    • (1997) Artificial Intelligence , vol.97 , Issue.1-2 , pp. 273-324
    • Kohavi, R.1    John, G.H.2
  • 16
    • 0041783510 scopus 로고    scopus 로고
    • Privacy preserving data mining
    • A. Agrawal and R. Srikant, "Privacy Preserving Data Mining," ACM SIGMOD Record, vol.29, no.2, pp. 439-450, 2000.
    • (2000) ACM SIGMOD Record , vol.29 , Issue.2 , pp. 439-450
    • Agrawal, A.1    Srikant, R.2
  • 17
    • 12244293654 scopus 로고    scopus 로고
    • K-TTP: A new privacy model for large-scale distributed environments
    • B. Gilburd, A. Schuster, and R. Wolff, "k-TTP: A New Privacy Model for Large-Scale Distributed Environments," Proc. 10th ACM SIGKDD, pp. 563-568, 2004.
    • (2004) Proc. 10th ACM SIGKDD , pp. 563-568
    • Gilburd, B.1    Schuster, A.2    Wolff, R.3
  • 23
    • 28444478342 scopus 로고    scopus 로고
    • Privacy and ownership preserving of outsourced medical data
    • E. Bertino, B.C. Ooi, Y. Yang, and R.H. Deng, "Privacy and Ownership Preserving of Outsourced Medical Data," Proc. Int'l Conf. Data Eng., vol.21, pp. 521-532, 2005.
    • (2005) Proc. Int'l Conf. Data Eng. , vol.21 , pp. 521-532
    • Bertino, E.1    Ooi, B.C.2    Yang, Y.3    Deng, R.H.4
  • 26
    • 0035517699 scopus 로고    scopus 로고
    • Protecting respondents' identities in microdata release
    • Nov./Dec.
    • P. Samarati, "Protecting Respondents' Identities in Microdata Release," IEEE Trans. Knowledge and Data Eng., vol.13, no.6, pp. 1010-1027, Nov./Dec. 2001.
    • (2001) IEEE Trans. Knowledge and Data Eng. , vol.13 , Issue.6 , pp. 1010-1027
    • Samarati, P.1
  • 30
    • 41849136845 scopus 로고    scopus 로고
    • Privacy-preserving data mining through knowledge model sharing
    • Springer
    • P. Sharkey, H. Tian, W. Zhang, and S. Xu, "Privacy-Preserving Data Mining through Knowledge Model Sharing," Privacy, Security and Trust in KDD, pp. 97-115, Springer, 2008.
    • (2008) Privacy, Security and Trust in KDD , pp. 97-115
    • Sharkey, P.1    Tian, H.2    Zhang, W.3    Xu, S.4
  • 31
    • 0030169748 scopus 로고    scopus 로고
    • Towards tractable algebras for bags
    • S. Grumbach and T. Milo, "Towards Tractable Algebras for Bags," J. Computer and System Sciences, vol.52, no.3, pp. 570-588, 1996.
    • (1996) J. Computer and System Sciences , vol.52 , Issue.3 , pp. 570-588
    • Grumbach, S.1    Milo, T.2
  • 32
  • 33
    • 50549096139 scopus 로고    scopus 로고
    • Pessimistic cost-sensitive active learning of decision trees
    • L. Rokach, L. Naamani, and A. Shmilovici, "Pessimistic Cost-Sensitive Active Learning of Decision Trees," Data Mining and Knowledge Discovery, vol.17, no.2, pp. 283-316, 2008.
    • (2008) Data Mining and Knowledge Discovery , vol.17 , Issue.2 , pp. 283-316
    • Rokach, L.1    Naamani, L.2    Shmilovici, A.3
  • 35
    • 0033570831 scopus 로고    scopus 로고
    • Combined 52 cv F test for comparing supervised classification learning classifiers
    • E. Alpaydin, "Combined 52 cv F Test for Comparing Supervised Classification Learning Classifiers," Neural Computation, vol.11, no.8, pp. 1885-1892, 1999.
    • (1999) Neural Computation , vol.11 , Issue.8 , pp. 1885-1892
    • Alpaydin, E.1
  • 36
    • 36948999941 scopus 로고    scopus 로고
    • School of Information and Computer Science, Univ. of California
    • A. Asuncion and D.J. Newman, "UCI Machine Learning Repository," School of Information and Computer Science, Univ. of California, http://mlearn.ics.uci.edu/MLRepository.html, 2007.
    • (2007) UCI Machine Learning Repository
    • Asuncion, A.1    Newman, D.J.2
  • 39
    • 29644438050 scopus 로고    scopus 로고
    • Statistical comparisons of classifiers over multiple data sets
    • J. Demsar, "Statistical Comparisons of Classifiers over Multiple Data Sets," J. Machine Learning Research, vol.7, pp. 1-30, 2006. (Pubitemid 43022939)
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1-30
    • Demsar, J.1
  • 40
    • 38349121661 scopus 로고    scopus 로고
    • Genetic algorithm-based feature set partitioning for classification problems
    • L. Rokach, "Genetic Algorithm-Based Feature Set Partitioning for Classification Problems," Pattern Recognition, vol.41, no.5, pp. 1693-1717, 2008.
    • (2008) Pattern Recognition , vol.41 , Issue.5 , pp. 1693-1717
    • Rokach, L.1


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