arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.01400cs.LGcs.NAmath.NA
收藏

射流与高能炸药相互作用的时空代理模型:第二部分——对极高维网格数据进行聚类

Spatio-Temporal Surrogates for Interaction of a Jet with High Explosives: Part II -- Clustering Extremely High-Dimensional Grid-Based Data

Lawrence Livermore National Laboratory(劳伦斯利弗莫尔国家实验室)

Chandrika Kamath, Juliette S. Franzman

AI总结:

本文针对射流与高能炸药相互作用的极高维网格模拟数据,提出结合随机投影降维与迭代k-means的聚类方法,并利用随机性确定聚类数量,使百万级网格点的时空输出聚类变得可行。

摘要:

为计算机模拟的时空输出构建准确的代理模型是一项具有挑战性的任务。一种提高代理模型精度的简单方法是根据相似性对输出进行聚类,并为每个聚类构建单独的代理模型。当每个时间步的输出规模适中时,这种聚类相对直接。然而,当空间域由数百万个网格点表示时,数据的聚类就变得更加困难。在本报告中,我们考虑来自射流与高能炸药相互作用的模拟输出数据。这些数据可在不同大小的空间域上获得,其网格点的空间坐标各不相同,并且其格式在模拟的每个时间步将输出分布在多个文件中。我们首先描述如何在聚类之前将这些数据整理成一致的格式。借鉴数据挖掘中随机投影的思想,我们将数据维度降低了一千倍,从而使得使用迭代k-means方法进行聚类成为可能。我们展示了如何利用随机投影的随机性以及k-means聚类中初始质心选择的随机性来确定数据集中聚类的数量。尽管随机投影引入了近似,我们的方法仍使极高维数据的聚类变得可行,并为我们的问题生成了有意义的聚类分配。

英文摘要:

Building an accurate surrogate model for the spatio-temporal outputs of a computer simulation is a challenging task. A simple approach to improve the accuracy of the surrogate is to cluster the outputs based on similarity and build a separate surrogate model for each cluster. This clustering is relatively straightforward when the output at each time step is of moderate size. However, when the spatial domain is represented by a large number of grid points, numbering in the millions, the clustering of the data becomes more challenging. In this report, we consider output data from simulations of a jet interacting with high explosives. These data are available on spatial domains of different sizes, at grid points that vary in their spatial coordinates, and in a format that distributes the output across multiple files at each time step of the simulation. We first describe how we bring these data into a consistent format prior to clustering. Borrowing the idea of random projections from data mining, we reduce the dimension of our data by a factor of thousand, making it possible to use the iterative k-means method for clustering. We show how we can use the randomness of both the random projections, and the choice of initial centroids in k-means clustering, to determine the number of clusters in our data set. Our approach makes clustering of extremely high dimensional data tractable, generating meaningful cluster assignments for our problem, despite the approximation introduced in the random projections.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑