Optimal matching-score network with growth capability
A robust and optimal matching-score network is presented. The algorithm is based on a steepest descent training procedure. The net is capable of learning new patterns without recomputing the entire interconnection weight matrices. Simulation results are given to illustrate the strengths of the proposed design method.