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

Clustering problems with the similarity measure defined by the L1-norm are studied. Characterizations of different stationary points of these problems are given using their difference of convex representations. An algorithm for finding the Clarke stationary points of the clustering problems is designed and a clustering algorithm is developed based on it. The clustering algorithm finds a center of a data set at the first iteration and gradually adds one cluster center at each consecutive iteration. The proposed algorithm is tested using large real world data sets and compared with other clustering algorithms.

A DC Optimization Algorithm for Clustering Problems with $𝑳_𝟏$-norm