Random Forest Improvement Method Based on Feature Importance

Decision tree-based random forest algorithms can efficiently process multi-source heterogeneous data, accurately predict complex hydrological processes, and optimize power plant operation decisions. At the same time, it has the ability to resist noise interference and analyze feature importance, providing intelligent management of water conservancy and hydropower systems. However, when the proportion of highly informative features in a dataset is low, the performance of traditional random forests drops significantly. To overcome this problem, this paper propose a random forest improvement method based on feature importance. In this method, we first screen out the important features and calculate the importance weights, then construct a certain number of random subspaces based on the weights, and finally dynamically adjust the weights and construct new random subspaces based on the sliding window. The experimental results show that the model proposed in this paper is better than the traditional random forest model.

Authors

Institutions

Publication Details

Published
2025-08-08
DOI
https://doi.org/10.1109/iaeac65194.2025.11165959
Primary Topic
Evaluation Methods in Various Fields
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Random Forest Improvement Method Based on Feature Importance

Zaifeng Zhang, Hui Jia, Haifeng Guo
Evaluation Methods in Various Fields
article

Random Forest Improvement Method Based on Feature Importance

Zaifeng Zhang, Hui Jia, Haifeng Guo
article en

Abstract

Decision tree-based random forest algorithms can efficiently process multi-source heterogeneous data, accurately predict complex hydrological processes, and optimize power plant operation decisions. At the same time, it has the ability to resist noise interference and analyze feature importance, providing intelligent management of water conservancy and hydropower systems. However, when the proportion of highly informative features in a dataset is low, the performance of traditional random forests drops significantly. To overcome this problem, this paper propose a random forest improvement method based on feature importance. In this method, we first screen out the important features and calculate the importance weights, then construct a certain number of random subspaces based on the weights, and finally dynamically adjust the weights and construct new random subspaces based on the sliding window. The experimental results show that the model proposed in this paper is better than the traditional random forest model.

Xinjiang Institute of Engineering (CN)
Openalex Percentile: Top 85%
Evaluation Methods in Various Fields
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.