English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

<p>An optimized initial center of K-means algorithm(PKM) is proposed, which select the k furthest distance data in the high-density area as the initial cluster centers. Experiments show that the algorithm not only has a weak dependence on the initial data, but also has fast convergence and high clustering quality. To obtain effective cluster and accurate cluster, we combine the optimized K-means algorithm(PKM) and genetic algorithm into a hybrid algorithm (PGKM). It can not only improve compactness and separation of the algorithm but also automatically search for the best cluster number k, then cluster after optimizing the k-centers. The optimal cluster is not obtained until terminal conditions are met after continuously iterating. Experiments show that the algorithm has good cluster quality and overall performance.</p

A Genetic K-means Clustering Algorithm Based on the Optimized Initial Centers