Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Bart Kamphorst"'
Differentially Private Block Coordinate Descent for Linear Regression on Vertically Partitioned Data
Publikováno v:
Journal of Cybersecurity and Privacy, Vol 2, Iss 4, Pp 862-881 (2022)
We present a differentially private extension of the block coordinate descent algorithm by means of objective perturbation. The algorithm iteratively performs linear regression in a federated setting on vertically partitioned data. In addition to a p
Externí odkaz:
https://doaj.org/article/46b1b90af222476d99bc0514c29f579a
Publikováno v:
BMC Medical Informatics and Decision Making, Vol 22, Iss 1, Pp 1-18 (2022)
Abstract Background Analysing distributed medical data is challenging because of data sensitivity and various regulations to access and combine data. Some privacy-preserving methods are known for analyzing horizontally-partitioned data, where differe
Externí odkaz:
https://doaj.org/article/3cb2d7790cb647228388348a8c39b500
Autor:
Marie Beth van Egmond, Gabriele Spini, Onno van der Galien, Arne IJpma, Thijs Veugen, Wessel Kraaij, Alex Sangers, Thomas Rooijakkers, Peter Langenkamp, Bart Kamphorst, Natasja van de L’Isle, Milena Kooij-Janic
Publikováno v:
BMC Medical Informatics and Decision Making, Vol 21, Iss 1, Pp 1-16 (2021)
Abstract Background Recent developments in machine learning have shown its potential impact for clinical use such as risk prediction, prognosis, and treatment selection. However, relevant data are often scattered across different stakeholders and the
Externí odkaz:
https://doaj.org/article/8b263a8d1f5744b1a5839a1725efb851
Publikováno v:
Cryptography, Vol 6, Iss 4, p 54 (2022)
We present the first algorithm that combines privacy-preserving technologies and state-of-the-art explainable AI to enable privacy-friendly explanations of black-box AI models. We provide a secure algorithm for contrastive explanations of black-box m
Externí odkaz:
https://doaj.org/article/a125f59f98ee42978d767aecfef4c139
Autor:
Bart Kamphorst, Bert Zwart
Publikováno v:
Stochastic Systems, 10(1), 1-28
Stochastic Systems, 10(1), 1-28. INFORMS Institute for Operations Research and the Management Sciences
Stochastic Systems, 10(1), 1-28. INFORMS Institute for Operations Research and the Management Sciences
We consider the steady-state distribution of the sojourn time of a job entering an M/GI/1 queue with the foreground–background scheduling policy in heavy traffic. The growth rate of its mean as well as the limiting distribution are derived under br
Publikováno v:
BMC Medical Informatics and Decision Making, 22(1), 49.1-49.18
Background Analysing distributed medical data is challenging because of data sensitivity and various regulations to access and combine data. Some privacy-preserving methods are known for analyzing horizontally-partitioned data, where different organi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d536e0e2ad64b5e64160eb48c50d5eec
https://ir.cwi.nl/pub/31562
https://ir.cwi.nl/pub/31562
Autor:
Bart Kamphorst, Bert Zwart
Publikováno v:
Stochastic Processes and their Applications, 129(2), 572-603
Stochastic Processes and their Applications, 129(2), 572-603. Elsevier
Stochastic Processes and their Applications, 129(2), 572-603. Elsevier
This paper addresses heavy-tailed large deviation estimates for the distribution tail of functionals of a class of spectrally one-sided L\'evy process. Our contribution is to show that these estimates remain valid in a near-critical regime. This comp
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030780852
CSCML
CSCML
We show how multiple data-owning parties can collaboratively train several machine learning algorithms without jeopardizing the privacy of their sensitive data. In particular, we assume that every party knows specific features of an overlapping set o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21225566daace9a81a7b66439a9e9822
https://ir.cwi.nl/pub/31077
https://ir.cwi.nl/pub/31077
Publikováno v:
arXiv. Cornell University Library
arXiv
Mathematics of Operations Research, 43(3), 949-964. INFORMS Institute for Operations Research and the Management Sciences
Mathematics of Operations Research, 43(3), 949-964
arXiv
Mathematics of Operations Research, 43(3), 949-964. INFORMS Institute for Operations Research and the Management Sciences
Mathematics of Operations Research, 43(3), 949-964
For a GI/GI/1 queue, we show that the average sojourn time under the (blind) Randomized Multilevel Feedback algorithm is no worse than that under the Shortest Remaining Processing Time algorithm times a logarithmic function of the system load. Moreov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14078bca69334eb68a4046bcfbcfe4b5
https://research.tue.nl/nl/publications/84699619-5d8d-4d09-ac1d-06e7ca8685c8
https://research.tue.nl/nl/publications/84699619-5d8d-4d09-ac1d-06e7ca8685c8