Solving the CLM Problem by Discrete-Time Linear Threshold Recurrent Neural Networks
The competitive layer model (CLM) can be described by the optimization problem that is formulated with the CLM energy function. The minimum points of CLM energy function can be achieved by running some proper recurrent neural networks. In other words, the CLM can be implemented by the recurrent neural networks. This paper proposes the discrete-time linear threshold recurrent networks to solve the CLM problem. The conditions for the stable attractors of the networks are obtained, which just correspond to the conditions of the minimum points of CLM energy function established in the literature before. Therefore, the proposed network can be used to implement the CLM.
Unable to display preview. Download preview PDF.
- 1.Ritter, H.: A Spatial Approach for Feature Linking. In: Proc. Int. Neural Networks Conf., Paris, vol. 2, pp. 898–901 (1990)Google Scholar
- 4.Yi, Z.: Foundations of Implementing the Competitive Layer Model by Lotka-Volterra Recurrent Neural Networks. Conditionally Accepted by IEEE Trans. Neural Networks (2009)Google Scholar
- 8.Goldberg, J.L.: Matrix Theory with Applications. McGraw-Hill, New York (1992)Google Scholar