• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.409-412
• /
• 1997

In this paper, we propose a novel synthesis method of GBSB(Generalized BSB)-based neural autoassociative memories in which we analyze qualitative properties of GBSB model, recast a design problem of an associative memory to LMIP(Linear Matrix Inequality Problem), and optimize the LMIP using LMI techniques. The obtained memory satisfies many of the required properties of associative memories and has some peculiar properties. Comparing experimental results with those of others, we show its correctness and effectiveness.

• 한국지능시스템학회논문지
• /
• 제11권7호
• /
• pp.680-688
• /
• 2001

In this paper, we propose a reliable method for searching the optimally performing generalized brain-state-in-a-box (GBSB) neural associative memory using an evolution program (EP) given a set of prototype patterns to be stored as stable equilibrium points. First, we exploit some qualitative guidelines necessary to synthesize the GBSB model. Next, we parameterize the solution space utilizing the limited number of parameters to represent the solution space. Then, we recast the synthesis of GBSB neural associative memories as two constrained optimization problems, which are equivalent to finding a solution to the original synthesis problem. Finally, we employ an evolution program (EP), which enables us to find an optimal set of parameters related to the size of domains of attraction (DOA) for prototype patterns. The validity of this approach is illustrated by a design example and computer simulations.