Name
Abstract | ||
|---|---|---|
A novel technique for optimization of artificial neural network (ANN) weights which combines pruning and Genetic Algorithm (GA) has been proposed. The technique first defines "relevance" of initialized weights in a statistical sense by introducing a coefficient of dominance for each weight and subsequently employing the concept of complexity penalty. Based upon complexity penalty for each weight, candidate solutions are initialized to participate in the Genetic optimization. The GA stage employs mean square error as the fitness function which is evaluated once for all candidate solutions by running the forward pass of backpropagation. Subsequent reproduction cycles generate fitter individuals and the GA is terminated after a small number of cycles. It has been observed that ANNs trained with GA optimized weights exhibit higher convergence, lower execution time, and higher success rate in the test phase. Furthermore, the proposed technique yields substantial reduction in computational resources. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1080/08839514.2018.1525524 | APPLIED ARTIFICIAL INTELLIGENCE |
Field | DocType | Volume |
Convergence (routing),Small number,Computer science,Mean squared error,Algorithm,Fitness function,Artificial intelligence,Artificial neural network,Backpropagation,Machine learning,Genetic algorithm,Pruning | Journal | 33.0 |
Issue | ISSN | Citations |
1 | 0883-9514 | 0 |
PageRank | References | Authors |
0.34 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sakshi Sakshi | 1 | 0 | 0.34 |
| Ravi Kumar | 2 | 1 | 2.04 |