AbstractThe detection of spatial clusters, taking into account both spatial proximity and attribute similarity, plays a vital role in spatial data analysis. Although several dual clustering methods are currently available in the literature, most of them have detected homogeneous spatially adjacent clusters suffering from between‐cluster inhomogeneity and noise, where those spatial points have been described in the attribute domain. This article aims to accommodate both spatial proximity and attribute similarity with the presence of heterogeneity and noise. In this algorithm, Delaunay triangulation with edge‐length constraints, with consideration of arbitrary geometrical shapes, different densities, and spatial noise, is first utilized to construct spatial proximity relationships among points. Then, a clustering strategy employing information entropy is designed to identify clusters having similar attributes. The attribute clustering can adaptively and accurately detect clusters under the consideration of heterogeneity and noise. The efficacy and practicability of the proposed algorithm are illustrated by experiments employing both simulated datasets and real spatial point events.