Sciweavers

12 search results - page 2 / 3
» Privacy-preserving k-means clustering over vertically partit...
Sort
View
ICDE
2009
IEEE
168views Database» more  ICDE 2009»
14 years 7 months ago
Privacy-Preserving Singular Value Decomposition
Abstract-- In this paper, we propose secure protocols to perform Singular Value Decomposition (SVD) for two parties over horizontally and vertically partitioned data. We propose va...
Shuguo Han, Wee Keong Ng, Philip S. Yu
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
14 years 5 months ago
Privacy-preserving k-means clustering over vertically partitioned data
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
Jaideep Vaidya, Chris Clifton
ADC
2007
Springer
145views Database» more  ADC 2007»
13 years 11 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
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 10 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 5 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...