Skip to content

Density peaks clustering with spatiotemporal nearest neighbors

Sep 2026 · International journal of software engineering and knowledge engineering · 0 citations

TL;DR

STN-DPC performs well in terms of AMI, ARI, and FMI, and its application to the earthquake catalogue identifies three sequences with spatiotemporal associations.

Abstract

Density peaks clustering (DPC) encounters three limitations when applied to spatiotemporal data. Its local density estimate has limited capacity to distinguish samples drawn from regions with different densities, which can bias cluster center identification. Its distance measure emphasizes spatial information and may fail to separate clusters that are spatially close but temporally distinct. Its assignment strategy also lacks an explicit mechanism for anomalous samples, thereby reducing clustering accuracy. To address these limitations, a method termed density peaks clustering with spatiotemporal nearest neighbors (STN-DPC) is proposed. Separate sets of spatial and temporal K-nearest neighbors are constructed, and natural nearest neighbors are identified through mutual inclusion. Spatial and temporal base densities are then combined, while neighborhood support is weighted according to the number of natural nearest neighbors. This design improves density discrimination across heterogeneous local structures. Next, spatial and temporal average nearest neighbor distances are derived from nearest neighbor order. They correct distance shifts caused by scale differences between dimensions and limit the dominance of either dimension during cluster discrimination. Finally, a joint score is formed from the medians and median absolute deviations of local density and relative distance. Anomalous samples are identified from this score and removed from the clustering result. Experiments on the four synthetic datasets show that STN-DPC performs well in terms of AMI, ARI, and FMI, and its application to the earthquake catalogue identifies three sequences with spatiotemporal associations.

View source

Similar papers

Preprint Oct 2026

Gradient-Guided Density Peak Clustering

Density peak clustering (DPC) connects each observation to its nearest neighbor of higher density and identifies cluster centers as high-density observations with unusually large nearest neighbor uphill shifts. The resulting uphill paths from observations to cluster centers, however, can be irregular and unstable in lo...

Yikun Zhang, Yen-Chi Chen · 0 citations

Enhanced Density Peak Clustering for High-Dimensional Data

An Enhanced Density Peak Clustering (EDPC) method is proposed, which creatively incorporates multilayer perceptron (MLP)-based dimensionality reduction and a hierarchical label assignment strategy to improve clustering performance in high-dimensional scenarios.

Zhong-Li Wang, Jie Yang, Jun-Yi Guan et al. · 1 citation
Open access Aug 2026

Density-Peak-Based Clustering in Reduced Feature Spaces

This work proposed to use Regularised Multidimensional Scaling using Radial Basis Function (RBF-MDS) for dimension reduction, a multidimensional scaling that mitigates the impact of irrelevant or redundant features, enabling 2D/3D visualisation of clusters for interpretability.

Afsana Akter Setu, J. Singha, Sohana Jahan · 0 citations
Sep 2026

ADPOD: An outlier detection algorithm based on affinity density peak clustering

An outlier detection algorithm based on affinity density peak clustering (ADPOD) is proposed and it is demonstrated that the proposed algorithm significantly outperforms state-of-the-art competitors.

Zhongping Zhang, Hao-Yu Tian, Xin-Lei Zhao et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN) is introduced, a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity and is competitive with adaptive nearest-neighbor methods.

A. L. M. Levada · 0 citations
#machine learning Preprint Oct 2026

Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs

We introduce Round-Trip KNN Clustering (RTKNNC), a graph-based method for finding cluster structure at several neighbourhood scales without requiring the number of clusters in advance. Unlike approaches that first make a $k$-nearest-neighbour (KNN) graph undirected, RTKNNC keeps both directions of the neighbour relatio...

E. P. Marinho, C. Ranieri, Fabricio Aparecido Breve · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.