Density-based clustering algorithm for associating transformers with smart meters via GPS-AMI data
Not Available
42 ENGINEERING↗
SEARCH · Search NASA
Results for “Density-based clustering”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning
Atom probe tomography (APT) has enabled the direct visualization of solute clusters, providing valuable insights into material structures. This clustering is crucial for understanding the nanoscale composition and behavior of materials, which can significantly influence their mechanical and physical properties. However, the widely used clustering methods in the APT community face challenges such as subjective parametric selection and limited applicability, particularly in dealing with overlapping clusters, nested clusters, and artifacts across different scales, such as precipitates and dislocations. To address these challenges, we present a framework based on density-based cluster analysis that aims to be less dependent on user input, reproducible, and robust.
Density-based clustering↗
From Points to Planes: A Workflow for Converting Three‐Dimensional Point Cloud Data Into Discrete Fracture Network Flow and Transport Models
We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.
54 ENVIRONMENTAL SCIENCES↗
Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs
DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.
Prokopenko, Andrey↗
Calibrating LArPix for TinyTPC
LArTPCs provide sensitivity to GeV signals, such as accelerator neutrinos and part of the supernova neutrino spectrum. TinyTPC is a LArTPC test stand for R&D of LAr doping to expand the reach of LArTPCs down to the 1-10 MeV range, which would substantially enhance the flagship analyses of experiments like DUNE, while enabling low energy analyses. We aim to dope LAr with Xe and pho- tosensitive dopants to expand the LArTPC range by converting hard-to-detect scintillation light to efficiently detected ionization charge. A critical element of the data analysis in TinyTPC is calibrating the readout. This poster will cover the calibration of TinyTPC, a pixelated liquid argon detector, where we find the distance a muon travels through each pixel. We then calculate the energy loss of muons traveling through the detector from cosmic data. We can reconstruct the path of the particles through the TPC using a density-based clustering algorithm designed to sort straight cosmic muon tracks from low energy radioactive decay curled paths and electronic noise
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
sOPTICS: a modified density-based algorithm for identifying galaxy groups/clusters and brightest cluster galaxies
A direct approach to studying the galaxy–halo connection is to analyse groups and clusters of galaxies that trace the underlying dark matter haloes, emphasizing the importance of identifying galaxy clusters and their associated brightest cluster galaxies (BCGs). In this work, we test and propose a robust density-based clustering algorithm that outperforms the traditional Friends-of-Friends (FoF) algorithm in the currently available galaxy group/cluster catalogues. Our new approach is a modified version of the Ordering Points To Identify the Clustering Structure (OPTICS) algorithm, which accounts for line-of-sight positional uncertainties due to redshift space distortions by incorporating a scaling factor, and is thereby referred to as sOPTICS. When tested on both a galaxy group catalogue based on semi-analytic galaxy formation simulations and observational data, our algorithm demonstrated robustness to outliers and relative insensitivity to hyperparameter choices. In total, we compared the results of eight clustering algorithms. The proposed density-based clustering method, sOPTICS, outperforms FoF in accurately identifying giant galaxy clusters and their associated BCGs in various environments with higher purity and recovery rate, also successfully recovering 115 BCGs out of 118 reliable BCGs from a large galaxy sample. Furthermore, when applied to an independent observational catalogue without extensive re-tuning, sOPTICS maintains high recovery efficiency, confirming its flexibility and effectiveness for large-scale astronomical surveys.
79 ASTRONOMY AND ASTROPHYSICS↗
VoroClust
SAND2025-11465O VoroClust, also known as Voronoi Clustering, is a fast, density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. It operates as quickly as distance-based clustering methods while effectively capturing complex regional geometries, matching the performance of current density-based methods. VoroClust employs a data-centered sphere cover to reduce computational demands while preserving data topology. It propagates clusters outward from local density peaks. Although supervised machine learning is powerful for applications like image classification and segmentation, it requires comprehensive, consistent datasets, which many applications lack. Unsupervised clustering algorithms analyze the structure of each dataset rather than relying on similarities with other examples, making them well-suited for practical applications with insufficient or inappropriate data for supervised learning. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Ebeida, Mohamed [Sandia National Lab. (SNL-CA), Li↗
A bi-level spatiotemporal clustering approach and its application to drought extraction
We present a novel flexible bi-level spatiotemporal clustering algorithm to extract events based on their intensity and spatiotemporal structures. Our algorithm consists of using (i) a novel space-time k-means clustering to obtain spatiotemporally coherent intensity clusters, and (ii) a density-based spatial clustering of applications with noise (DBSCAN) to spatiotemporally section the intensity clusters into individual events. We discuss the development of the algorithm, the selection, tuning and meaning of the parameters within each step, as well as its validation. Finally, we apply the algorithm to a spatiotemporal drought index, standardized vapor pressure deficit drought index (SVDI), over the continental United States (US) from 1980–2021 and show that it captures historical drought events over the continental United States and their spatiotemporal extents.
17 WIND ENERGY↗
Synchronization and Rebound Effects in Residential Loads
Increasing fuel prices and capacity investment deferral place an increasing demand for peak reduction from distribution level systems. Residential and commercial devices, such as HVAC systems and water heaters, are increasingly involved in load control programs, and their use may generate synchronization and rebound effects, such as artificial peaks caused by device optimization. While there have been concerns over device synchronization, few studies quantify the extent of this effect with numerical values. In this study, we attempt to investigate whether control efforts result in device synchronization or rebound effects. We focus on three clustering methods – Ward’s clustering, Euclidean K-means, and Density-based spatial clustering of applications with noise – to evaluate the extent of synchronization of a fleet of water heaters and HVAC systems in Atlanta, Georgia. Our findings show that synchronization and rebound effects are present in the neighborhood’s water heaters, but none were found in the HVAC systems. Further, high usage water heaters are more susceptible to synchronization and rebound effects.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Formation and Reconnection of Electron Scale Current Layers in the Turbulent Outflows of a Primary Reconnection Site
We simulate with 3D particle in cell, the spontaneous formation of turbulent outflows in an initially laminar 3D reconnecting current layer. We observe the formation of many secondary current layers and reconnection sites in the outflow. The approach we follow is to study each individual feature within the turbulent outflow. To identify all clusters of current in the outflow we use a clustering technique widely used in unsupervised machine learning: density-based spatial clustering of applications with noise. Once the clusters are identified we measure their size and compute reconnection indicators to establish which are undergoing reconnection. With this analysis we establish that the size of the current clusters reaches all the way from its initial system scale down to subelectron skin depth scale. We observe that the smaller current clusters are more prone to reconnecting and to releasing energy. We then find the process of reconnection of the smaller current cluster to be of the recently observed electron-only type that leaves the ions essentially unaffected.
79 ASTRONOMY AND ASTROPHYSICS↗
Advances in ArborX to support exascale applications
ArborX is a performance portable geometric search library developed as part of the Exascale Computing Project (ECP). In this paper, we explore a collaboration between ArborX and a cosmological simulation code HACC. Large cosmological simulations on exascale platforms encounter a bottleneck due to the in-situ analysis requirements of halo finding, a problem of identifying dense clusters of dark matter (halos). This problem is solved by using a density-based DBSCAN clustering algorithm. With each MPI rank handling hundreds of millions of particles, it is imperative for the DBSCAN implementation to be efficient. In addition, the requirement to support exascale supercomputers from different vendors necessitates performance portability of the algorithm. We describe how this challenge problem guided ArborX development, and enhanced the performance and the scope of the library. We explore the improvements in the basic algorithms for the underlying search index to improve the performance, and describe several implementations of DBSCAN in ArborX. Further, we report the history of the changes in ArborX and their effect on the time to solve a representative benchmark problem, as well as demonstrate the real world impact on production end-to-end cosmology simulations.
97 MATHEMATICS AND COMPUTING↗
Machine Learning–Based Condition Monitoring of a Circulating Water System of a Canadian Nuclear Plant
With the need to maintain long-term reliable energy using nuclear power plants, there is an underlying demand to ensure that the maintenance of plant components and systems is also done in an efficient and cost-effective manner. One way to achieve this is by moving from time-based maintenance to condition-based maintenance. The research presented in this paper focuses on applying statistical and machine-learning-based methods to capture anomalies within data for fault detection to further develop into condition monitoring. This paper focuses on system data for a circulating water system (CWS) of a pressurized heavy-water reactor for detecting anomalies. The different methodologies used for detecting and capturing anomalies in the CWS data are matrix profile, density-based spatial clustering of applications with noise (DBSCAN), and support vector machines (SVMs). Matrix profile and DBSCAN are used to distinguish between normal data and anomalous data. This paper presents a hybrid method using DBSCAN and SVM when a portion of the data is used for DBSCAN to generate clusters. This portion of data is then used to train the SVM along with the clusters generated by DBSCAN as output. SVM is then tested on unseen data as a predictive tool, which can work in real time to categorize data points as either normal or anomalous. This paper presents results that show the high accuracies of DBSCAN and SVM in capturing anomalies within the data for a CWS for fault detection. Thus, the maintenance plan would be focused on component condition rather than a time-based schedule by switching to an automated system to identify and predict faults within a CWS.
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Condition-Based Maintenance of a Circulating Water System of a Canadian Nuclear Power Plant using Machine Learning and Statistical Tools
Canada Deuterium Uranium pressurized-heavy-water reactors (PHWR) are a type of nuclear power plant that generate clean and reliable energy. The scope of this work is to automate data analysis methodologies to inform a condition-based maintenance strategy of a circulating water system (CWS) of a PHWR. The multiunit CWS provides a continuous supply of water to cool steam condensers, even during transient scenarios, thereby improving the thermal efficiency. This work aims to develop a machine learning (ML) based approach to detect anomalies in heterogeneous data of a CWS in a PHWR to help inform a predictive maintenance strategy. The heterogeneous data include textual and numeric time series data for a PHWR. Natural-language-processing (NLP)-based models are used to analyze textual data contained in work orders and operator logs and an event-timeseries correlation detection method is applied to assist anomalies diagnoses for CWS. An ML model Robust Linear Model (RLM) is also used to remove the seasonal variations in the system variable distributions based on distributions of environmental variables. A machine learning model, Density-Based Spatial Clustering of Applications with Noise (DBSCAN), trained on both original data and data without any seasonal variations will then be used to detect if an anomaly exists. Thus, by moving to an automated methodology to detect, classify, and forecast anomalies, the maintenance strategy would be based on component condition instead of a time-based schedule.
97 - MATHEMATICS AND COMPUTING↗
VoroClust: Scalable Clustering for Remote Sensing
Although supervised machine learning provides a powerful framework for image classification and segmentation, it requires comprehensive consistent datasets, which are not available for many remote-sensing applications. Remote-sensing datasets are expensive to collect, and each is acquired under different environmental conditions or with significant variations in system operating parameters. Unsupervised clustering algorithms analyze the structure of each dataset independently, rather than drawing on similarities with existing “training” examples, and are thus well suited for practical remote-sensing applications. We introduce VoroClust, a fast density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. VoroClust runs as fast as distance-based clustering methods, while capturing complex regional geometries at least as well as current-density-based methods. It uses a data-centered sphere cover to reduce computational demands, while still capturing data topology. It then propagates clusters outward from local peaks in density. We show that VoroClust provides fast state-of-the-art clustering for both high-resolution polarimetric synthetic aperture radar and high-dimensional hyperspectral imaging datasets.
42 ENGINEERING↗
Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning
Atom Probe Tomography (APT) is a powerful technique for visualizing the atomic-scale distribution of solutes in materials, but quantitative cluster analysis of APT datasets remains a challenge due to the need for subjective parameter selection in clustering algorithms. While distance-based and density-based methods such as HDBSCAN are widely used, their performance is highly sensitive to user-defined parameters, which undermines reproducibility and accuracy. This study proposes an image-based, deep learning-aided workflow for automating parameter selection and cluster detection in APT data analysis. By projecting 3D APT point clouds onto 2D planes, we leverage pretrained convolutional neural networks (ConvNeXt-Tiny and ResNet-50) through transfer learning to predict the number of clusters present in synthetic datasets. The output is used to guide K-means clustering and estimate HDBSCAN parameters, specifically minimum cluster size and minimum sample points. This approach reduces reliance on manual parameter tuning, improving consistency and scalability. The methodology demonstrates the feasibility of using image-based deep learning for interpreting complex spatial patterns in APT data, enabling faster and more objective analysis. The complete workflow and code are made publicly available to support reproducibility and future research.
Density-based clustering↗
Exploring Continuous Seismic Data at an Industry Facility Using Unsupervised Machine Learning
Seismic data recorded at industrial sites contain valuable information on anthropogenic activities. With advances in machine learning and computing power, new opportunities have emerged to explore the seismic wavefield in these complex environments. We applied two unsupervised machine learning algorithms to analyze continuous seismic data collected from an industrial facility in Texas, United States. The Uniform Manifold Approximation and Projection for Dimension Reduction algorithm was used to reduce the dimensionality of the data and generate 2D embeddings. Then, the Hierarchical Density-Based Spatial Clustering of Applications with Noise method was employed to automatically group these embeddings into distinct signal clusters. Our analysis of over 1400 hr (around 59 days) of continuous seismic data revealed five and seven signal clusters at two separate stations. At both stations, we identified clusters associated with background noise and vehicle traffic, with the latter’s temporal patterns aligning closely with the facility’s work schedule. Furthermore, the algorithms detected signal clusters from unknown sources and underline the ability of unsupervised machine learning for uncovering previously unrecognized patterns. Our analysis demonstrates the effectiveness of unsupervised approaches in examining continuous seismic data without requiring prior knowledge or pre-existing labels.
58 GEOSCIENCES↗
FY 2026 Midyear Report: Seismic Monitoring of Underground Vibration Sources Using Distributed Acoustic Sensing and Seismometers
Safeguards-relevant temporal changes in underground facilities can be observed using geophysical monitoring techniques. Seismic waves, in particular, provide valuable insights into subsurface activities and can serve as an important tool for detecting anomalous events that may indicate containment breaches at geological repositories. This midyear report summarizes ongoing efforts to automatically and rapidly detect and locate anomalous vibration signals that could be indicative of potential containment breaches. Previous work during FY25 focused on compiling continuous seismic datasets from two underground sites and developing a database of continuous waveforms and ground-truth event data derived from multiple sensing modalities. Building on this foundation, we are adapting anomaly detection and geolocation algorithms to explore methods for monitoring underground activities using two relatively low-maintenance sensing technologies: a dense surface geophone array deployed at the Pleasant Gap mine in Pennsylvania, and a three-dimensional fiber-optic cable array for distributed acoustic sensing (DAS) installed in the subsurface at the Sanford Underground Research Facility (SURF) in South Dakota. This report summarizes work conducted during the first two quarters of FY26, during which we refined a dynamic power spectral density (PSD)-based detector, applied it independently to each geophone station, and then combined the per‑station detections with density-based spatial clustering of applications with noise (DBSCAN) to cluster events and produce spatial maps over a nine‑day interval. In addition, we outline plans for a field trial at the Waste Isolation Pilot Plant (WIPP) in New Mexico to compare traditional seismic monitoring approaches with DAS techniques and to evaluate the benefits of combined data analysis. Activities during the past two quarters have included the preparation and submission of a Field Test Plan to WIPP for approval, as well as submission to headquarters for review and feedback.
58 GEOSCIENCES↗
Understanding grain boundary segregation under irradiation: A mesoscale modeling study
Grain boundaries (GBs) are an important component in the design of irradiation resistant materials as they play a crucial role as point defect sinks for non-equilibrium vacancies and self-interstitials. However, in the presence of sustained point defect fluxes, the coupled transport of atomic components with inherently different diffusivities often leads to radiation-induced segregation (RIS), with undesired effects on properties such as intergranular corrosion and stress-assisted cracking. In this talk, we investigate the fundamental mechanisms leading to GB segregation in BCC FeCr-based alloys using multiscale modeling and experiments. A phase-field model is employed to account for both thermodynamic and kinetic segregation mechanisms. The full Onsager transport matrix is derived using kinetic Monte Carlo, molecular dynamics, and kinetic cluster expansion (KineCluE) calculations. The thermodynamics of GB segregation is described via an atomic density-based modification to the CALPHAD free energy. The modeling predictions are then compared against segregation data from atom probe characterization for various temperatures, compositions, and neutron irradiation conditions. We will conclude by discussing the utility of the multiscale modeling approach to shed light on the fundamental mechanisms leading to solute-GB interaction.
36 MATERIALS SCIENCE↗