A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A local distributed peer-to-peer algorithm using multi-party optimization based privacy preservation for data mining primitive computation
2009
2009 IEEE Ninth International Conference on Peer-to-Peer Computing
This paper proposes a scalable, local privacy-preserving algorithm for distributed peer-to-peer (P2P) data aggregation useful for many advanced data mining/analysis tasks such as average/sum computation, decision tree induction, feature selection, and more. Unlike most multi-party privacy-preserving data mining algorithms, this approach works in an asynchronous manner through local interactions and therefore, is highly scalable. It particularly deals with the distributed computation of the sum
doi:10.1109/p2p.2009.5284514
dblp:conf/p2p/DasBK09
fatcat:jwbgdjujvbbelmblpujikmrssy