wsrf
Weighted Subspace Random Forest for Classification
A parallel implementation of Weighted Subspace Random Forest. The Weighted Subspace Random Forest algorithm was proposed in the International Journal of Data Warehousing and Mining by Baoxun Xu, Joshua Zhexue Huang, Graham Williams, Qiang Wang, and Yunming Ye (2012) doi:10.4018/jdwm.2012040103. The algorithm can classify very high-dimensional data with random forests built using small subspaces. A novel variable weighting method is used for variable subspace selection in place of the traditional random variable sampling.This new approach is particularly useful in building models from high-dimensional data.
- Version1.7.30
- R versionunknown
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?Yes
- wsrf citation info
- Last release01/06/2023
Documentation
Team
He Zhao
Qinghan Meng
Show author detailsRolesAuthorGraham J. Williams
Junchao Lv
Show author detailsRolesAuthorBaoxun Xu
Show author detailsRolesAuthorJoshua Zhexue Huang
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Suggests4 packages
- Linking To1 package