2011 MiningDatawithRandomForestsASur

• (Verikas et al., 2011) ⇒ Antanas Verikas, Adas Gelzinis, and Marija Bacauskiene. (2011). “Mining Data with Random Forests: A Survey and Results of New Tests.” In: Pattern Recognition Journal, 44(2). doi:10.1016/j.patcog.2010.08.011

Subject Headings: Random Forests Algorithm.

Cited By

• http://scholar.google.com/scholar?q=%222011%22+Mining+Data+with+Random+Forests%3A+A+Survey+and+Results+of+New+Tests
• http://dl.acm.org/citation.cfm?id=1872072.1872190&preflayout=flat#citedby

Quotes

Abstract

Random forests (RF) has become a popular technique for classification, prediction, studying variable importance, variable selection, and outlier detection. There are numerous application examples of RF in a variety of fields. Several large scale comparisons including RF have been performed. There are numerous articles, where variable importance evaluations based on the variable importance measures available from RF are used for data exploration and understanding. Apart from the literature survey in RF area, this paper also presents results of new tests regarding variable rankings based on RF variable importance measures. We studied experimentally the consistency and generality of such rankings. Results of the studies indicate that there is no evidence supporting the belief in generality of such rankings. A high variance of variable importance evaluations was observed in the case of small number of trees and small data sets.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2011 MiningDatawithRandomForestsASur	Antanas Verikas Adas Gelzinis Marija Bacauskiene			Mining Data with Random Forests: A Survey and Results of New Tests				10.1016/j.patcog.2010.08.011		2011