Return to search results
A Local Distributed Peer-to-Peer Algorithm Using Multi-Party Optimization Based Privacy Preservation for Data Mining Primitive Computation
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 of a set of numbers stored at different peers in a P2P network in the context of a P2P web mining application. The proposed optimization-based privacy-preserving technique for computing the sum allows different peers to specify different privacy requirements without having to adhere to a global set of parameters for the chosen privacy model. Since distributed sum computation is a frequently used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacypreserving clustering, frequent itemset mining, and statistical aggregate computation.
Find Related Datasets
Search by Tags
Click any tag below to search for similar datasets
Complete Metadata
| @type | dcat:Dataset |
|---|---|
| accessLevel | public |
| accrualPeriodicity | irregular |
| bureauCode |
[ "026:00" ] |
| contactPoint |
{ "fn": "Kanishka Bhaduri", "@type": "vcard:Contact", "hasEmail": "mailto:kanishka.bhaduri-1@nasa.gov" } |
| description | 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 of a set of numbers stored at different peers in a P2P network in the context of a P2P web mining application. The proposed optimization-based privacy-preserving technique for computing the sum allows different peers to specify different privacy requirements without having to adhere to a global set of parameters for the chosen privacy model. Since distributed sum computation is a frequently used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacypreserving clustering, frequent itemset mining, and statistical aggregate computation. |
| distribution |
[ { "@type": "dcat:Distribution", "title": "p2p_ppwm.pdf", "format": "PDF", "mediaType": "application/pdf", "description": "Paper", "downloadURL": "https://c3.nasa.gov/dashlink/static/media/publication/p2p_ppwm.pdf" } ] |
| identifier | DASHLINK_182 |
| issued | 2010-09-22 |
| keyword |
[ "ames", "dashlink", "nasa" ] |
| landingPage | https://c3.nasa.gov/dashlink/resources/182/ |
| modified | 2025-03-31 |
| programCode |
[ "026:029" ] |
| publisher |
{ "name": "Dashlink", "@type": "org:Organization" } |
| title | A Local Distributed Peer-to-Peer Algorithm Using Multi-Party Optimization Based Privacy Preservation for Data Mining Primitive Computation |
