Abstract

Two efficient strategies are proposed for improving the eigenstructure method from the best approximation projector point of view. Interpreted as two complementary best approximation projectors, the method is reformulated in a much more simplified form. We develop a new synthesis procedure through constructing the related best approximation projectors by using a simple recursive formula, which improves on the existing eigenstructure method not only in the significant reduction of the computational complexity but also in the incorporation of the learning capability comparable to the outer product method. The networks designed by the present procedure outperform those designed by some other known methods. We also propose a new forgetting algorithm for deleting any specific existing memories in a synthesized network. The algorithm performs efficiently and reliably, which particularly eliminates the overforgetting drawback of the Yen-Michel algorithm (1991, 1992). The feasibility and effectiveness of the algorithm are supported by theoretical analysis and computer simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call