Research And Application Of Improved Minimum Spanning Tree Clustering Algorithm Based On Membrane Computing

Inspired by the structure and function of living cells in living organisms,Gh.P?un proposed a membrane system.P system has attracted attention of the majority of scholars since its introduction.And membrane computing based on it becomes a new field of research in natural computing.Because the membrane system is abstracted from biological cells,it has the characteristics of distributed and great parallelism.What is more,it can overcome the shortcomings of serial computing,then improve the efficiency of the calculation greatly.Through formal language study,it is found that the computational power of the membrane computing is equivalent to that of the Turing machine,thus demonstrating that the functions that can be calculated intuitively can also be calculated by membrane computing.The P systems can not only simulate the cell systems realistically,but also can establish and analyze the models and solve the problems encountered in practical applications.With the deepening of research,membrane computing has made some progress in economics,cryptography,power system diagnosis,and designing mobile robot controllers.And it shows great development space.Clustering is an important part of data mining and knowledge discovery,and it is an effective way to process analytic data.There are multiple methods for clustering.Each of these methods has its own advantages and disadvantages.They achieve ideal clustering results in different situations.The minimum spanning tree algorithm can find clusters of irregularly bordered clusters.It uses the geometry of the minimum spanning tree and the nature of graph theory effectively and reasonably.In the research,it was found that this kind of algorithm is slow in constructing the minimum spanning tree of the data set,thus making the efficiency of the entire algorithm lower.Therefore,the MST clustering algorithm deserves our further discussion and research.The main work of this paper is as follows: Firstly,the research background and domestic and foreign research status of membrane computing and clustering algorithms are analyzed.Secondly,the theoretical foundations of membrane computing and other theoretical foundations are briefly introduced.Then a new tissue-like P Systems is proposed.We have added rule control factors to control the order in which the rules are implemented and to optimize the rule execution process,thereby improving the system's operational efficiency.Thirdly,combine the minimum spanning tree algorithm with the tissue-like P system.When constructing the minimum spanning tree,the maximum parallelism of the membrane system is used to make the MST algorithm performance better.Then minimum spanning tree algorithm is used to solve K shortest path problem,and it is combined with CF tissue-like P system.Finally,the minimum spanning tree algorithm based on the CF tissue-like P system was applied to the urbanization development in the cities of Shandong Province.Then we get urban clusters with similar development levels to provide opinions and suggestions for the development of urbanization.