.png){kind=icon}
Return
Multinomial random forest
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2021.108331.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Despite the impressive performance of random forests (RF), its theoretical properties have not been thoroughly understood. In this paper, we propose a novel RF framework, dubbed multinomial random forest (MRF), to analyze its consistency and privacy-preservation . Instead of deterministic greedy split rule or with simple randomness, the MRF adopts two impurity-based multinomial distributions to randomly select a splitting feature and a splitting value, respectively. Theoretically, we prove the consistency of MRF and analyze its privacy-preservation within the framework of differential privacy. We also demonstrate with multiple datasets that its performance is on par with the standard RF. To the best of our knowledge, MRF is the first consistent RF variant that has comparable performance to the standard RF. The code is available at https://github.com/jiawangbai/Multinomial- Random-Forest . (c) 2021 Published by Elsevier Ltd.
Keywords:
Random forest
Consistency
Differential privacy
Classification
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveShareSaveA differentially private greedy decision forest classification algorithm with high utility.png)
COMPUTERS & SECURITY
COMPUTERS & SECURITYIF5.4
PREAI
ShareSaveAn experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomizationMACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAIShareSaveShareSave
ShareSave
View more