메뉴 건너뛰기




Volumn , Issue , 2009, Pages 624-635

Hiding distinguished ones into crowd: Privacy-preserving publishing data with outliers

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; ANONYMOUS GROUPS; DISTINGUISHABILITY; INDIVIDUAL PRIVACY; INFORMATION LOSS; K-ANONYMITY; LOCAL OUTLIERS; MICRODATA; PRIVACY PRESERVING; PRIVACY PRINCIPLE; PRIVATE INFORMATION;

EID: 70349108684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516433     Document Type: Conference Paper
Times cited : (6)

References (30)
  • 1
    • 0041783510 scopus 로고    scopus 로고
    • R. Agrawal and R. Srikant, Privacy-Preserving Data Mining, SIGMOD 2000.
    • R. Agrawal and R. Srikant, "Privacy-Preserving Data Mining", SIGMOD 2000.
  • 4
    • 77952380096 scopus 로고    scopus 로고
    • S. D. Bay, M. Schwabacher, Mining Distance-Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule, SIGKDD 2003.
    • S. D. Bay, M. Schwabacher, "Mining Distance-Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule", SIGKDD 2003.
  • 6
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. Bentley, "Multidimensional binary search trees used for associative searching". Communications of the ACM, 1975.
    • (1975) Communications of the ACM
    • Bentley, J.1
  • 7
    • 70349154737 scopus 로고    scopus 로고
    • S. Berchtold, D. Keim, and H. Kreigel, The X-tree: an index structure for high dimensional data, In VLDB, 1996.
    • S. Berchtold, D. Keim, and H. Kreigel, "The X-tree: an index structure for high dimensional data", In VLDB, 1996.
  • 8
    • 0039253819 scopus 로고    scopus 로고
    • M. M. Breunig, H. Kriegel, R.T. Ng, J. Sander, LOF: Identifying Density-Based Local Outliers, SIGMOD 2000.
    • M. M. Breunig, H. Kriegel, R.T. Ng, J. Sander, "LOF: Identifying Density-Based Local Outliers", SIGMOD 2000.
  • 10
    • 33745440901 scopus 로고    scopus 로고
    • Fast Mining of Distance-Based Outliers in High-Dimensional Datasets
    • SIDM
    • A. Ghoting, S. Parthasarathy, M. E. Otey, "Fast Mining of Distance-Based Outliers in High-Dimensional Datasets", SIDM, 2006.
    • (2006)
    • Ghoting, A.1    Parthasarathy, S.2    Otey, M.E.3
  • 11
    • 70349124297 scopus 로고    scopus 로고
    • R. Guttmann, A dynamic index structure for spatial searching, In SIGMOD, 1984
    • R. Guttmann, "A dynamic index structure for spatial searching", In SIGMOD, 1984
  • 12
    • 0242625276 scopus 로고    scopus 로고
    • V. S. Iyengar, Transforming data to satisfy privacy constraints, SIGKDD, 2002.
    • V. S. Iyengar, "Transforming data to satisfy privacy constraints", SIGKDD, 2002.
  • 13
    • 29844444250 scopus 로고    scopus 로고
    • K., David DeWitt, and Raghu Ramakrisfman, Incognito: Efficient Full-domain K-anonymity, SIGMOD 2005.
    • K., David DeWitt, and Raghu Ramakrisfman, "Incognito: Efficient Full-domain K-anonymity", SIGMOD 2005.
  • 15
    • 57149132810 scopus 로고    scopus 로고
    • J. Li, Y. Tao, X. Xiao, Preservation of Proximity Privacy in Publishing Numerical Sensitive Data, SIGMOD 2008.
    • J. Li, Y. Tao, X. Xiao, "Preservation of Proximity Privacy in Publishing Numerical Sensitive Data", SIGMOD 2008.
  • 19
    • 70349092371 scopus 로고    scopus 로고
    • M. Ercan Nergiz, Maurizio Atzori, Christopher W. Clifton, Hiding the Presence of Individuals from Shared Databases, SIGMOD'07.
    • M. Ercan Nergiz, Maurizio Atzori, Christopher W. Clifton, "Hiding the Presence of Individuals from Shared Databases", SIGMOD'07.
  • 20
    • 0034133513 scopus 로고    scopus 로고
    • Distance-based outliers: Algorithms and applications
    • E. M. Knorr, R. T. Ng, and V. Tucakov, "Distance-based outliers: algorithms and applications", VLDB Journal, 8(3-4):237-253,2000.
    • (2000) VLDB Journal , vol.8 , Issue.3-4 , pp. 237-253
    • Knorr, E.M.1    Ng, R.T.2    Tucakov, V.3
  • 21
    • 3142691086 scopus 로고    scopus 로고
    • On the Complexity of Optimal K-anonymity
    • PODS
    • Adam Meyerson, Ryan Williams, "On the Complexity of Optimal K-anonymity", PODS, 2004.
    • (2004)
    • Meyerson, A.1    Williams, R.2
  • 22
    • 0039845384 scopus 로고    scopus 로고
    • S. Ramaswamy, R. Rastogi, and K. Shim, Efficient algorithms for mining outliers from large data sets, SIGMOD 2000.
    • S. Ramaswamy, R. Rastogi, and K. Shim, "Efficient algorithms for mining outliers from large data sets", SIGMOD 2000.
  • 23
    • 70349118745 scopus 로고    scopus 로고
    • Generalizing Data to Provide Anonymity when Disclosing Information
    • PODS
    • P. Samarati, L. Sweendy, "Generalizing Data to Provide Anonymity when Disclosing Information", PODS, 1998.
    • (1998)
    • Samarati, P.1    Sweendy, L.2
  • 24
    • 0035517699 scopus 로고    scopus 로고
    • Protecting respondents' identities in microdata release
    • TKDE
    • P. Samarati, "Protecting respondents' identities in microdata release", TKDE, 2001.
    • (2001)
    • Samarati, P.1
  • 26
    • 33749571958 scopus 로고    scopus 로고
    • R. Wong, J. Li, A. Fu, K. Wang, (a, k)-Anonymity: An Enhanced k-Anonymity Model for Privacy-Preserving Data Publishing, SIGKDD, 2006.
    • R. Wong, J. Li, A. Fu, K. Wang, "(a, k)-Anonymity: An Enhanced k-Anonymity Model for Privacy-Preserving Data Publishing", SIGKDD, 2006.
  • 29
    • 33749582207 scopus 로고    scopus 로고
    • J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, A. Fu, Utility-Based Anonymization Using Local Recoding, SIGKDD, 2006.
    • J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, A. Fu, "Utility-Based Anonymization Using Local Recoding", SIGKDD, 2006.


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