Classification using Probabilistic Random Forest

Gondane, Rajhans and Devi, Susheela V (2015) Classification using Probabilistic Random Forest. In: IEEE Symposium Series Computational Intelligence, DEC 07-10, 2015, Cape Town, SOUTH AFRICA, pp. 174-179.

PDF IEEE_SSCI_174_2015.pdf - Published Version Restricted to Registered users only Download (224kB) | Request a copy

Abstract

The Probabilistic random forest is a classification model which chooses a subset of features for each random forest depending on the F-score of the features. In other words, the probability of a feature being chosen in the feature subset increases as the F-score of the feature in the dataset. A larger F-score of feature indicates that feature is more discriminative. The features are drawn in a stochastic manner and the expectation is that features with higher F-score will be in the feature subset chosen. The class label of patterns is obtained by combining the decisions of all the decision trees by majority voting. Experimental results reported on a number of benchmark datasets demonstrate that the proposed probabilistic random forest is able to achieve better performance, compared to the random forest.

Item Type:	Conference Proceedings
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation Others
Date Deposited:	08 Oct 2016 06:47
Last Modified:	08 Oct 2016 06:47
URI:	http://eprints.iisc.ac.in/id/eprint/54783

Actions (login required)

View Item