Jacobian-Scaled K-means Clustering for Physics-Informed Segmentation of Reacting Flows

by   Shivam Barwey, et al.

This work introduces Jacobian-scaled K-means (JSK-means) clustering, which is a physics-informed clustering strategy centered on the K-means framework. The method allows for the injection of underlying physical knowledge into the clustering procedure through a distance function modification: instead of leveraging conventional Euclidean distance vectors, the JSK-means procedure operates on distance vectors scaled by matrices obtained from dynamical system Jacobians evaluated at the cluster centroids. The goal of this work is to show how the JSK-means algorithm – without modifying the input dataset – produces clusters that capture regions of dynamical similarity, in that the clusters are redistributed towards high-sensitivity regions in phase space and are described by similarity in the source terms of samples instead of the samples themselves. The algorithm is demonstrated on a complex reacting flow simulation dataset (a channel detonation configuration), where the dynamics in the thermochemical composition space are known through the highly nonlinear and stiff Arrhenius-based chemical source terms. Interpretations of cluster partitions in both physical space and composition space reveal how JSK-means shifts clusters produced by standard K-means towards regions of high chemical sensitivity (e.g., towards regions of peak heat release rate near the detonation reaction zone). The findings presented here illustrate the benefits of utilizing Jacobian-scaled distances in clustering techniques, and the JSK-means method in particular displays promising potential for improving former partition-based modeling strategies in reacting flow (and other multi-physics) applications.


page 3

page 4

page 14

page 15

page 17


Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases

Nonlinear model order reduction has opened the door to parameter optimiz...

Parameterized k-Clustering: The distance matters!

We consider the k-Clustering problem, which is for a given multiset of n...

An implementation of the relational k-means algorithm

A C# implementation of a generalized k-means variant called relational k...

On the Persistence of Clustering Solutions and True Number of Clusters in a Dataset

Typically clustering algorithms provide clustering solutions with prespe...

k-sums: another side of k-means

In this paper, the decades-old clustering method k-means is revisited. T...

Unsupervised classification of fully kinetic simulations of plasmoid instability using Self-Organizing Maps (SOMs)

The growing amount of data produced by simulations and observations of s...

Dr. KID: Direct Remeshing and K-set Isometric Decomposition for Scalable Physicalization of Organic Shapes

Dr. KID is an algorithm that uses isometric decomposition for the physic...

Please sign up or login with your details

Forgot password? Click here to reset