2005Jisuanji gongchengRequires access

Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship

She Xiang-yang

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Adjacency list, Adjacency matrix, Cluster analysis, Computer science, Algorithm, Genetic algorithm, Planar, Data mining

Related papers

Back to paper searchBrowse research topicsOriginal source
Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship — Research Paper | ScholarLens