An Ameliorative Parks Algorithm of Distance for Clustering Analysis

It is found that almost all the cluster analysis algorithms exist clustering blindness via our investigation. So the quality of clustering is reduced. Aimed at the problem, an ameliorative Parks algorithm of distance for clustering analysis is proposed in this paper, and it is also used in classify of shipping assembly. By the contrast of these two algorithms, the advantages of the new one are identified.