A Cluster Splitting Technique by Hopfield Networks and P Systems on Simplices

摘要

In this paper we propose a new graph based P system. The main feature of graph P system is that membrane compartments spread on edges as well as on vertices. These two kinds of compartments are topologically connected with certain communication rules. A new neural computing technique is proposed to solve cluster splitting into finding the equilibrium of Hopfield neural networks. Then we use the new graph P systems to obtain stable status of the neural networks. An example is presented to show the computing efficiency of the new P system with comparison with classical genetic algorithms.