메뉴 건너뛰기




Volumn 16, Issue 3, 2005, Pages 256-270

Maximizing accuracy of shared databases when concealing sensitive patterns

Author keywords

Data quality; Item set mining; Privacy

Indexed keywords

DATA PRIVACY; DATABASE SYSTEMS;

EID: 25844456648     PISSN: 10477047     EISSN: 15265536     Source Type: Journal    
DOI: 10.1287/isre.1050.0056     Document Type: Review
Times cited : (96)

References (27)
  • 1
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • Morgan Kaufmann Publishers, San Francisco, CA
    • Agrawal, R., R. Srikant. 1994. Fast algorithms for mining association rules. Proc. 20th Internat. Conf. Very Large Databases. Morgan Kaufmann Publishers, San Francisco, CA, 487-499.
    • (1994) Proc. 20th Internat. Conf. Very Large Databases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 6
    • 0033349024 scopus 로고    scopus 로고
    • Disclosure detection in multivariate categorical databases: Auditing confidentiality protection through two new matrix operators
    • Choudhury, S., G. Duncan, R. Krishnan, S. Roehrig, S. Mukherjee. 1999. Disclosure detection in multivariate categorical databases: Auditing confidentiality protection through two new matrix operators. Management Sci. 45(12) 1710-1723.
    • (1999) Management Sci. , vol.45 , Issue.12 , pp. 1710-1723
    • Choudhury, S.1    Duncan, G.2    Krishnan, R.3    Roehrig, S.4    Mukherjee, S.5
  • 7
    • 0003504808 scopus 로고    scopus 로고
    • Security and privacy implications of data mining
    • Dept. of Computer Science, University of British Columbia, Montreal, Canada
    • Clifton, C., D. Marks. 1996. Security and privacy implications of data mining. Proc. ACM-SIGMOD Workshop Data Mining Knowledge Discovery. Dept. of Computer Science, University of British Columbia, Montreal, Canada, 15-19.
    • (1996) Proc. ACM-SIGMOD Workshop Data Mining Knowledge Discovery , pp. 15-19
    • Clifton, C.1    Marks, D.2
  • 9
    • 1642302606 scopus 로고    scopus 로고
    • Building decision tree classifier on private data
    • Australian Computer Society, Darlinghurst, Australia
    • Du, W., Z. Zhan. 2002. Building decision tree classifier on private data. Proc. IEEE ICDM Workshop Privacy, Security Data Mining. Australian Computer Society, Darlinghurst, Australia, 1-8.
    • (2002) Proc. IEEE ICDM Workshop Privacy, Security Data Mining , pp. 1-8
    • Du, W.1    Zhan, Z.2
  • 12
    • 0036602405 scopus 로고    scopus 로고
    • Privacy protection of binary confidential data against deterministic, stochastic, and insider threat
    • Garfinkel, R., R. Gopal, P. Goes. 2002. Privacy protection of binary confidential data against deterministic, stochastic, and insider threat. Management Sci. 48(6) 749-764.
    • (2002) Management Sci. , vol.48 , Issue.6 , pp. 749-764
    • Garfinkel, R.1    Gopal, R.2    Goes, P.3
  • 13
    • 33644516394 scopus 로고    scopus 로고
    • Profiling high frequency accident locations using association rules
    • Transportation Research Board, Washington, D.C., 18
    • Geurts, K., G. Wets, T. Brijs, K. Vanhoof. 2003. Profiling high frequency accident locations using association rules. Proc. 82nd Annual Meeting Transportation Res. Board. Transportation Research Board, Washington, D.C., 18.
    • (2003) Proc. 82nd Annual Meeting Transportation Res. Board
    • Geurts, K.1    Wets, G.2    Brijs, T.3    Vanhoof, K.4
  • 16
    • 0036563104 scopus 로고    scopus 로고
    • Confidentiality via camouflage: The CVC approach to disclosure limitation when answering queries to databases
    • Gopal, R., R. Garfinkel, P. Goes. 2002. Confidentiality via camouflage: The CVC approach to disclosure limitation when answering queries to databases. Oper. Res. 50(3) 501-516.
    • (2002) Oper. Res. , vol.50 , Issue.3 , pp. 501-516
    • Gopal, R.1    Garfinkel, R.2    Goes, P.3
  • 17
    • 11844277921 scopus 로고    scopus 로고
    • ILOG Inc., Gentilly, France
    • ILOG. 2003. ILOG CPLEX 9.0 User's Manual. ILOG Inc., Gentilly, France.
    • (2003) ILOG CPLEX 9.0 User's Manual
  • 18
    • 11844280758 scopus 로고    scopus 로고
    • Privacy preserving frequent item-set mining
    • Australian Computer Society, Darlinghurst, Australia
    • Oliveira, S., O. Zaïanc. 2002. Privacy preserving frequent item-set mining. Proc. IEEE ICDM Workshop Privacy, Security Data Mining. Australian Computer Society, Darlinghurst, Australia, 43-54.
    • (2002) Proc. IEEE ICDM Workshop Privacy, Security Data Mining , pp. 43-54
    • Oliveira, S.1    Zaïanc, O.2
  • 19
    • 33746056957 scopus 로고    scopus 로고
    • Protecting sensitive knowledge by data sanitization
    • IEEE Computer Society, Washington, D.C.
    • Oliveira, S., O. Zaïane. 2003. Protecting sensitive knowledge by data sanitization. Proc. 3rd IEEE Internat. Conf. Data Mining (ICDM'03). IEEE Computer Society, Washington, D.C., 99-106.
    • (2003) Proc. 3rd IEEE Internat. Conf. Data Mining (ICDM'03) , pp. 99-106
    • Oliveira, S.1    Zaïane, O.2
  • 20
    • 0040277187 scopus 로고
    • Knowledge discovery in personal data vs. privacy: A minisymposium
    • Piatetsky-Shapiro, G. 1995. Knowledge discovery in personal data vs. privacy: A minisymposium. IEEE Expert 10(2) 46-47.
    • (1995) IEEE Expert , vol.10 , Issue.2 , pp. 46-47
    • Piatetsky-Shapiro, G.1
  • 22
    • 0036909696 scopus 로고    scopus 로고
    • The security of confidential numerical data in databases
    • Sarathy, R., K. Muralidhar. 2002. The security of confidential numerical data in databases. Inform. Systems Res. 13(4) 389-403.
    • (2002) Inform. Systems Res. , vol.13 , Issue.4 , pp. 389-403
    • Sarathy, R.1    Muralidhar, K.2
  • 23
    • 0036971583 scopus 로고    scopus 로고
    • Perturbing nonnormal confidential attributes: The copula approach
    • Sarathy, R., K. Muralidhar, R. Parsa. 2002. Perturbing nonnormal confidential attributes: The copula approach. Management Sci. 48(12) 1613-1627.
    • (2002) Management Sci. , vol.48 , Issue.12 , pp. 1613-1627
    • Sarathy, R.1    Muralidhar, K.2    Parsa, R.3
  • 24
    • 0344990562 scopus 로고    scopus 로고
    • Using unknowns to prevent discovery of association rules
    • Saygin, Y., V. Verykios, C. Clifton. 2001. Using unknowns to prevent discovery of association rules. SIGMOD Rec. 30(4).
    • (2001) SIGMOD Rec. , vol.30 , Issue.4
    • Saygin, Y.1    Verykios, V.2    Clifton, C.3


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