Sciweavers

34 search results - page 5 / 7
» Communication-Efficient Privacy-Preserving Clustering
Sort
View
CLUSTER
2004
IEEE
14 years 1 months ago
Communicating efficiently on cluster based grids with MPICH-VMI
Emerging infrastructure of computational grids composed of Clusters-of-Clusters (CoC) interlinked through high throughput channels promises unprecedented raw compute power for ter...
Avneesh Pant, Hassan Jafri
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 11 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
SUTC
2006
IEEE
14 years 3 months ago
Energy and Communication Efficient Group Key Management Protocol for Hierarchical Sensor Networks
- In this paper, we describe a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dyn...
Biswajit Panja, Sanjay Kumar Madria, Bharat K. Bha...
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 4 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 10 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson