随机森林
一致性(知识库)
计算机科学
多项式分布
随机性
编码(集合论)
特征(语言学)
模式识别(心理学)
人工智能
数据挖掘
算法
数学
统计
哲学
集合(抽象数据类型)
程序设计语言
语言学
作者
Jiawang Bai,Yiming Li,Jiawei Li,Xue Yang,Yong Jiang,Shu‐Tao Xia
标识
DOI:10.1016/j.patcog.2021.108331
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI