On the privacy preserving properties of random data perturbation techniques

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 99-106

  Kargupta, Hillol ^a   Datta, Souptik ^a   Wang, Qi ^b   Sivakumar, Krishnamoorthy ^b  

^a University of Marylandw Baltimore County   (United States)

^b Washington State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149340011     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. D. Agrawal and C. C. Aggawal. On the design and quantification of privacy preserving data mining algorothms. In Proceedings of the 20th ACM SIMOD Symposium on Principles of Database Systems, pages 247-255, Santa Barbara, May 2001.
2. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceeding of the ACM SIGMOD Conference on Management of Data, pages 439-450, Dallas, Texas, May 2000. ACM Press.
3. V. Estivill-Castro and L. Brankovic. Data swaping: Balancing privacy against precision in mining for logic rules. In Proceedings of the first Conference on Data Warehousing and Knowledge Discovery (DaWaK-99), pages 389-398, Florence, Italy, 1999. Springer Verlag.
4. A. Evfimevski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proceedings of the ACM SIMOD/PODS Conference, San Diego, CA, June 2003.
5. A. Evfimevski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proceedings of the ACM SIKDD Conference, Edmonton, Canada, 2002.
6. S. Evfimievski. Randomization techniques for privacy preserving association rule mining. In SIGKDD Explorations, volume 4(2), Dec 2002.
7. S. Janson, T. L. , and A. Rucinski. Random Graphs. Wiley Publishers, 1 edition, 2000.
8. D. Jonsson. Some limit theorems for the eigenvalues of a sample covariance matrix. Journal of Multivariate Analysis, 12:1-38, 1982.
9. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In SIGMOD Workshop on DMKD, Madison, WI, June 2002.
10. H. Kargupta, K. Sivakumar, and S. Ghosh. Dependency detection in mobimine and random matrices. In Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases, pages 250-262. Springer, 2002.
11. K. Liu, H. Kargupta, and J. Ryan. Random projection and privacy preserving correlation computation from distributed data. Technical report, University of Maryland Baltimore County, Computer Science and Electrical Engineering Department, Technical Report TR-CS-03-24, 2003.
12. D. G. Manolakis, V. K. Ingle, and S. M. Kogon. Statistical and Adaptive Signal Processing. McGraw Hill, 2000.
13. M. L. Mehta. Random Matrices. Academic Press, London, 2 edition, 1991.
14. U. M. L. Repository. http://www.ics.uci.edu/mlearn/mlsummary.html.
15. S. J. Rizvi and J. R. Haritsa. Maintaining data privacy in association rule mining. In Proceedings of the 28th VLDB Conference, Hong Kong, China, 2002.
16. J. W. Silverstein and P. L. Combettes. Signal detection via spectral theory of large dimensional random matrices. IEEE Transactions on Signal Processing, 40(8):2100-2105, 1992.
17. G. W. Stewart. Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Review, 15(4):727-764, October 1973.
18. J. F. Traub, Y. Yemini, and H. Woz'niakowski. The statistical security of a statistical database. ACM Transactions on Database Systems (TODS), 9(4):672-679, 1984.
19. J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In The Eighth ACM SIGKDD International conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, CA, July 2002.
20. H. Weyl. Inequalities between the two kinds of eigenvalues of a linear transformation. In Proceedings of the National Academy of Sciences, volume 35, pages 408-411, 1949.