Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/1166890.1166956guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Tools for privacy preserving Kernel methods in data mining

Published: 13 February 2006 Publication History

Abstract

We provide an overview of the emerging issues in privacy preserving data mining. Also we develop solutions for two secure two-party computing problems. Many of the research issues focus on underlying blocks, we show how to integrate them with kernel methods in classifications. We evaluate their performance, privacy capacity, and draw some initial conclusions.

References

[1]
{1} R. Agrawal and R. Srikant, Privacy-preserving data mining, Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, May 14-19, 2000, 439-450.]]
[2]
{2} Y. Lindell and B. Pinkas, Privacy preserving data mining, Journal of Cryptology, 15(3), 2002, 177-206.]]
[3]
{3} S.J. Rizvi and J. R. Haritsa, Maintaining data privacy in association rule mining, Proceedings of 28th International Conference on Very Large Data Bases, Aug 20-23, 2002, 682-693.]]
[4]
{4} A. Evfimievski, Randomization in privacy-preserving data mining, SigKDD Explorations, 4(2), 2002, 28-34.]]
[5]
{5} Wenliang Du and Zhijun Zhan, Using randomized response techniques for privacy-preserving data mining, SigKDD 2003, Aug 24-27, 2003, 505-510.]]
[6]
{6} M. Kantarsioglu and C. Clifton, Privacy-preserving distributed mining of association rules on horizontally partioned data, The ACM SIGMOD Workshop on Research Issued on Data Ming and Knowlwdege Discovery , Jun 2, 2002, 24-31.]]
[7]
{7} J. Vaidya and C. Clifton, Privacy preserving association rule mining in vertically partioned data, the 8th SIGKDD International Conference on Knowledge Discovery and Data Mining, Jul 23-26, 2002, 639-644.]]
[8]
{8} S. Goldwasser, Multi-party computations: Past and Present, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Aug 21-24, 1997, 1-6.]]
[9]
{9} C. Clifton, M. Kantarsioglu, L. Xiaodong and M. Zhu, Tools for privacy preserving distributed data mining, SigKDD Explorations, 4(2), 2003, 28-34.]]
[10]
{10} M. Rabin, How to exchange secrets by oblivious transfer, Technical Memo TR-81, Aiken Compution Laboratory, 1981.]]
[11]
{11} S. Even, O. Goldreich and A. Lempel, A randomized protocol for sigining contracts, Communications of the ACM, 28, 1985, 637-647.]]
[12]
{12} M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation, 31st ACM STOC, 5, 1999, 245-254.]]
[13]
{13} A. Davison and D. Hinkley, Bootstrap methods and their applications (Cambridge: Cambridge University Press, 1997)]]
[14]
{14} M. Atallah and Wenglaing Du, Secure multiparty computational geometry, Proceedings of 7th International Workshop on Algorithms and Data Structures, 2125, 2001, 165-179]]
[15]
{15} I. Ioannidis, A. Grama and M. Atallah, A secure protocol for computing dot products in clustered and distributed enviorenments, The International Conference on Parallel Processing, 16, 2002, 18-21.]]
[16]
{16} J. Shawe-Taylor and N. Cristianini, Kernel methods for pattern analysis (Cambridge: Cambridge University Press, 2004).]]

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
AIA'06: Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
February 2006
512 pages
ISBN:0889865566

Publisher

ACTA Press

United States

Publication History

Published: 13 February 2006

Author Tags

  1. data mining
  2. kernel methods
  3. privacy preserving

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 36
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media