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 Plus

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

Zendy Tools

Zendy Open

The widespread adoption of intelligent devices has led to the generation of vast amounts of Global Positioning System (GPS) trajectory data. One of the significant challenges in this domain is to accurately identify stopping points from GPS trajectory data. Traditional clustering methods have proven ineffective in accurately identifying non-stopping points caused by trailing or round trips. To address this issue, this paper proposes a novel density peak clustering algorithm based on coherence distance, incorporating temporal and entropy constraints, referred to as the two-step DPCC-TE. The proposed algorithm introduces a coherence index to integrate spatial and temporal features, and imposes temporal and entropy constraints on the clusters to mitigate local density increase caused by slow-moving points and back-and-forth movements. Moreover, to address the issue of interactions between subclusters after one-step clustering, a two-step clustering algorithm is proposed based on the DPCC-TE algorithm. Experimental results demonstrate that the proposed two-step clustering algorithm outperforms the DBSCAN-TE and one-step DPCC-TE methods, and achieves an accuracy of 95.49% in identifying stopping points.

Identification of Stopping Points in GPS Trajectories by Two-Step Clustering Based on DPCC with Temporal and Entropy Constraints