Skip to main content

Classification with Meta-learning in Privacy Preserving Data Mining

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5667))

Included in the following conference series:

Abstract

In privacy preserving classification, when data is stored in a centralized database and distorted using a randomization-based technique, we have information loss and reduced accuracy of classification. Moreover, there are several possible algorithms, different reconstruction types (in case of decision tree) to use and we cannot point out the best combination of them. Meta-learning is the solution to combine information from all algorithms. Furthermore, it gives higher accuracy of classification. This paper presents the new meta-learning approach to privacy preserving classification for centralized data. Effectiveness of this solution has been tested on real data sets and presented in this paper.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. of the ACM SIGMOD Conference on Management of Data, May 2000, pp. 439–450. ACM Press, New York (2000)

    Google Scholar 

  2. Andruszkiewicz, P.: Privacy preserving classification for continuous and nominal attributes. In: Proceedings of the 16th International Conference on Intelligent Information Systems (2008)

    Google Scholar 

  3. Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 36–54. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: PODS 2001: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 247–255 (2001)

    Google Scholar 

  5. Wenliang Du, Z.Z.: Using randomized response techniques for privacy-preserving data mining. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) KDD, pp. 505–510. ACM, New York (2003)

    Google Scholar 

  6. Yang, Z., Zhong, S., Wright, R.N.: Privacy-preserving classification of customer data without loss of accuracy. In: SDM (2005)

    Google Scholar 

  7. Zhang, N., Wang, S., Zhao, W.: A new scheme on privacy-preserving data classification. In: Grossman, R., Bayardo, R., Bennett, K.P. (eds.) KDD, pp. 374–383. ACM, New York (2005)

    Google Scholar 

  8. Xiong, L., Chitti, S., Liu, L.: Mining multiple private databases using a knn classifier. In: SAC 2007: Proceedings of the 2007 ACM symposium on Applied computing, pp. 435–440 (2007)

    Google Scholar 

  9. Andruszkiewicz, P.: Probability distribution reconstruction for nominal attributes in privacy preserving classification. In: Proceedings of the International Conference on Convergence and Hybrid Information Technology (2008)

    Google Scholar 

  10. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123–140 (1996)

    MATH  Google Scholar 

  11. Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning (ICML), pp. 148–156 (1996)

    Google Scholar 

  12. Chan, P.K., Stolfo, S.J.: Experiments on multi-strategy learning by meta-learning. In: Bhargava, B.K., Finin, T.W., Yesha, Y. (eds.) CIKM, pp. 314–323. ACM, New York (1993)

    Google Scholar 

  13. Chan, P.K., Stolfo, S.J.: On the accuracy of meta-learning for scalable data mining. J. Intell. Inf. Syst. 8(1), 5–28 (1997)

    Article  Google Scholar 

  14. Chan, P.K.W.: An extensible meta-learning approach for scalable and accurate inductive learning. PhD thesis, New York, NY, USA, Sponsor-Salvatore J. Stolfo. (1996)

    Google Scholar 

  15. Dietterich, T.G.: Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation (10), 1895–1924 (1998)

    Article  Google Scholar 

  16. Shafer, J.C., Rakesh Agrawal, M.M.: Sprint: A scalable parallel classifier for data mining. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) VLDB 1996, Proceedings of 22th International Conference on Very Large Data Bases, Mumbai (Bombay), September 3-6, pp. 544–555. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andruszkiewicz, P. (2009). Classification with Meta-learning in Privacy Preserving Data Mining. In: Chen, L., Liu, C., Liu, Q., Deng, K. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04205-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04205-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04204-1

  • Online ISBN: 978-3-642-04205-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics