Skip to main content

Privacy-Preserving Linear Fisher Discriminant Analysis

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2008)

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

Included in the following conference series:

Abstract

Privacy-preserving data mining enables two or more parties to collaboratively perform data mining while preserving the data privacy of the participating parties. So far, various data mining and machine learning algorithms have been enhanced to incorporate privacy preservation. In this paper, we propose privacy-preserving solutions for Fisher Discriminant Analysis (FDA) over horizontally and vertically partitioned data. FDA is one of the widely used discriminant algorithms that seeks to separate different classes as much as possible for discriminant analysis or dimension reduction. It has been applied to face recognition, speech recognition, and handwriting recognition. The secure solutions are designed based on two basic secure building blocks that we have proposed—the Secure Matrix Multiplication protocol and the Secure Inverse of Matrix Sum protocol—which are in turn based on cryptographic techniques. We conducted experiments to evaluate the scalability of the proposed secure building blocks and overheads to achieve privacy when performing FDA.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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: Proceedings of the ACM SIGMOD, Dallas, Texas, United States, pp. 439–450 (2000)

    Google Scholar 

  2. Berkes, P.: Handwritten digit recognition with nonlinear fisher discriminant analysis. In: Proceedings of the International Conference on Artificial Neural Networks, pp. 285–287 (2005)

    Google Scholar 

  3. Du, W., Han, Y., Chen, S.: Privacy-preserving multivariate statistical analysis: Linear regression and classification. In: Proceedings of the 4th SIAM International Conference on Data Mining, Florida, April 22–24, 2004, pp. 222–233 (2004)

    Google Scholar 

  4. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern classification, 2nd edn. Wiley-Interscience, Chichester (2000)

    Google Scholar 

  5. Fisher, R.A.: The use of multiple measurements in taxonomic problems. Annals of Eugenics 7, 179–188 (1936)

    Google Scholar 

  6. Goethals, B., Laur, S., Lipmaa, H., Mielikainen, T.: On private scalar product computation for privacy-preserving data mining. In: Proceedings of the 7th Annual International Conference in Information Security and Cryptology, pp. 104–120

    Google Scholar 

  7. Han, S., Ng, W.K.: Privacy-Preserving Genetic Algorithms for Rule Discovery. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 407–417. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Han, S., Ng, W.K.: Privacy-preserving self-organizing map. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 428–437. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Hong, Z.-Q., Yang, J.-Y.: Optimal discriminant plane for a small number of samples and design method of classifier on the plane. Pattern Recognition 24(4), 317–324 (1991)

    Article  MathSciNet  Google Scholar 

  10. Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the 8th ACM SIGKDD, Chicago, Illinois, USA, pp. 593–599 (2005)

    Google Scholar 

  11. Katz, M., Meier, H.G., Dolfing, H., Klakow, D.: Robustness of linear discriminant analysis in automatic speech recognition. In: Proceedings of the 16th International Conference on Pattern Recognition, pp. 371–374 (2002)

    Google Scholar 

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

    Chapter  Google Scholar 

  13. Lu, J., Plataniotis, K.N., Venetsanopoulos, A.N.: Face recognition using kernel direct discriminant analysis algorithms. IEEE Transactions on Neural Networks 14(1), 117–126 (2003)

    Article  Google Scholar 

  14. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Google Scholar 

  15. Strang, G.: Linear algebra and its applications. Thomson, Brooks/Cole (2006)

    Google Scholar 

  16. Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the 8th ACM SIGKDD, Edmonton, Alberta, Canada, July 23-26, 2002, pp. 639–644 (2002)

    Google Scholar 

  17. Wan, L., Ng, W.K., Han, S., Lee, V.C.S.: Privacy-preservation for gradient descent methods. In: Proceedings of the 13th ACM SIGKDD, San Jose, California, USA, August 2007, pp. 775–783 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Takashi Washio Einoshin Suzuki Kai Ming Ting Akihiro Inokuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, S., Ng, W.K. (2008). Privacy-Preserving Linear Fisher Discriminant Analysis. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68125-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics