DBSCAN在具有周期性边界条件的域中的应用
DBSCAN in domains with periodic boundary conditions
AI总结:
针对周期性边界条件下的数据聚类问题,提出一种基于DBSCAN的算法,利用开放域实现保持O(N log N)复杂度,并在合成数据及湍流气泡聚类中验证。
摘要:
许多科学问题涉及嵌入在具有周期性边界条件的空间中的数据。这例如可能与数据中固有的循环或旋转对称性,或空间扩展的周期性有关。在分析此类数据时,需要量身定制的方法来获得遵守问题周期性边界条件的有效方法。在这项工作中,我们提出了一种基于DBSCAN算法(一种广泛使用的无监督机器学习方法,用于识别数据中的聚类)将聚类算法应用于嵌入在周期性域中的数据的方法。所提出的方法在内部利用传统的DBSCAN算法处理具有开放边界的域,从而与开放域中邻域搜索的所有优化实现保持兼容。这样,它保留了相同的优化运行时间复杂度$O(N\log N)$。我们使用一维、二维和三维的合成数据演示了所提出方法的运作,并将其应用于涉及湍流中气泡聚类的真实世界示例。所提出的方法已在一个即用型Python包中实现,我们公开提供该包。
英文摘要:
Many scientific problems involve data that is embedded in a space with periodic boundary conditions. This can for instance be related to an inherent cyclic or rotational symmetry in the data or a spatially extended periodicity. When analyzing such data, well-tailored methods are needed to obtain efficient approaches that obey the periodic boundary conditions of the problem. In this work, we present a method for applying a clustering algorithm to data embedded in a periodic domain based on the DBSCAN algorithm, a widely used unsupervised machine learning method that identifies clusters in data. The proposed method internally leverages the conventional DBSCAN algorithm for domains with open boundaries, such that it remains compatible with all optimized implementations for neighborhood searches in open domains. In this way, it retains the same optimized runtime complexity of $O(N\log N)$. We demonstrate the workings of the proposed method using synthetic data in one, two and three dimensions and also apply it to a real-world example involving the clustering of bubbles in a turbulent flow. The proposed approach is implemented in a ready-to-use Python package that we make publicly available.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。