Pages that link to "Item:Q867633"
From MaRDI portal
The following pages link to Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633):
Displaying 12 items.
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- \(k\)-anonymous data collection (Q730905) (← links)
- Towards the evaluation of time series protection methods (Q833741) (← links)
- Privacy-preserving health data collection for preschool children (Q2262220) (← links)
- Symmetric cryptographic protocols for extended millionaires' problem (Q2267143) (← links)
- Two methods for privacy preserving data mining with malicious participants (Q2456504) (← links)
- Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations (Q2465979) (← links)
- A two-stage integer programming model considering transaction equivalence for privacy preservation (Q2676400) (← links)
- (Q3306526) (← links)
- Protecting data: a fuzzy approach (Q3451411) (← links)
- PRIVACY-PRESERVING SVD-BASED COLLABORATIVE FILTERING ON PARTITIONED DATA (Q3565434) (← links)
- Distributed Computing - IWDC 2003 (Q5191454) (← links)