This study proposes a novel method to calculate the density of the data points based on K-nearest neighbors and Shannon entropy. A variant of tissue-like P systems with active membranes is introduced to realize the clustering process. The new variant of tissue-like P systems can improve the efficiency of the algorithm and reduce the computation complexity. Finally, experimental results on synthetic and real-world datasets show that the new method is more effective than the other state-of-the-art clustering methods.

As a non-invasive diagnostic tool, Magnetic Resonance Imaging (MRI) has been widely used in the field of brain imaging. The classification of MRI brain image conditions poses challenges both technically and clinically, as MRI is primarily used for soft tissue anatomy and can generate large amounts of detailed information about the brain conditions of a subject. To classify benign and malignant MRI brain images, we propose a new method. Discrete wavelet transform (DWT) is used to extract wavelet coefficients from MRI images. Then, Tsallis entropy with DNA genetic algorithm (DNA-GA) optimization parameters (called DNAGA-TE) was used to obtain entropy characteristics from DWT coefficients. At last, DNA-GA optimized support vector machine (called DNAGA-KSVM) with radial basis function (RBF) kernel, is applied as a classifier. In our experimental procedure, we use two kinds of images to validate the availability and effectiveness of the algorithm. One kind of data is the Simulated Brain Database and another kind of image is real MRI images which downloaded from Harvard Medical School website. Experimental results demonstrate that our method (DNAGA-TE+KSVM) obtained better classification accuracy.

No abstract

An extended membrane system using a tissue-like P system with evolutional symport/antiport rules and a promoter/inhibitor, which is based on the evolutionary mechanism of quantum-behaved particle swarm optimization (QPSO) and improved QPSO, named CQPSO-ETP, is designed and developed in this paper. The purpose of CQPSO-ETP is to enhance the optimization performance of statistical network structure-based membrane-inspired evolutionary algorithms (SNS-based MIEAs) and the QPSO technique. In CQPSO-ETP, evolution rules with a promoter based on a standard QPSO mechanism are introduced to evolve objects, and evolution rules with an inhibitor based on an improved QPSO mechanism using self-adaptive selection, and cooperative evolutionary and logistic chaotic mapping methods, are adopted to avoid prematurity. The communication rules with a promoter/inhibitor for objects are introduced to achieve the exchange and sharing of information between different membranes. Under the control of the evolution and communication mechanism, the CQPSO-ETP can effectively improve the performance with the help of a distributed parallel computing model. The proposed CQPSO-ETP is compared with PSO, QPSO and two existing improved QPSO approaches which are conducted on eight classic numerical benchmark functions to verify the effectiveness. Furthermore, computational experiments which are made on eight tested images with three comparative clustering approaches are adopted, and the experimental results demonstrate the clustering validity of the proposed CQPSO-ETP.

Spectral clustering has become very popular in recent years, due to the simplicity of its implementation as well as the performance of the method, in comparison with other popular ones. But many studies show that clustering results are sensitive to the selection of the similarity graph and its parameters, e.g. [Formula: see text] and [Formula: see text]. To address this issue, inspired by density sensitive similarity measure, we propose an improved spectral graph clustering method that utilizes the similarity measure based on data density combined with DNA genetic algorithms (ISC-DNA-GA), making it increase the distance of the pairs of data in the high density areas, which are located in different spaces. The method can reduce the similarity degree among the pairs of data in the same density region to find the spatial distribution characteristics of the complex data. After computing the Laplacian matrix, we apply DNA-GAs to obtain the clustering centroids and assign all of the points to the centroids, so as to achieve better clustering results. Experiments have been conducted on the artificial and real-world datasets with various multi-dimensions, using evaluation methods based on external clustering criteria. The results show that the proposed method improves the spectral clustering quality, and it is superior to those competing approaches.

No abstract

No abstract

In this paper, a data clustering method named consensus fuzzy k-modes clustering is proposed to improve the performance of the clustering for the categorical data. At the same time, the coupling DNA-chain-hypergraph P system is constructed to realize the process of the clustering. This P system can prevent the clustering algorithm falling into the local optimum and realize the clustering process in implicit parallelism. The consensus fuzzy k-modes algorithm can combine the advantages of the fuzzy k-modes algorithm, weight fuzzy k-modes algorithm and genetic fuzzy k-modes algorithm. The fuzzy k-modes algorithm can realize the soft partition which is closer to reality, but treats all the variables equally. The weight fuzzy k-modes algorithm introduced the weight vector which strengthens the basic k-modes clustering by associating higher weights with features useful in analysis. These two methods are only improvements the k-modes algorithm itself. So, the genetic k-modes algorithm is proposed which used the genetic operations in the clustering process. In this paper, we examine these three kinds of k-modes algorithms and further introduce DNA genetic optimization operations in the final consensus process. Finally, we conduct experiments on the seven UCI datasets and compare the clustering results with another four categorical clustering algorithms. The experiment results and statistical test results show that our method can get better clustering results than the compared clustering algorithms, respectively.