On dynamic selection of subspace for random forest

Md Nasim Adnan

Research output: Book chapter/Published conference paperConference paperpeer-review

5 Citations (Scopus)


Random Forest is one of the most popular decision forest building algorithms that use decision trees as the base classifiers. The splitting attributes for decision trees of Random Forest are generally determined from a predefined number of randomly selected attribute subset of the original attribute set. In this paper, we propose a new technique that randomly determines the size of the attribute subset between a dynamically determined range based on the relative size of current data segment to the bootstrap samples at each node splitting event. We present elaborate experimental results involving five widely used data sets from the UCI Machine Learning Repository. The experimental results indicate the effectiveness of the proposed technique in the context of Random Forest.
Original languageEnglish
Title of host publicationADMA 2014
EditorsX. Luo, J.X. Yu, Z. Li
Place of PublicationCham, USA
Number of pages10
ISBN (Electronic)9783319147178
Publication statusPublished - 2014
EventInternational Conference on Advanced Data Mining and Applications - Guangxi Normal University, Guilin
Duration: 19 Dec 201421 Dec 2014


ConferenceInternational Conference on Advanced Data Mining and Applications

Fingerprint Dive into the research topics of 'On dynamic selection of subspace for random forest'. Together they form a unique fingerprint.

Cite this