Cited by 51Privacy-Preserving Technologies in DataTensor decomposition and applicationsMachine Learning in Healthcare

Privacy-Preserving Tensor Factorization for Collaborative Health Data Analysis

Open access
Ma, Jing, Zhang, Qiuchen, Lou, Jian, Ho, Joyce C., Xiong, Li, Jiang, Xiaoqian·2019·Proceedings of the 28th ACM International Conference on Information and Knowledge Management

Abstract

Tensor factorization has been demonstrated as an efficient approach for computational phenotyping, where massive electronic health records (EHRs) are converted to concise and meaningful clinical concepts. While distributing the tensor factorization tasks to local sites can avoid direct data sharing, it still requires the exchange of intermediary results which could reveal sensitive patient information. Therefore, the challenge is how to jointly decompose the tensor under rigorous and principled privacy constraints, while still support the model's interpretability. We propose DPFact, a privacy-preserving collaborative tensor factorization method for computational phenotyping using EHR. It embeds advanced privacy-preserving mechanisms with collaborative learning. Hospitals can keep their EHR database private but also collaboratively learn meaningful clinical concepts by sharing differentially private intermediary results. Moreover, DPFact solves the heterogeneous patient population using a structured sparsity term. In our framework, each hospital decomposes its local tensors and sends the updated intermediary results with output perturbation every several iterations to a semi-trusted server which generates the phenotypes. The evaluation on both real-world and synthetic datasets demonstrated that under strict privacy constraints, our method is more accurate and communication-efficient than state-of-the-art baseline methods.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3357384.3357878

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The field of secure multi-party computation has moved from being of purely theoretical interest to a deployed technology in industry.

    “Thanks to both theoretical and engineering breakthroughs, the field has moved from being of a purely theoretical interest to a deployed technology in industry [78, 77, 295, 27, 191, 242, 243].”

    From Advances and Open Problems in Federated Learning (2021) · cites this paper as [77]

    The Conclusion and §5.3 Implementation Details describe a differentially private tensor-factorization method tested on datasets using AWS instances. Searches for secure multi-party computation and industrial deployment found no passage in our copy addressing the claimed shift from theory to deployed industry technology. (LLM, conf=0.76)

    Experimental — accuracy not yet measured
  • Distributed local-updating primal methods have been applied with success for both convex and non-convex objectives.

    “For both convex and non-convex objectives, distributed local-updating primal methods have also been applied with success [137].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 23

  1. Alex Beutel, Partha Pratim Talukdar, Abhimanu Kumar, Christos Faloutsos, Evan- gelos E Papalexakis, and Eric P Xing. 2014. Flexifact: Scalable flexible factorization of coupled tensors on hadoop. In Proceedings of the 2014 SDM. 109-117.
  2. Joon Hee Choi and S Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In NIPS. 1296-1304.
  3. Patrick L Combettes and Jean-Christophe Pesquet. 2011. Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering. Springer, 185-212.
  4. Cynthia Dwork, Aaron Roth, et al. 2014. The algorithmic foundations of differ- ential privacy. Foundations and Trends® in Theoretical Computer Science 9, 3-4 (2014), 211-407.
  5. Cynthia Dwork and Guy N Rothblum. 2016. Concentrated differential privacy. arXiv preprint arXiv:1603.01887 (2016). · arXiv
  6. Cynthia Dwork, Guy N Rothblum, and Salil Vadhan. 2010. Boosting and differ- ential privacy. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE, 51-60.
  7. Yuhong Guo and Wei Xue. 2013. Probabilistic Multi-Label Classification with Sparse Feature Learning.. In IJCAI. 1373-1379.
  8. Joyce C Ho, Joydeep Ghosh, and Jimeng Sun. 2014. Marble: high-throughput phenotyping from electronic health records via sparse nonnegative tensor fac- torization. In Proceedings of the 20th ACM SIGKDD. ACM, 115-124.
  9. Jingyu Hua, Chang Xia, and Sheng Zhong. 2015. Differentially Private Matrix Factorization.. In IJCAI. 1763-1770.
  10. Alistair EW Johnson, Tom J Pollard, Lu Shen, H Lehman Li-wei, Mengling Feng, Mohammad Ghassemi, Benjamin Moody, Peter Szolovits, Leo Anthony Celi, and Roger G Mark. 2016. MIMIC-III, a freely accessible critical care database. Scientific data 3 (2016), 160035.
  11. U Kang, Evangelos Papalexakis, Abhay Harpale, and Christos Faloutsos. 2012. Gigatensor: scaling tensor analysis up by 100 times-algorithms and discoveries. In Proceedings of the 18th ACM SIGKDD. ACM, 316-324.
  12. Yejin Kim, Robert El-Kareh, Jimeng Sun, Hwanjo Yu, and Xiaoqian Jiang. 2017. Discriminative and distinct phenotyping by constrained tensor factorization. Scientific reports 7, 1 (2017), 1114.
  13. Jun Liu, Shuiwang Ji, and Jieping Ye. 2009. Multi-task feature learning via efficient ℓ 2, 1 -norm minimization. In UAI. 339-348.
  14. Jing Ma, Qiuchen Zhang, Jian Lou, Joyce C Ho, Li Xiong, and Xiaoqian Jiang. 2019. Privacy-Preserving Tensor Factorization for Collaborative Health Data Analysis. arXiv preprint arXiv:1908.09888 (2019). · arXiv
  15. Feiping Nie, Heng Huang, Xiao Cai, and Chris H Ding. 2010. Efficient and robust feature selection via joint ℓ 2, 1 -norms minimization. In NeurIPS. 1813-1821.
  16. Rachel L Richesson, Jimeng Sun, Jyotishman Pathak, Abel N Kho, and Joshua C Denny. 2016. Clinical phenotyping in selected national networks: demonstrating the need for high-throughput, portable, and computational methods. Artificial intelligence in medicine 71 (2016), 57-61.
  17. Yining Wang and Anima Anandkumar. 2016. Online and differentially-private tensor decomposition. In NeurIPS. 3531-3539.
  18. Yichen Wang, Robert Chen, Joydeep Ghosh, Joshua C Denny, Abel Kho, You Chen, Bradley A Malin, and Jimeng Sun. 2015. Rubik: Knowledge guided tensor factorization and completion for health data analytics. In Proceedings of the 21th ACM SIGKDD. ACM, 1265-1274.
  19. Wei-Qi Wei and Joshua C Denny. 2015. Extracting research-quality phenotypes from electronic health records to support precision medicine. Genome medicine 7, 1 (2015), 41.
  20. Yi Yang, Heng Tao Shen, Zhigang Ma, Zi Huang, and Xiaofang Zhou. 2011. ℓ 2, 1 - norm regularized discriminative feature selection for unsupervised learning. In IJCAI, Vol. 22. 1589.
  21. Doaa Youssef, Hadeel Abd-Elrahman, Mohamed M Shehab, Mohamed Abd- Elrheem, et al. 2015. Incidence of acute kidney injury in the neonatal intensive care unit. Saudi journal of kidney diseases and transplantation 26, 1 (2015), 67.
  22. Lei Yu, Ling Liu, Calton Pu, Mehmet Emre Gursoy, and Stacey Truex. 2019. Differentially Private Model Publishing for Deep Learning. arXiv preprint arXiv:1904.02200 (2019). · arXiv
  23. Sixin Zhang, Anna E Choromanska, and Yann LeCun. 2015. Deep learning with elastic averaging SGD. In NeurIPS. 685-693.

Cited by

Sorted by citations

Authors
Ma, J., Zhang, Q., Lou, J., Ho, J. C., Xiong, L., & Jiang, X.
Affiliations
  • Emory University (US)
  • The University of Texas Health Science Center at Houston (US)
Venue
Proceedings of the 28th ACM International Conference on Information and Knowledge Management
Publisher
ACM
Published
2019-11-03
Volume
2019
Pages
1291-1300
ISSN
2155-0751 (ISSN-L)
OpenAlex
W2970406589
Cited by
51
References
16
Citations by year
2026: 4 · 2025: 6 · 2024: 10 · 2023: 7 · 2022: 6 · 2021: 11 · 2020: 7
FWCI
2.30
Type
conference paper
Language
en
Open access
Locations
  • ACM International Conference on Information and Knowledge Management (CIKM) (publishedVersion)
  • PubMed (publishedVersion)
  • PubMed Central (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Institutes of Health (R01GM118609)
  • National Science Foundation (1838200)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Mathematics › Computational Mathematics › Tensor decomposition and applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning in Healthcare
Keywords
computational phenotyping, electronic health records, differential privacy, cooperative learning, federated learning, structured sparsity, heterogeneous patient populations, communication efficiency, clinical concept extraction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review