Hide metadata

dc.date.accessioned2022-06-29T16:40:54Z
dc.date.available2022-06-29T16:40:54Z
dc.date.created2022-01-21T14:29:43Z
dc.date.issued2022
dc.identifier.citationAminifar, Amin Matin, Shokri Rabbi, Fazle Pun, Violet Ka I Lamo, Yngve . Extremely Randomized Trees With Privacy Preservation for Distributed Structured Health Data. IEEE Access. 2022, 10, 6010-6027
dc.identifier.urihttp://hdl.handle.net/10852/94499
dc.description.abstractArtificial intelligence and machine learning have recently attracted considerable attention in the healthcare domain. The data used by machine learning algorithms in healthcare applications is often distributed over multiple sources, for instance, hospitals or patients’ personal devices. One main difficulty lies in analyzing such data without compromising patients’ privacy and personal data, which is a primary concern in healthcare applications. Therefore, in these applications, we are interested in running machine learning algorithms over distributed data without disclosing sensitive information about the data subjects. In this paper, we propose a distributed extremely randomized trees algorithm for learning from distributed data with privacy preservation. We present the implementation of our technique (which we refer to as k -PPD-ERT) on a cloud platform and demonstrate its performance based on medical data, including Heart Disease, Breast Cancer, and mental health datasets (Depresjon and Psykose datasets) associated with the Norwegian INTROducing Mental health through Adaptive Technology (INTROMAT) project.
dc.languageEN
dc.rightsAttribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.titleExtremely Randomized Trees With Privacy Preservation for Distributed Structured Health Data
dc.title.alternativeENEngelskEnglishExtremely Randomized Trees With Privacy Preservation for Distributed Structured Health Data
dc.typeJournal article
dc.creator.authorAminifar, Amin
dc.creator.authorMatin, Shokri
dc.creator.authorRabbi, Fazle
dc.creator.authorPun, Violet Ka I
dc.creator.authorLamo, Yngve
cristin.unitcode185,15,5,0
cristin.unitnameInstitutt for informatikk
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1
dc.identifier.cristin1987466
dc.identifier.bibliographiccitationinfo:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEEE Access&rft.volume=10&rft.spage=6010&rft.date=2022
dc.identifier.jtitleIEEE Access
dc.identifier.volume10
dc.identifier.startpage6010
dc.identifier.endpage6027
dc.identifier.doihttps://doi.org/10.1109/ACCESS.2022.3141709
dc.identifier.urnURN:NBN:no-97051
dc.type.documentTidsskriftartikkel
dc.type.peerreviewedPeer reviewed
dc.source.issn2169-3536
dc.identifier.fulltextFulltext https://www.duo.uio.no/bitstream/handle/10852/94499/1/Aminifar.pdf
dc.type.versionPublishedVersion
dc.relation.projectNFR/259293


Files in this item

Appears in the following Collection

Hide metadata

Attribution 4.0 International
This item's license is: Attribution 4.0 International