Hyperparameter importance analysis based on N-RReliefF algorithm

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Hyperparameter selection has always been the key to machine learning. The Bayesian optimization algorithm has recently achieved great success, but it has certain constraints and limitations in selecting hyperparameters. In response to these constraints and limitations, this paper proposed the N-RReliefF algorithm, which can evaluate the importance of hyperparameters and the importance weights between hyperparameters. The N-RReliefF algorithm estimates the contribution of a single hyperparameter to the performance according to the influence degree of each hyperparameter on the performance and calculates the weight of importance between the hyperparameters according to the improved normalization formula. The N-RReliefF algorithm analyses the hyperparameter configuration and performance set generated by Bayesian optimization, and obtains the important hyperparameters in random forest algorithm and SVM algorithm. The experimental results verify the effectiveness of the N-RReliefF algorithm.

Cite

CITATION STYLE

APA

Sun, Y., Gong, H., Li, Y., & Zhang, D. (2019). Hyperparameter importance analysis based on N-RReliefF algorithm. International Journal of Computers, Communications and Control, 14(4), 557–573. https://doi.org/10.15837/ijccc.2019.4.3593

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free