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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Detecting Detecting the boundary of each cluster in a data set is a tough problem for many existed boundary detecting algorithms. In order to solve that problem, a clustering boundary detecting algorithm based on DBSCAN named BDAEC(Boundary Detecting Algorithm for Each Cluster based on DBSCAN: BDAEC) is proposed . Firstly, according to the core point percent and the density value of each data object, all the core points are extracted by this algorithm from the data set. Then, many connected undirected graphs will be constituted by these core points. And the cluster numbers of the data set can be known by those connected undirected graphs for each one of them represents a cluster. Finally, Eps field will be diveded into two fields: the positive field and the negative field. And the boundary of each cluster or the whole data set can be detected by the distribution characteristics of the data objects which are located in the positive field and negative field of the given data object. The experimental results on many data sets with noise show that BDAEC algorithm can obtain the numbers and the boundaries of the clusters with different size or shapes effectively.