Skip to main content
Top
Published in: Data Mining and Knowledge Discovery 2/2005

01-09-2005

Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*

Authors: Stephen E. Fienberg, Aleksandra B. Slavkovic

Published in: Data Mining and Knowledge Discovery | Issue 2/2005

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical data sets, where the releases come in the form of marginal tables corresponding to subsets of the categorical variables. Very recently some of the ideas have been extended to allow for the release of combinations of mixtures of marginal tables and conditional tables for subsets of variables. Association rules can be viewed as conditional tables. In this paper we consider possible inferences an intruder can make about confidential categorical data following the release of information on one or more association rules. We illustrate this with several examples.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD Conference International Conference on Management of Data, Washington, DC, pp. 207–216. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD Conference International Conference on Management of Data, Washington, DC, pp. 207–216.
go back to reference Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th VLDB Conference, Santiago, Chile, pp. 487–489. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th VLDB Conference, Santiago, Chile, pp. 487–489.
go back to reference Agrawal, R. and Srikant, R. 2000. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, pp. 439–450. Agrawal, R. and Srikant, R. 2000. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, pp. 439–450.
go back to reference Agresti, A. 2002.Categorical Data Analysis, 2nd edition. New York: Wiley.MATH Agresti, A. 2002.Categorical Data Analysis, 2nd edition. New York: Wiley.MATH
go back to reference Anderson, B. and Moore, A. 1998. AD-trees for fast counting and for fast learning of association rules. Knowledge Discovery from Databases Conference, KDD, pp. 134–138. Anderson, B. and Moore, A. 1998. AD-trees for fast counting and for fast learning of association rules. Knowledge Discovery from Databases Conference, KDD, pp. 134–138.
go back to reference Arnold, B.C., Castillo, E., and Sarabia, J.M. 1999.Conditional Specification of Statistical Models, Springer-Verlag. Arnold, B.C., Castillo, E., and Sarabia, J.M. 1999.Conditional Specification of Statistical Models, Springer-Verlag.
go back to reference Arnold, B.C. and Press, J.S. 1998. Compatible conditional distributions. Journal of the American Statistical Association, 84, 405:152–156.CrossRefMathSciNet Arnold, B.C. and Press, J.S. 1998. Compatible conditional distributions. Journal of the American Statistical Association, 84, 405:152–156.CrossRefMathSciNet
go back to reference Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., and Verykios, V. 1999. Disclosure limitation of sensitive rules. In Proceedings of the IEEE Knowledge and Data Engineering Exchange Workshop (KDEX'99), Chicago, IL, pp. 45–52. Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., and Verykios, V. 1999. Disclosure limitation of sensitive rules. In Proceedings of the IEEE Knowledge and Data Engineering Exchange Workshop (KDEX'99), Chicago, IL, pp. 45–52.
go back to reference Bishop, Y.M.M., Fienberg, S.E., and Holland, P.W. 1975. Discrete Multivariate Analysis: Theory and Practice. Cambridge, MA: MIT Press.MATH Bishop, Y.M.M., Fienberg, S.E., and Holland, P.W. 1975. Discrete Multivariate Analysis: Theory and Practice. Cambridge, MA: MIT Press.MATH
go back to reference Chang, L. and Moskowitz, I.S. 2001. An integrated framework for database privacy protection. Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security, Kluwer, B.V., pp. 161–172. Chang, L. and Moskowitz, I.S. 2001. An integrated framework for database privacy protection. Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security, Kluwer, B.V., pp. 161–172.
go back to reference Dalenius, T. and Reiss, S.P. 2004. Data-swapping: A technique for disclosure control. Journal of Statistical Planning and Inference, 6:73–85.CrossRefMathSciNet Dalenius, T. and Reiss, S.P. 2004. Data-swapping: A technique for disclosure control. Journal of Statistical Planning and Inference, 6:73–85.CrossRefMathSciNet
go back to reference De Loera, J., Haws, D., Hemmecke, R., Huggins, P., Tauzer, J., and Yoshida, R. 2003.A User's Guide for LattE v1.1. University of California, Davis. De Loera, J., Haws, D., Hemmecke, R., Huggins, P., Tauzer, J., and Yoshida, R. 2003.A User's Guide for LattE v1.1. University of California, Davis.
go back to reference Diaconis, P. and Sturmfels, B. 1998. Algebraic algorithms for sampling from conditional distributions. Annals of Statistics, 26:363–397.CrossRefMATHMathSciNet Diaconis, P. and Sturmfels, B. 1998. Algebraic algorithms for sampling from conditional distributions. Annals of Statistics, 26:363–397.CrossRefMATHMathSciNet
go back to reference Dobra, A. and Fienberg, S.E. 2000. Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. Proceedings of the National Academy of Sciences, 97:11885–11892.CrossRefMATHMathSciNet Dobra, A. and Fienberg, S.E. 2000. Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. Proceedings of the National Academy of Sciences, 97:11885–11892.CrossRefMATHMathSciNet
go back to reference Dobra, A. and Fienberg, S.E. 2001. Bounds for cell entries in contingency tables induced by fixed marginal totals. Statistical Journal of the United Nations ECE, 18:363–371. Dobra, A. and Fienberg, S.E. 2001. Bounds for cell entries in contingency tables induced by fixed marginal totals. Statistical Journal of the United Nations ECE, 18:363–371.
go back to reference Dobra, A. and Fienberg, S.E. 2003. Bounding entries in multi-way contingency tables given a set of marginal totals. In Foundations of Statistical Inference: Proceedings of the Shoresh Conference 2000, Y. Haitovsky, H.R. Lerche and Y. Ritov, (eds.), Berlin: Springer-Verlag, pp. 3–16. Dobra, A. and Fienberg, S.E. 2003. Bounding entries in multi-way contingency tables given a set of marginal totals. In Foundations of Statistical Inference: Proceedings of the Shoresh Conference 2000, Y. Haitovsky, H.R. Lerche and Y. Ritov, (eds.), Berlin: Springer-Verlag, pp. 3–16.
go back to reference Domingo-Ferrer, J. and Torra, V. (eds.), 2004. Privacy in Statistical Databases– PSD'2004, Lecture Notes in Computer Science No. 3050, New York: Springer-Verlag. Domingo-Ferrer, J. and Torra, V. (eds.), 2004. Privacy in Statistical Databases– PSD'2004, Lecture Notes in Computer Science No. 3050, New York: Springer-Verlag.
go back to reference DuMouchel, W. and Pregibon, D. 2001. Empirical bayes screening for multi-item associations. In Proceedings of the ACM SIGKDD Intentional Conference on Knowledge Discovery in Databases & Data Mining (KDD01), ACM Press, pp. 67–76. DuMouchel, W. and Pregibon, D. 2001. Empirical bayes screening for multi-item associations. In Proceedings of the ACM SIGKDD Intentional Conference on Knowledge Discovery in Databases & Data Mining (KDD01), ACM Press, pp. 67–76.
go back to reference Duncan, G.T., Fienberg, S.E., Krishnan, R., Padman, R., and Roehrig, S.F. 2001. Disclosure Limitation Methods and Information Loss for Tabular Data. In Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, P. Doyle, J. Lane, J. Theeuwes, and L. Zayatz (eds.), Amsterdam: Elsevier, pp. 135–166. Duncan, G.T., Fienberg, S.E., Krishnan, R., Padman, R., and Roehrig, S.F. 2001. Disclosure Limitation Methods and Information Loss for Tabular Data. In Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, P. Doyle, J. Lane, J. Theeuwes, and L. Zayatz (eds.), Amsterdam: Elsevier, pp. 135–166.
go back to reference Duncan, G.T. and Stokes, S.L. 2004. Disclosure risk vs. data utility: The R-U confidentiality map as applied to topcoding. Chance, 17(3):16–20.MathSciNet Duncan, G.T. and Stokes, S.L. 2004. Disclosure risk vs. data utility: The R-U confidentiality map as applied to topcoding. Chance, 17(3):16–20.MathSciNet
go back to reference Edwards, D.E. and Havranek, T. 1985. A fast procedure for model search in multidimensional contingency tables. Biometrika, 72:339–351.MathSciNetMATHCrossRef Edwards, D.E. and Havranek, T. 1985. A fast procedure for model search in multidimensional contingency tables. Biometrika, 72:339–351.MathSciNetMATHCrossRef
go back to reference Estivill-Castro, V. and Brankovic, Lj. 1999. Data Warehousing and knowledge discovery. In First International Conference, DaWaK '99, M.K. Mohania, and A. Min Tjoa, (eds.), Lecture Notes in Computer Science No. 1676, New York: Springer-Verlag, pp. 389-398. Estivill-Castro, V. and Brankovic, Lj. 1999. Data Warehousing and knowledge discovery. In First International Conference, DaWaK '99, M.K. Mohania, and A. Min Tjoa, (eds.), Lecture Notes in Computer Science No. 1676, New York: Springer-Verlag, pp. 389-398.
go back to reference Evfimievski, A., Srikant, R., Agrawal, R., and Gehrke, J. 2000. Privacy preserving mining of association rules. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery in Databases and Data Mining, Edmonton, Canada, pp. 217-228. Evfimievski, A., Srikant, R., Agrawal, R., and Gehrke, J. 2000. Privacy preserving mining of association rules. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery in Databases and Data Mining, Edmonton, Canada, pp. 217-228.
go back to reference Fienberg, S.E. 1980. The Analysis of Cross-Classified Categorical Data, 2nd edition. Cambridge, MA: MIT Press.MATH Fienberg, S.E. 1980. The Analysis of Cross-Classified Categorical Data, 2nd edition. Cambridge, MA: MIT Press.MATH
go back to reference Fienberg, S.E. 2004. Datamining and disclosure limitation for categorical statistical databases. Proceedings of Workshop on Privacy and Security Aspects of Data Mining, Fourth IEEE International Conference on Data Mining (ICDM 2004), Brighton, UK, pp. 1–12. Fienberg, S.E. 2004. Datamining and disclosure limitation for categorical statistical databases. Proceedings of Workshop on Privacy and Security Aspects of Data Mining, Fourth IEEE International Conference on Data Mining (ICDM 2004), Brighton, UK, pp. 1–12.
go back to reference Fienberg, S.E., Makov, U.E., Meyer, M.M., and Steele, R.J. 2001. Computing the exact distribution for a multi-way contingency table conditional on its marginals totals. In Data Analysis from Statistical Foundations: Papers in Honor of D. A. S. Fraser and A.K.M.E. Saleh (eds.), Huntington, NY: Nova Science Publishing, pp. 145–165. Fienberg, S.E., Makov, U.E., Meyer, M.M., and Steele, R.J. 2001. Computing the exact distribution for a multi-way contingency table conditional on its marginals totals. In Data Analysis from Statistical Foundations: Papers in Honor of D. A. S. Fraser and A.K.M.E. Saleh (eds.), Huntington, NY: Nova Science Publishing, pp. 145–165.
go back to reference Fienberg, S.E., Makov, U.E., and Steele, R.J. 1998. Disclosure limitation using perturbation and related methods for categorical data (with discussion). Journal of Official Statistics, 14:485–502. Fienberg, S.E., Makov, U.E., and Steele, R.J. 1998. Disclosure limitation using perturbation and related methods for categorical data (with discussion). Journal of Official Statistics, 14:485–502.
go back to reference Fienberg, S.E. and McIntyre, J. 2004. Data swapping: Variations on a theme by Dalenius and Reiss. In Privacy in Statistical Databases—PSD'2004, J. Domingo-Ferrer, and V. Torra (eds.), Lecture Notes in Computer Science No. 3050, New York: Springer-Verlag, pp. 14–29. Fienberg, S.E. and McIntyre, J. 2004. Data swapping: Variations on a theme by Dalenius and Reiss. In Privacy in Statistical Databases—PSD'2004, J. Domingo-Ferrer, and V. Torra (eds.), Lecture Notes in Computer Science No. 3050, New York: Springer-Verlag, pp. 14–29.
go back to reference Fienberg, S.E. and Slavkovic, A.B. 2004. Making the release of confidential data from multi-way tables count. Chance, 17(3):5–10.MathSciNet Fienberg, S.E. and Slavkovic, A.B. 2004. Making the release of confidential data from multi-way tables count. Chance, 17(3):5–10.MathSciNet
go back to reference Gelman, A. and Speed, T.S. 1993. Characterizing a joint probability distribution by conditionals. Journal of the Royal Statistical Society. Series B, 55(1):185–188.MATHMathSciNet Gelman, A. and Speed, T.S. 1993. Characterizing a joint probability distribution by conditionals. Journal of the Royal Statistical Society. Series B, 55(1):185–188.MATHMathSciNet
go back to reference Gelman, A. and Speed, T.S. 1999. Corrigendum: Characterizing a joint probability distribution by conditionals.Journal of the Royal Statistical Society. Series B, 61(2):483.CrossRefMathSciNet Gelman, A. and Speed, T.S. 1999. Corrigendum: Characterizing a joint probability distribution by conditionals.Journal of the Royal Statistical Society. Series B, 61(2):483.CrossRefMathSciNet
go back to reference Gouweleeuw, J.M., Kooiman, P., Willenborg, L.C.R.J., and de Wolf, P.P., 1998. Post randomization for statistical disclosure control: Theory and implementation. Journal of Official Statistics, 14:463–478. Gouweleeuw, J.M., Kooiman, P., Willenborg, L.C.R.J., and de Wolf, P.P., 1998. Post randomization for statistical disclosure control: Theory and implementation. Journal of Official Statistics, 14:463–478.
go back to reference Hemmecke, R. and Hemmecke, R. 2003. 4ti2 Version 1.1—Computation of Hilbert bases, Graver bases, toric Gröbner bases, and more. Available at www.4ti2.de. Hemmecke, R. and Hemmecke, R. 2003. 4ti2 Version 1.1—Computation of Hilbert bases, Graver bases, toric Gröbner bases, and more. Available at www.​4ti2.​de.
go back to reference Jordan, M.I. (eds.), 1998. Learning in Graphical Models. Cambridge, MA: MIT Press. Jordan, M.I. (eds.), 1998. Learning in Graphical Models. Cambridge, MA: MIT Press.
go back to reference Kantarcioglu, M. and Clifton, C. 2004. Privacy preserving data mining of association rules on horizontally partitioned data. Transactions on Knowledge and Data Engineering, 1026–1037. Kantarcioglu, M. and Clifton, C. 2004. Privacy preserving data mining of association rules on horizontally partitioned data. Transactions on Knowledge and Data Engineering, 1026–1037.
go back to reference Kantarcioglu, M., Jin, J., and Clifton, C. 2004. When do data mining results violate privacy? In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, August 22–25, ACM Press, pp. 599–604. Kantarcioglu, M., Jin, J., and Clifton, C. 2004. When do data mining results violate privacy? In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, August 22–25, ACM Press, pp. 599–604.
go back to reference Kargupta, H., Datta, S., Wang, Q., and Sivakumar, K. 2003. Random data perturbation techniques and privacy preserving data mining. In Proceedings of 3rd IEEE International Conference on Data Mining, ICDM 2003, Melbourne, Florida, pp. 99–106. Kargupta, H., Datta, S., Wang, Q., and Sivakumar, K. 2003. Random data perturbation techniques and privacy preserving data mining. In Proceedings of 3rd IEEE International Conference on Data Mining, ICDM 2003, Melbourne, Florida, pp. 99–106.
go back to reference Komarek, P. and Moore, A. 2000. A Dynamic Adaptation of AD-trees for efficient machine learning on large data sets. In Proceedings of the 17th International Conference on Machine Learning, pp. 495–502. Komarek, P. and Moore, A. 2000. A Dynamic Adaptation of AD-trees for efficient machine learning on large data sets. In Proceedings of the 17th International Conference on Machine Learning, pp. 495–502.
go back to reference Koch, G., Amara, J., Atkinson, S. and Stanish, W. 1983. Overview of categorical analysis methods. SAS-SUGI, 8:785–795. Koch, G., Amara, J., Atkinson, S. and Stanish, W. 1983. Overview of categorical analysis methods. SAS-SUGI, 8:785–795.
go back to reference Lauritzen, S.L.Graphical Models. Oxford: Oxford University Press. Lauritzen, S.L.Graphical Models. Oxford: Oxford University Press.
go back to reference Moore, A. and Schneider, J. 2002. Real-valued all-dimensions search: Low-overhead rapid searching over subsets of attributes. Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, San Francisco: Morgan Kaufmann Publishers, pp. 360–369. Moore, A. and Schneider, J. 2002. Real-valued all-dimensions search: Low-overhead rapid searching over subsets of attributes. Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, San Francisco: Morgan Kaufmann Publishers, pp. 360–369.
go back to reference Oliveira, S.R.M. and Zaïane, O.R. 2003. Algorithms for balancing privacy and knowledge discovery in association rule mining. In Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), Hong Kong, China, pp. 54–63. Oliveira, S.R.M. and Zaïane, O.R. 2003. Algorithms for balancing privacy and knowledge discovery in association rule mining. In Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS 2003), Hong Kong, China, pp. 54–63.
go back to reference Pavlov, D., Mannila, H., and Smyth, P. 2003. Beyond independence: In Probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering, 15:1409–1421.CrossRef Pavlov, D., Mannila, H., and Smyth, P. 2003. Beyond independence: In Probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering, 15:1409–1421.CrossRef
go back to reference Pelleg, D. and Moore, A. 2003. Using Tarjan's red rule for fast dependency tree construction. Advances in Neural Information Processing Systems 15 (NIPS 2002), Cambridge, MA: MIT Press, pp. 801–808. Pelleg, D. and Moore, A. 2003. Using Tarjan's red rule for fast dependency tree construction. Advances in Neural Information Processing Systems 15 (NIPS 2002), Cambridge, MA: MIT Press, pp. 801–808.
go back to reference Pistone, J., Riccomagno, E., and Wynn, H. 2001. Algebraic Statistics—Computational Commutative Algebra in Statistics. Boca Raton, FL:Chapman and Hall/CRC.MATH Pistone, J., Riccomagno, E., and Wynn, H. 2001. Algebraic Statistics—Computational Commutative Algebra in Statistics. Boca Raton, FL:Chapman and Hall/CRC.MATH
go back to reference Pontikakis, E.D., Verykios, V.S., and Theodoridis, Y. 2004. On the comparison of association rule hiding techniques. Hellenic Database Management Symposium, Athens, Greece. Pontikakis, E.D., Verykios, V.S., and Theodoridis, Y. 2004. On the comparison of association rule hiding techniques. Hellenic Database Management Symposium, Athens, Greece.
go back to reference Pontikakis, E.D., Tsitsonis, A.A., and Verykios, V.S. 2004. A quantitative experimental study of distortion-based techniques in association rule hiding. Conference in Database Security, Sitges, Spain, pp. 325–339. Pontikakis, E.D., Tsitsonis, A.A., and Verykios, V.S. 2004. A quantitative experimental study of distortion-based techniques in association rule hiding. Conference in Database Security, Sitges, Spain, pp. 325–339.
go back to reference Pontikakis, E.D., Tsitsonis, A.A., Verykios, V.S., Theodoridis, Y., and Chang, L. 2004. A quantitative and qualitative analysis of blocking in association rules hiding. ACM Workshop on Privacy in Electronic Society, Washington, DC, 29–30. Pontikakis, E.D., Tsitsonis, A.A., Verykios, V.S., Theodoridis, Y., and Chang, L. 2004. A quantitative and qualitative analysis of blocking in association rules hiding. ACM Workshop on Privacy in Electronic Society, Washington, DC, 29–30.
go back to reference Rizvi, S. and Haritsa, J. 2002. Maintaining data privacy in association rule mining. Proceedings of the 28th Conference on Very Large Data Base (VLDB'02), pp. 682–693. Rizvi, S. and Haritsa, J. 2002. Maintaining data privacy in association rule mining. Proceedings of the 28th Conference on Very Large Data Base (VLDB'02), pp. 682–693.
go back to reference Silverstein, C., Brin, S., and Motwani, R. 1998. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2:39–68.CrossRef Silverstein, C., Brin, S., and Motwani, R. 1998. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2:39–68.CrossRef
go back to reference Silverstein, C., Brin, S., Motwani, R., and Ullman, J. 2000. Scalable techniques for mining causal structures. Data Mining and Knowledge Discovery, 4:163–192.CrossRef Silverstein, C., Brin, S., Motwani, R., and Ullman, J. 2000. Scalable techniques for mining causal structures. Data Mining and Knowledge Discovery, 4:163–192.CrossRef
go back to reference Slavkovic, A.B. 2004. Statistical Disclosure Limitation Beyond the Margins. Ph.D. Thesis, Department of Statistics, Carnegie Mellon University. Slavkovic, A.B. 2004. Statistical Disclosure Limitation Beyond the Margins. Ph.D. Thesis, Department of Statistics, Carnegie Mellon University.
go back to reference Slavkovic, A.B. and Fienberg, S.E. 2004. Bounds for cell entries in two-way tables given conditional relative frequencies. In Privacy in Statistical Databases– PSD'2004, J. Domingo-Ferrer, and V. Torra, (eds.), Lecture Notes in Computer Science No. 3050. New York: Springer-Verlag: pp. 30–43. Slavkovic, A.B. and Fienberg, S.E. 2004. Bounds for cell entries in two-way tables given conditional relative frequencies. In Privacy in Statistical Databases– PSD'2004, J. Domingo-Ferrer, and V. Torra, (eds.), Lecture Notes in Computer Science No. 3050. New York: Springer-Verlag: pp. 30–43.
go back to reference Srikant, R. and Agrawal, R. 1995. Mining generalized association rules. In Proceedings of the 21st International Conference on Very Large Databases, Zurich, Switzerland, pp. 407–419. Srikant, R. and Agrawal, R. 1995. Mining generalized association rules. In Proceedings of the 21st International Conference on Very Large Databases, Zurich, Switzerland, pp. 407–419.
go back to reference Sturmfels, B. 2003. Algebra and Geometery of Statistical Models. John von Neumann Lectures at Munich University. Sturmfels, B. 2003. Algebra and Geometery of Statistical Models. John von Neumann Lectures at Munich University.
go back to reference Trottini, M. 2003. Decision Models for Data Disclosure Limitation. Ph.D. Thesis, Department of Statistics, Carnegie Mellon University. Trottini, M. 2003. Decision Models for Data Disclosure Limitation. Ph.D. Thesis, Department of Statistics, Carnegie Mellon University.
go back to reference Trottini, M. and Fienberg, S.E. 2002. Modelling user uncertainty for disclosure risk and data utility. International Journal of Uncertainty, Fuzziness and Knowledge Based Systems, 10:511–528.MATHCrossRef Trottini, M. and Fienberg, S.E. 2002. Modelling user uncertainty for disclosure risk and data utility. International Journal of Uncertainty, Fuzziness and Knowledge Based Systems, 10:511–528.MATHCrossRef
go back to reference Vaidya, J. and Clifton, C. 2002. Privacy preserving association rule mining in vertically partitioned data. The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada. Vaidya, J. and Clifton, C. 2002. Privacy preserving association rule mining in vertically partitioned data. The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada.
go back to reference Willenborg, L.C.R.J. and de Waal, T. 2000. Elements of Statistical Disclosure Control. Lecture Notes in Statistics, Vol. 155, New York: Springer-Verlag. Willenborg, L.C.R.J. and de Waal, T. 2000. Elements of Statistical Disclosure Control. Lecture Notes in Statistics, Vol. 155, New York: Springer-Verlag.
go back to reference Witten, I.H. and Frank, E. 2000. Data Mining: Practical Machine Learning Tools and Techniques. New York: Morgan Kaufmann. Witten, I.H. and Frank, E. 2000. Data Mining: Practical Machine Learning Tools and Techniques. New York: Morgan Kaufmann.
go back to reference Wu, X., Barbar, D., and Ye, Y. 2003. Screening and interpreting multi-item associations based on log-linear modeling, In Proceedings of the ACM SIGKDD Intentional Conference on Knowledge Discovery in Databases & Data Mining (KDD03), ACM Press, pp. 276–285. Wu, X., Barbar, D., and Ye, Y. 2003. Screening and interpreting multi-item associations based on log-linear modeling, In Proceedings of the ACM SIGKDD Intentional Conference on Knowledge Discovery in Databases & Data Mining (KDD03), ACM Press, pp. 276–285.
Metadata
Title
Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*
Authors
Stephen E. Fienberg
Aleksandra B. Slavkovic
Publication date
01-09-2005
Publisher
Springer US
Published in
Data Mining and Knowledge Discovery / Issue 2/2005
Print ISSN: 1384-5810
Electronic ISSN: 1573-756X
DOI
https://doi.org/10.1007/s10618-005-0010-x

Other articles of this Issue 2/2005

Data Mining and Knowledge Discovery 2/2005 Go to the issue

Premium Partner