Please use this identifier to cite or link to this item:
Title: Refinement of random forest
Authors: Deepika, Mathiyazhagan
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2018
Abstract: Random Forest is one of the most popular Machine learning algorithms. It is an ensemble of decision trees and each tree is built using an injection of randomness. The aim of this dissertation: “REFINEMENT OF RANDOM FOREST” is to develop a refined random forest algorithm using Random Vector Functional Link network as a split function to improve the performance. Random Forest has been successfully used in many data mining and computer vision tasks. Despite its immense success, it employs a greedy learning algorithm where locally-optimal decisions are made at each node. The progress of decision making at each node in random forest has been improvised by adapting Random vector functional link network. The random vector functional link network is used to split the decision nodes into two sub-nodes. The Refined Random forest algorithm has better performance as verified in extensive experiments.
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
  Restricted Access
Main article745.92 kBAdobe PDFView/Open

Page view(s) 5

checked on Oct 24, 2020

Download(s) 5

checked on Oct 24, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.