Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

University of Mississippi

Electronic Theses and Dissertations

2019

Computer science

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Improving Random Forests By Feature Dependence Analysis, Silu Zhang Jan 2019

Improving Random Forests By Feature Dependence Analysis, Silu Zhang

Electronic Theses and Dissertations

Random forests (RFs) have been widely used for supervised learning tasks because of their high prediction accuracy good model interpretability and fast training process. However they are not able to learn from local structures as convolutional neural networks (CNNs) do when there exists high dependency among features. They also cannot utilize features that are jointly dependent on the label but marginally independent of it. In this dissertation we present two approaches to address these two problems respectively by dependence analysis. First a local feature sampling (LFS) approach is proposed to learn and use the locality information of features to group …