ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2021
DOI: 10.1109/icassp39728.2021.9413632
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Privacy-Preserving Distributed Extremely Randomized Trees for Structured Data With Multiple Colluding Parties

Abstract: Today, in many real-world applications of machine learning algorithms, the data is stored on multiple sources instead of at one central repository. In many such scenarios, due to privacy concerns and legal obligations, e.g., for medical data, and communication/computation overhead, for instance for large scale data, the raw data cannot be transferred to a center for analysis. Therefore, new machine learning approaches are proposed for learning from the distributed data in such settings. In this paper, we exten… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 28 publications
0
3
0
Order By: Relevance
“…Several studies focus on tree-based algorithms to train a model based on decentralized data. For instance, in [53], [23], [42], [54], [55], [56] the ID3 [57], random forest [58], and extremely randomized trees [59] algorithms are extended to be utilized for scenarios in which the training data is decentralized. These methods employ encryption or SMC to protect the privacy of data holders.…”
Section: State Of the Artmentioning
confidence: 99%
See 1 more Smart Citation
“…Several studies focus on tree-based algorithms to train a model based on decentralized data. For instance, in [53], [23], [42], [54], [55], [56] the ID3 [57], random forest [58], and extremely randomized trees [59] algorithms are extended to be utilized for scenarios in which the training data is decentralized. These methods employ encryption or SMC to protect the privacy of data holders.…”
Section: State Of the Artmentioning
confidence: 99%
“…In our previous studies in [7], [4], [6], [9], [103], [104], [105], we have developed energy-efficient ML techniques for mobile-health and wearable technologies, including in the distributed and federated learning [106], [12], [102]. On the other hand, we have looked into privacy-preserving distributed and federated learning techniques considering tree-based algorithms [55], [54], [56], [107], but not considering the resourceconstraints of mobile-health and wearable technologies. To address this gap, in this article, we propose a framework that jointly considers prediction performance, computation and communication overheads, and privacy concerns, which are all essential for resource-constrained mobile-health systems involving sensitive medical/personal data.…”
Section: State Of the Artmentioning
confidence: 99%
“…In the second alternative, we conduct privacy-preserving data analysis without sharing the data, for example, in the literary works. [72][73][74][75][76] Several mining algorithms can learn machine-learning models by receiving partial information about the data in the learning process instead of raw data. The party/parties holding data can participate in the learning process by merely sharing partial information instead of the raw data.…”
Section: Handling Of Privacy and Securitymentioning
confidence: 99%