期刊
NEURAL NETWORKS
卷 106, 期 -, 页码 20-29出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.neunet.2018.06.006
关键词
Random forests; Cooperative game; Banzhaf power index; Consistency
资金
- National Key R&D Program of China [2016YFC1401004]
- National Natural Science Foundation Of China (NSFC) [61473236, 61403353]
- International Science & Technology Cooperation Program of China (ISTCP) [2014DFA10410]
- Science and Technology Program of Qingdao [17-3-3-20-nsh]
- Suzhou Science and Technology Program [SYG201712, SZS201613]
- CERNET Innovation Project [NGII20170416]
- Key Program Special Fund in XJTLU [KSF-A-01]
- Fundamental Research Funds for the Central Universities of China
Random forests algorithms have been widely used in many classification and regression applications. However, the theory of random forests lags far behind their applications. In this paper, we propose a novel random forests classification algorithm based on cooperative game theory. The Banzhaf power index is employed to evaluate the power of each feature by traversing possible feature coalitions. Hence, we call the proposed algorithm Banzhaf random forests (BRFs). Unlike the previously used information gain ratio, which only measures the power of each feature for classification and pays less attention to the intrinsic structure of the feature variables, the Banzhaf power index can measure the importance of each feature by computing the dependency among the group of features. More importantly, we have proved the consistency of BRFs, which narrows the gap between the theory and applications of random forests. Extensive experiments on several UCI benchmark data sets and three real world applications show that BRFs perform significantly better than existing consistent random forests on classification accuracy, and better than or at least comparable with Breiman's random forests, support vector machines (SVMs) and k-nearest neighbors (KNNs) classifiers. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据