mlsanityData to 13 Oct 2026

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

arXiv 2305.01539 ↗First posted 2 May 2023physics.comp-ph cs.LG physics.flu-dyncited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 7 of its 58 references that are in the map. First posted on arXiv 2 May 2023.

Builds on

7 of 58 references.

References · 7

  1. 2016Geometric deep learning: going beyond Euclidean datacited by 1,045
  2. 2021GRAND: Graph Neural Diffusioncited by 258
  3. 2016Accelerating Eulerian Fluid Simulation With Convolutional Networkscited by 129
  4. 2021Stiff Neural Ordinary Differential Equationscited by 77
  5. 2018Deep k-Means: Jointly clustering with k-Means and learning representationscited by 50
  6. 2019Enforcing Statistical Constraints in Generative Adversarial Networks for Modeling Chaotic Dynamical Systemscited by 33
  7. 2021Adversarial sampling of unknown and high-dimensional conditional distributionscited by 13

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.