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

In this paper, a modified K-means algorithm is proposed to categorize a set of data into smaller clusters. K- means algorithm is a simple and easy clustering method which can efficiently separate a huge number of continuous numerical data with high-dimensions. Moreover, the data in each cluster are similar to one another. However, it is vulnerable to outliers and noisy data, and it spends much executive time in partitioning data too. Noisy data, outliers, and the data with quite different values in one cluster may reduce the accuracy rate of data clustering since the cluster center cannot precisely describe the data in the cluster. In this paper, a bi-level K-means algorithm is hence provided to solve the problems mentioned above. The bi-level K-means algorithm can give an expressive experimental results.

A Modified K-means Algorithms - Bi-Level K-Means Algorithm