Generalized random rotation perturbation for vertically partitioned data sets

Author(s):  
Zhenmin Lin ◽  
Jie Wang ◽  
Lian Liu ◽  
Jun Zhang
2015 ◽  
Vol 23 (3) ◽  
pp. 570-579 ◽  
Author(s):  
Yong Li ◽  
Xiaoqian Jiang ◽  
Shuang Wang ◽  
Hongkai Xiong ◽  
Lucila Ohno-Machado

Objective To develop an accurate logistic regression (LR) algorithm to support federated data analysis of vertically partitioned distributed data sets. Material and Methods We propose a novel technique that solves the binary LR problem by dual optimization to obtain a global solution for vertically partitioned data. We evaluated this new method, VERTIcal Grid lOgistic regression (VERTIGO), in artificial and real-world medical classification problems in terms of the area under the receiver operating characteristic curve, calibration, and computational complexity. We assumed that the institutions could “align” patient records (through patient identifiers or hashed “privacy-protecting” identifiers), and also that they both had access to the values for the dependent variable in the LR model (eg, that if the model predicts death, both institutions would have the same information about death). Results The solution derived by VERTIGO has the same estimated parameters as the solution derived by applying classical LR. The same is true for discrimination and calibration over both simulated and real data sets. In addition, the computational cost of VERTIGO is not prohibitive in practice. Discussion There is a technical challenge in scaling up federated LR for vertically partitioned data. When the number of patients m is large, our algorithm has to invert a large Hessian matrix. This is an expensive operation of time complexity O(m3) that may require large amounts of memory for storage and exchange of information. The algorithm may also not work well when the number of observations in each class is highly imbalanced. Conclusion The proposed VERTIGO algorithm can generate accurate global models to support federated data analysis of vertically partitioned data.


2017 ◽  
Vol 17 (2) ◽  
pp. 44-55 ◽  
Author(s):  
M. Antony Sheela ◽  
K. Vijayalakshmi

Abstract Data mining on vertically or horizontally partitioned dataset has the overhead of protecting the private data. Perturbation is a technique that protects the revealing of data. This paper proposes a perturbation and anonymization technique that is performed on the vertically partitioned data. A third-party coordinator is used to partition the data recursively in various parties. The parties perturb the data by finding the mean, when the specified threshold level is reached. The perturbation maintains the statistical relationship among attributes.


2008 ◽  
Vol 2 (3) ◽  
pp. 1-27 ◽  
Author(s):  
Jaideep Vaidya ◽  
Chris Clifton ◽  
Murat Kantarcioglu ◽  
A. Scott Patterson

Sign in / Sign up

Export Citation Format

Share Document