Skip to main content

A Heuristic Data Reduction Approach for Associative Classification Rule Hiding

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 5351)

Abstract

When data are to be shared between business partners, there could be some sensitive patterns which should not be disclosed to the other parties. On the other hand, the “quality” of the data must also be preserved. This creates an interesting question: how can we maintain the shared data that are guaranteed to have the quality, and the certain types of sensitive patterns be removed or “hidden”? In this paper, we address such the problem of sensitive classification rule hiding by using data reduction approach, i.e. removing the whole selected tuples in the given dataset. We focus on a specific type of classification rules, i.e. associative classification rules. In our context, a sensitive rule is hidden when its support falls below a minimal support threshold. Meanwhile, the impact on the data quality of the dataset is represented in term of a number of false-dropped rules, and a number of ghost rules. We present a few observations on the data quality with regard to the data reduction processes. From the observations, we can represent the impact by each reduction precisely without any re-applying the classification algorithm. Subsequently, we propose a heuristic algorithm to hide the sensitive rules based on the observations. Experimental results are presented to show the effectiveness and the efficiency of the proposed algorithm.

Keywords

  • Heuristic Algorithm
  • Class Label
  • Minimal Support
  • Sensitive Pattern
  • Minimal Support Threshold

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-89197-0_16
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   169.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-89197-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   219.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sweeney, L.: k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10, 557–570 (2002)

    MathSciNet  CrossRef  MATH  Google Scholar 

  2. Fule, P., Roddick, J.F.: Detecting privacy and ethical sensitivity in data mining results. In: ACSC 2004: Proceedings of the 27th Australasian Conference on Computer Science, pp. 159–166. Australian Computer Society, Inc. (2004)

    Google Scholar 

  3. Oliveira, S.R.M., Zaïane, O.R.: Privacy preserving frequent itemset mining. In: Proceedings of the IEEE international conference on Privacy, security and data mining, pp. 43–54. Australian Computer Society, Inc. (2002)

    Google Scholar 

  4. Verykios, V.S., Elmagarmid, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association rule hiding. IEEE Transactions on Data and Knowledge Engineering 16, 434–447 (2004)

    CrossRef  Google Scholar 

  5. HajYasien, A., Estivill-Castro, V.: Two new techniques for hiding sensitive itemsets and their empirical evaluation. In: Proceedings of 8th International Conference on Data Warehousing and Knowledge Discovery, pp. 302–311. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  6. Moustakides, G.V., Verykios, V.S.: A max-min approach for hiding frequent itemsets. In: Workshops Proceedings of the 6th IEEE ICDM nternational Conference on Data Mining, pp. 502–506. IEEE Computer Society Press, Los Alamitos (2006)

    CrossRef  Google Scholar 

  7. Li, W., Han, J., Pei, J.: Cmar: Accurate and efficient classification based on multiple class-association rules. In: Proceedings of the 2001 IEEE ICDM International Conference on Data Mining, Washington, DC, USA, pp. 369–376. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  8. Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E., Verykios, V.: Disclosure limitation of sensitive rules. In: KDEX 1999: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange, Washington, DC, USA, pp. 45–52. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  9. Wu, Y.H., Chiang, C.M., Chen, A.L.P.: Hiding sensitive association rules with limited side effects. IEEE Transactions on Knowledge and Data Engineering 19, 29–42 (2007)

    CrossRef  Google Scholar 

  10. Natwichai, J., Orlowska, M.E., Sun, X.: Hiding sensitive associative classification rule by data reduction. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 310–322. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Natwichai, J., Sun, X., Li, X. (2008). A Heuristic Data Reduction Approach for Associative Classification Rule Hiding. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89197-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89196-3

  • Online ISBN: 978-3-540-89197-0

  • eBook Packages: Computer ScienceComputer Science (R0)