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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

Spatial clustering is an important research topic in Spatial Data Mining (SDM). Although many methods have been proposed in the literature, very few have taken into account constraints that may be present in the data or constraints on the clustering. These constraints have significant influence on the results of the clustering process of large spatial data. In this paper, we propose a particle swarm optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). We first use the PSO algorithm based MAKLINK graph to obtain the best obstructed path and then propose a novel PSO and K-Medoids method for SCOC, which is called PKSCOC, to cluster spatial data with obstacles constraints. The PKSCOC algorithm can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints and practicalities of spatial clustering. The experimental results show that the PKSCOC algorithm is better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher convergence speed than Genetic K-Medoids SCOC (GKSCOC).

Spatial clustering with obstacles constraints using particle swarm optimization