Skip to main content
SpringerLink
Log in

Efficient algorithms for distortion and blocking techniques in association rule hiding

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, efficiency is not our only concern in this study. The security and privacy issues over the extracted knowledge must be seriously considered as well. By taking this into consideration, we study the procedure of hiding sensitive association rules in binary data sets by blocking some data values and we present an algorithm for solving this problem. We also provide a fuzzification of the support and the confidence of an association rule in order to accommodate for the existence of blocked/unknown values. In addition, we quantitatively compare the proposed algorithm with other already published algorithms by running experiments on binary data sets, and we also qualitatively compare the efficiency of the proposed algorithm in hiding association rules. We utilize the notion of border rules, by putting weights in each rule, and we use effective data structures for the representation of the rules so as (a) to minimize the side effects created by the hiding process and (b) to speed up the selection of the victim transactions. Finally, we study the overall security of the modified database, using the C4.5 decision tree algorithm of the WEKA data mining tool, and we discuss the advantages and the limitations of blocking.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Saygin, Y., Verykios, V.S., Clifton, C.: Using unknowns to prevent discovery of association rules. SIGMOD Record 30(4), 45–54 (2001)

    Google Scholar 

  2. Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proceedings of SIGKDD Conference, pp. 217–228 (2002)

  3. Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: Proceedings of the 4th Information Hiding Workshop, pp. 369–383 (2001)

  4. Atallah, M.J., Bertino, E., Elmagarmid, A.K., Ibrahim, M., Verykios, V.S.: Disclosure limitation of sensitive rules. In: Proceedings of the IEEE Knowledge and Data Engineering Workshop, pp. 45–52 (1999)

  5. Oliveira, S.R.M., Zaiane, O.R.: Privacy preserving frequent itemset mining. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining, pp. 43–54 (2002)

  6. Verykios, V.S., Elmagarmid, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association rule hiding. IEEE Trans. Knowl. Data Eng. 16(4), 434–447 (2004)

    Article  Google Scholar 

  7. Saygin, Y., Verykios, V.S., Elmagarmid, A.K.: Privacy preserving association rule mining. In: Proceedings of the 12th International Workshop on Research Issues in Data Engineering, pp. 151–158 (2002)

  8. Chang, L., Moskowitz, I.S.: Parsimonious Downgrading and decision trees applied to the inference problem. In: Proceedings of the 1998 New Security Paradigms Workshop, pp. 82–89 (1998)

  9. Moskowitz, I.S., Chang, L.: A Computational Intelligence Approach to the Database Inference Problem. IOS, Amsterdam (2000)

    Google Scholar 

  10. Moskowitz, I.S., Chang, L.: The rational downgrader. In: Proceedings PADD Conference, pp. 159–165 (1999)

  11. Johnsten, T., Raghavan, V., Hill, K.: The security assessment of association mining algorithms. In: Proceedings of the 16th Annual IFIP WG 11.3 Working Conference on Database Applications Security, pp. 163–174 (2002)

  12. Manilla, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations, Extended Abstract. In: Proceedings of KDD Conference, pp. 189–194 (1996)

  13. Pontikakis, E., Tsitsonis, A., Verykios, V.: An experimental study of distortion-based techniques in association rule hiding. In: Proceedings of IFIP DBSec Conference, pp. 325–339 (2004)

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Communication Engineering, University of Thessaly, Volos, Greece

    Vassilios S. Verykios

  2. Department of Computer Science, Stanford University, Stanford, CA, USA

    Emmanuel D. Pontikakis

  3. Department of Informatics, University of Piraeus, Piraeus, Greece

    Yannis Theodoridis

  4. Naval Research Laboratory, Washington, DC, USA

    Liwu Chang

Authors
  1. Vassilios S. Verykios
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuel D. Pontikakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liwu Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vassilios S. Verykios.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Verykios, V.S., Pontikakis, E.D., Theodoridis, Y. et al. Efficient algorithms for distortion and blocking techniques in association rule hiding. Distrib Parallel Databases 22, 85–104 (2007). https://doi.org/10.1007/s10619-007-7013-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-007-7013-0

Keywords

Search

Navigation