ACM Home Page
Please provide us with feedback. Feedback
A new scheme on privacy-preserving data classification
Full text PdfPdf (807 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining table of contents
Chicago, Illinois, USA
SESSION: Research track paper table of contents
Pages: 374 - 383  
Year of Publication: 2005
ISBN:1-59593-135-X
Authors
Nan Zhang  Texas A&M University, College Station, TX
Shengquan Wang  Texas A&M University, College Station, TX
Wei Zhao  Texas A&M University, College Station, TX
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 162,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1081870.1081913
What is a DOI?

ABSTRACT

We address privacy-preserving classification problem in a distributed system. Randomization has been the approach proposed to preserve privacy in such scenario. However, this approach is now proven to be insecure as it has been discovered that some privacy intrusion techniques can be used to reconstruct private information from the randomized data tuples. We introduce an algebraic-technique-based scheme. Compared to the randomization approach, our new scheme can build classifiers more accurately but disclose less private information. Furthermore, our new scheme can be readily integrated as a middleware with existing systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
S. Agrawal, V. Krishnan, and J. R. Haritsa. On addressing efficiency concerns in privacy-preserving mining. In Proceedings of the 9th International Conference on Database Systems for Advanced Applications, pages 439--450. Springer Verlag, 2004.
 
4
C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
 
5
 
6
L. Cranor, J. Reagle, and M. S. Ackerman. Beyond concern: Understanding net users' attitudes about online privacy. Technical Report TR 99.4.3, AT&T Labs-Research, 1999.
 
7
8
 
9
G. H. Golub and C. F. V. Loan. Matrix Computation. John Hopkins University Press, 1996.
 
10
 
11
HIPAA. Health insurance portability and accountability act, 2002. available at http://www.hhs.gov/ocr/hipaa/privrulepd.pdf.
 
12
M. Kantarcioglu and J. Vaidya. Privacy preserving naïve bayes classifier for horizontally partitioned data. In Workshop on Privacy Preserving Data Mining held in association with The 3rd IEEE International Conference on Data Mining, 2003.
 
13
 
14
 
15
 
16
J. Vaidya and C. Clifton. Privacy preserving naïve bayes classifier for vertically partitioned data. In Proceedings of the 4th SIAM Conference on Data Mining, pages 330--334. SIAM Press, 2004.
 
17

CITED BY  8

Collaborative Colleagues:
Nan Zhang: colleagues
Shengquan Wang: colleagues
Wei Zhao: colleagues