Novel Decision Forest Building Techniques by Utilising Correlation Coefficient Methods

Drousiotis, Efthyvoulos, Shi, Lei, Spirakis, Paul ORCID: 0000-0001-5396-3749 and Maskell, Simon ORCID: 0000-0003-1917-2913
(2022) Novel Decision Forest Building Techniques by Utilising Correlation Coefficient Methods. In: Engineering Applications of Neural Networks.

[thumbnail of Novel_Decision_Forest_Building_Techniques_by_Utilising_Correlation_Coefficient_Methods.pdf] Text
Novel_Decision_Forest_Building_Techniques_by_Utilising_Correlation_Coefficient_Methods.pdf - Author Accepted Manuscript

Download (300kB) | Preview


Decision Forests have attracted the academic community’s interest mainly due to their simplicity and transparency. This paper proposes two novel decision forest building techniques, called Maximal Information Coefficient Forest (MICF) and Pearson’s Correlation Coefficient Forest (PCCF). The proposed new algorithms use Pearson’s Correlation Coefficient (PCC) and Maximal Information Coefficient (MIC) as extra measures of the classification capacity score of each feature. Using those approaches, we improve the picking of the most convenient feature at each splitting node, the feature with the greatest Gain Ratio. We conduct experiments on 12 datasets that are available in the publicly accessible UCI machine learning repository. Our experimental results indicate that the proposed methods have the best average ensemble accuracy rank of 1.3 (for MICF) and 3.0 (for PCCF), compared to their closest competitor, Random Forest (RF), which has an average rank of 4.3. Additionally, the results from Friedman and Bonferroni-Dunn tests indicate statistically significant improvement.

Item Type: Conference or Workshop Item (Unspecified)
Uncontrolled Keywords: Decision forests, Tree-based learning, Ensemble learning, Classification, Machine learning
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 11 May 2022 13:37
Last Modified: 10 Jun 2023 01:30
DOI: 10.1007/978-3-031-08223-8_8
Related URLs: