Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship
满足二维空间邻接条件的遗传聚类算法研究

The shortcomings about these days clustering algorithm considering the condition of planar adjacency relationship are analysised.The clustering algorithm considering the condition of planar adjacency relationship is defined again newly from the general clustering.In order to dealing with the clustering considering the condition of planar adjacency relationship,the concept adjacency matrix is defined.The genetic-clustering algorithm considering the condition of planar adjacency relationship is put forward,partitioning samples on the best-close distance and adjacency matrix,calculating cluster aim function on within-group sum of squares(WGSS) error,importing genetic algorithm.The algorithm is validated and compared with the FCM clustering outcome by examples.Algorithm testing show: the genetic-clustering algorithm considering the condition of planar adjacency relationship is completely feasible and availability.