Abstract
In this paper we studied privacy preserving distributed data mining. The existing methods focus on a universal approach that exerts preservation in the same degree for all persons, without catering for their concrete needs. In view of this we innovatively proposed a new framework combining the secure multiparty computation (SMC) with K-anonymity technology, and achieved personalized privacy preserving distributed data mining based on decision tree classification algorithm. Compared with other algorithms our method could make a good trade-off point between privacy and accuracy, with high efficiency and low-overhead of computing and communication.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
