Xiyu Liu
Shandong Normal University

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

Tissue-like P system based DNA-GA for clustering Caiping Hou; Xiyu Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 3: December 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i3.pp565-573

Abstract

In recent years, DNA GA algorithm is drawing attention from scholars. The algorithm combines the DNA encoding and Genetic Algorithm, which solve the premature convergence of genetic algorithms, the weak local search capability and binary Hamming cliff problems effectively.How to design a more effective way to improve the performance of DNA-GA algorithm is more worth studying. As is known to all,the tissue-like P system can search for the optimal clustering partition with the help of its parallel computing advantage effectivel. This paper is under this premise and presents DNA-GA algorithm based on tissue-like P systems (TPDNA-GA) with a loop structure of cells, which aims to combine the parallelism and the evolutionary rules of tissue-like P systems to improve performance of the DNA-GA algorithm. The objective of this paper is to use the TPDNA-GA algorithm to support clustering in order to find the best clustering center.This algorithm is of particular interest to when dealing with large and heterogeneous data sets and when being faced with an unknown number of clusters. Experimental results show that the proposed TPDNA-GA algorithm for clustering is superior or competitive to classical k-means algorithm and several evolutionary clustering algorithms.
The K-Medoids Clustering Algorithm with Membrane Computing Yuzhen Zhao; Xiyu Liu; Hua Zhang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 4: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The K-medoids clustering algorithm is realized by a P system in this paper. Because the membrane system has great parallelism and lower computational time complexity, it is suitable for solving combinatorial problems like the clustering problem. A P system with all the rules to solve the K-medoids algorithm was constructed. The specific P system is associated with the dissimilarity matrix between n objects. This system can get one possible classifications in a non-deterministic way. Through example test, it is appropriate for cluster analysis. This is a new attempt in applications of membrane system and it provides new ideas and methods for cluster analysis. DOI: http://dx.doi.org/10.11591/telkomnika.v11i4.2383
A New P System Based Genetic Algorithm Caiping Hou; Xiyu Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 4, No 1: October 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v4.i1.pp165-168

Abstract

For the “early convergence” or the “genetic drift” of the genetic algorithm, this paper proposes a new genetic algorithm based on P system. Based on the parallel mechanism of P system in membrane computing, we put forward the new P system based genetic algorithm (PBGA). So that we can improve the performance of GA.