• Publication
  • PrePrints
  • Abstract - A Random Decision Tree Framework for Privacy-preserving Data Mining
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Random Decision Tree Framework for Privacy-preserving Data Mining
PrePrint
ISSN: 1545-5971
Jaideep Vaidya, Rutgers University, Newark
Basit Shafiq, Lahore University of Management Sciences, Lahore
Wei Fan, Huawei Noah's Ark Lab, Hong Kong
Danish Mehmood, Lahore University of Management Sciences, Lahore
David Lorenzi, Rutgers University, Newark
Distributed data is ubiquitous in modern information driven applications. With multiple sources of data, the natural challenge is to determine how to collaborate effectively across proprietary organizational boundaries while maximizing the utility of collected information. Since using only local data gives suboptimal utility, techniques for privacy-preserving collaborative knowledge discovery must be developed. Existing cryptography-based work for privacy-preserving data mining is still too slow to be effective for large scale datasets to face today's big data challenge. Previous work on Random Decision Trees (RDT) shows that it is possible to generate equivalent and accurate models with much smaller cost. We exploit the fact that RDTs can naturally fit into a parallel and fully distributed architecture, and develop protocols to implement privacy-preserving RDTs that enable general and efficient distributed privacy-preserving knowledge discovery.
Index Terms:
Distributed databases,Security,integrity,and protection
Citation:
Jaideep Vaidya, Basit Shafiq, Wei Fan, Danish Mehmood, David Lorenzi, "A Random Decision Tree Framework for Privacy-preserving Data Mining," IEEE Transactions on Dependable and Secure Computing, 01 Oct. 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TDSC.2013.43>
Usage of this product signifies your acceptance of the Terms of Use.