Li Yong, Jiang Xiaoqian, Wang Shuang, Xiong Hongkai, Ohno-Machado Lucila
EE Department, Shanghai Jiaotong University, Shanghai, China, 200240.
Department of Biomedical Informatics, UC San Diego, La Jolla, California, USA
J Am Med Inform Assoc. 2016 May;23(3):570-9. doi: 10.1093/jamia/ocv146. Epub 2015 Nov 9.
To develop an accurate logistic regression (LR) algorithm to support federated data analysis of vertically partitioned distributed data sets.
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).
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.
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(m(3)) 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.
The proposed VERTIGO algorithm can generate accurate global models to support federated data analysis of vertically partitioned data.
开发一种精确的逻辑回归(LR)算法,以支持对垂直划分的分布式数据集进行联合数据分析。
我们提出了一种新技术,通过对偶优化解决二元LR问题,以获得垂直划分数据的全局解。我们在人工和现实世界的医学分类问题中,从受试者工作特征曲线下面积、校准和计算复杂度方面评估了这种新方法——垂直网格逻辑回归(VERTIGO)。我们假设各机构可以“对齐”患者记录(通过患者标识符或哈希后的“隐私保护”标识符),并且它们都可以访问LR模型中因变量的值(例如,如果模型预测死亡,两个机构将拥有关于死亡的相同信息)。
VERTIGO得出的解与应用经典LR得出的解具有相同的估计参数。在模拟和真实数据集上的区分度和校准方面也是如此。此外,VERTIGO的计算成本在实际中并非过高。
在扩大对垂直划分数据的联合LR规模方面存在技术挑战。当患者数量m很大时,我们的算法必须求逆一个大的海森矩阵。这是一个时间复杂度为O(m(3))的昂贵操作,可能需要大量内存来存储和交换信息。当每个类中的观测数量高度不平衡时,该算法可能也无法很好地工作。
所提出的VERTIGO算法可以生成精确的全局模型,以支持对垂直划分数据的联合数据分析。