Name
Title | ||
|---|---|---|
Combinatorial optimization of input features and learning parameters for decorrelated neural network ensemble-based soft measuring model. |
Abstract | ||
|---|---|---|
The decorrelated neural network ensemble (DNNE) algorithm can be used to construct an effective soft measuring model through an analytical solution comprising submodels of multiple randomized neural networks. However, DNNE exhibits one major shortcoming: the scope of the random input weights and biases is set to a default range of [-1, 1], which cannot ensure the universal approximation capability of the resulting prediction model. The three other learning parameters including the number of the ensemble submodels' hidden nodes, ensemble size, and regularizing factor of DNNE are also data dependent. Moreover, DNNE suffers from high computation complexity when processing a high-dimensional large-scale dataset. Feature selection can improve the interpretation of the model. To address the above-mentioned problems, a combinatorial optimization method based on the adaptive genetic algorithm is used to simultaneously optimize the input features and learning parameters of the DNNE model. The evolution processes of these modeling parameters are demonstrated in detail. Simulation results based on four datasets with different dimensions and sizes validate the effectiveness of the proposed approach. The results also indicate that the random parameter scope assignment significantly influences the generalization performance and the other learning parameters of the prediction model. (c) 2017 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.neucom.2017.09.078 | NEUROCOMPUTING |
Keywords | Field | DocType |
Decorrelated neural network ensembles (DNNE),Adaptive genetic algorithm (AGA),Random parameter scope assignment,Combinatorial optimization | Pattern recognition,Feature selection,Computer science,Data dependent,Combinatorial optimization,Artificial intelligence,Artificial neural network,Genetic algorithm,Computation complexity,Machine learning | Journal |
Volume | ISSN | Citations |
275 | 0925-2312 | 0 |
PageRank | References | Authors |
0.34 | 24 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Tang | 1 | 526 | 148.30 |
| Jun-Fei Qiao | 2 | 69 | 15.62 |
| Jian Zhang | 3 | 11 | 2.54 |
| Zhiwei Wu | 4 | 3 | 1.46 |
| Tianyou Chai | 5 | 2014 | 175.55 |
| Wen Yu | 6 | 399 | 31.69 |