Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster methods”

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.

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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↗
NASA NTRS2002

Normalized Cut Algorithm for Automated Assignment of Protein Domains

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Samanta, M. P.↗
DOE OSTI2025

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↗
DOE OSTI2026

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↗
DOE OSTI2021

Subnanometer catalytic clusters for water splitting, method for splitting water using subnanometer catalyst clusters

The invention provides a catalytic electrode for converting molecules, the electrode comprising a predetermined number of single catalytic sites supported on a substrate. Also provided is a method for oxidizing water comprising contacting the water with size selected catalyst clusters. The invention also provides a method for reducing an oxidized moiety, the method comprising contacting the moiety with size selected catalyst clusters at a predetermined voltage potential.

Vajda, Stefan↗
DOE OSTI2023

Population Subdivision in the Gopher Frog (Rana capito) across the Fragmented Longleaf Pine-Wiregrass Savanna of the Southeastern USA

Delineating genetically distinct population segments of threatened species and quantifying population connectivity are important steps in developing effective conservation and management strategies aimed at preventing extinction. The gopher frog (Rana capito) is a xeric-adapted, pond-breeding species endemic to the Gulf and Atlantic coastal plains of the southeastern United States. This species has experienced extensive habitat loss and fragmentation in the formerly widespread longleaf pine-wiregrass savanna where it lives, resulting in individual abundance declines and population extinctions throughout its range. We used individual-based clustering methods along with Bayesian inference of historical migration based on almost 1500 multilocus microsatellite genotypes to examine genetic structure in this taxon. Clustering analyses identified panhandle and peninsular populations in Florida as distinct genetic clusters separated by the Aucilla River, consistent with the division between the Coastal Plain and peninsular mitochondrial lineages, respectively. Analysis of historical migration indicated an east–west population divergence event followed by immigration to the east. Together, our results indicate that the genetically distinct Coastal Plain and peninsular Florida lineages should be considered separately for conservation and management purposes.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2003

Aerosol Models for the CALIPSO Lidar Inversion Algorithms

We use measurements and models to develop aerosol models for use in the inversion algorithms for the Cloud Aerosol Lidar and Imager Pathfinder Spaceborne Observations (CALIPSO). Radiance measurements and inversions of the AErosol RObotic NETwork (AERONET1, 2) are used to group global atmospheric aerosols using optical and microphysical parameters. This study uses more than 105 records of radiance measurements, aerosol size distributions, and complex refractive indices to generate the optical properties of the aerosol at more 200 sites worldwide. These properties together with the radiance measurements are then classified using classical clustering methods to group the sites according to the type of aerosol with the greatest frequency of occurrence at each site. Six significant clusters are identified: desert dust, biomass burning, urban industrial pollution, rural background, marine, and dirty pollution. Three of these are used in the CALIPSO aerosol models to characterize desert dust, biomass burning, and polluted continental aerosols. The CALIPSO aerosol model also uses the coarse mode of desert dust and the fine mode of biomass burning to build a polluted dust model. For marine aerosol, the CALIPSO aerosol model uses measurements from the SEAS experiment 3. In addition to categorizing the aerosol types, the cluster analysis provides all the column optical and microphysical properties for each cluster.

Omar, Ali H.↗
NASA NTRS2005

A Fast Implementation of the ISODATA Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to ISODATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗
NASA NTRS2007

A Fast Implementation of the Isodata Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to IsoDATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗
NASA NTRS2021

Application of Gaussian Mixture Regression for the Correction of Low Cost PM2.5 Monitoring Data in Accra, Ghana

Low-cost sensors (LCSs) for air quality monitoring have enormous potential to improve air quality data coverage in resource-limited parts of the world such as sub-Saharan Africa. LCSs, however, are affected by environment and source conditions. To establish high-quality data, LCSs must be collocated and calibrated with reference grade PM2.5 monitors. From March 2020, a low-cost PurpleAir PM2.5 monitor was collocated with a Met One Beta Attenuation Monitor 1020 in Accra, Ghana. While previous studies have shown that multiple linear regression (MLR) and random forest regression (RF) can improve accuracy and correlation between PurpleAir and reference data, MLR and RF yielded suboptimal improvement in the Accra collocation (R2 = 0.81 and R2 = 0.81, respectively). We present the first application of Gaussian mixture regression (GMR) to air quality data calibration and demonstrate improvement over traditional methods by increasing the collocated PM2.5 correlation and accuracy to R2 = 0.88 and MAE = 2.2 μg/cu. m. Gaussian mixture models (GMMs) are a probability density estimator and clustering method from which nonlinear regressions that tolerate missing inputs can be derived. We find that even when given missing inputs, GMR provides better correlation than MLR and RF performed with complete data. GMR also allows us to estimate calibration certainty. When evaluated, 95% confidence intervals agreed with reference PM2.5 data 96% of the time, suggesting that the model accurately assesses its own confidence. Additionally, clustering within the GMM is consistent with climate characteristics, providing confidence that the calibration approach can learn underlying relationships in data.

Sensors↗
NASA NTRS2004

Clustering with Missing Values: No Imputation Required

Clustering algorithms can identify groups in large data sets, such as star catalogs and hyperspectral images. In general, clustering methods cannot analyze items that have missing data values. Common solutions either fill in the missing values (imputation) or ignore the missing data (marginalization). Imputed values are treated as just as reliable as the truly observed data, but they are only as good as the assumptions used to create them. In contrast, we present a method for encoding partially observed features as a set of supplemental soft constraints and introduce the KSC algorithm, which incorporates constraints into the clustering process. In experiments on artificial data and data from the Sloan Digital Sky Survey, we show that soft constraints are an effective way to enable clustering with missing values.

constraints↗
DOE OSTI2026

Local Pair Natural Orbital-Based Coupled-Cluster Theory through Full Quadruples (DLPNO–CCSDTQ)

In this work, we implement a local pair natural orbitalbased coupled-cluster method through the full treatment of quadruple excitations (CCSDTQ). The domain-based local pair natural orbital (DLPNO) approach, which has successfully been applied to lower levels of coupled-cluster theory, is utilized in our algorithm, and thus our algorithm is called DLPNO-CCSDTQ. For simplicity in the working equations and in the implementation, we t 1 -dress the twoelectron integrals as well as Fock matrix elements. Our method can recover CCSDTQ-CCSDT and CCSDTQ-CCSDT(Q) energy differences on the order of 0.01−0.05 kcal mol −1 , even at a loose quadruples natural orbital (QNO) occupation number cutoff of 3.33 × 10 −6 . To highlight the capabilities of our code and its potential future applications, we showcase computations that would be intractable with canonical CCSDTQ, such as the benzene dimer, (H 2 O) 17 , and adamantane. With sufficient computing resources, computations up to 15 heavy atoms (40 atoms overall) may be feasible for fully bonded 3D systems.

Cluster chemistry↗
NASA NTRSDate not supplied

Synthesis Analysis of Mulit-Dimensional Ozone Lidar Measurements in Coastal Environments Toward Improving Ozone Simulation

Large surface ozone variations are frequently observed in coastal regions which makes the modeling of air quality in these regions challenging. The ability to properly model coastal regions relies heavily on the proper detailed observations. There have been three air quality studies (over Chesapeake Bay and the Long Island Sound) that focused on thorough measurements in these complex coastal regions; OWLETS 1 & 2 and LISTOS. Over the course of the campaigns, there were surface ozone observations taken from LIDAR (LIght Detection And Ranging) instruments for a total of 89 days at a high temporal rate. We developed a clustering method that characterizes the multiple timestamps of measurements into a range of ozone events that are specific to these coastal regions. We simulated coastal ozone for these cluster groups using WRF-GC and WRF-Chem to identify gaps within the model. Using the characterized ozone clusters, we were able to identify multiple coastal mechanisms that led to incorrect model simulations.

Claudia Bernier↗
DOE OSTI2021

Data–Driven Velocity Model Evaluation Using K–Means Clustering

In this work, we develop a data-driven clustering method to evaluate a velocity model using surface wave velocity dispersion. This is done by first computing theoretical dispersion curves for 1-D velocity profiles of all the grid locations and then splitting the resulting dispersion curves into a certain number of groups via the K-means clustering. The observed dispersion curves are also clustered following the same procedure and the velocity model is assessed by comparing the spatial patterns obtained for the observed and synthetic data sets. The method is applied to evaluate two community velocity models in southern California, CVM-S4.26 and CVM-H15.1, using phase velocity maps derived for 3–16 s Rayleigh waves. We found a good correlation in the spatial distribution of clusters between the result of CVM-S4.26 and that of the observed data, suggesting that the CVM-S4.26 fits the observed dispersion maps better than the CVM-H15.1 in terms of features extracted from the clustering analysis.

58 GEOSCIENCES↗
DOE OSTI2020

Three-dimensional potential energy surfaces of ArNO ($\tilde{X}$ 2 Π)

Until now, the potential energy surfaces (PESs) of the ArNO complex found in the literature were two-dimensional, with the NO interatomic distance being fixed. In this work, we present the first accurate three-dimensional ground state X 2 Π PESs (both A ' and A ") of ArNO computed at the CCSD(T)/CBS level of theory. The equilibrium geometries and the well depths ( D e ) are compared to several other electronic structure methods. We found that using the multireference method, MRCI-F12 makes the surfaces much shallower (by 25%) and the depth of the surfaces does not agree with experimental data. The explicitly correlated coupled-cluster method underestimates the well depth as well. Analytic representations for both A ' and A " surfaces were fit to 4380 ab initio points to within 2.71 cm -1 .A three-dimensional Numerov propagator method in Delves coordinates is used to compute the bound state spectrum up to J tot = 6.5. The recommended dissociation energies are D 0 = 97.2 cm -1 for the adiabatic ground state and D e = 133.7 (128.1) cm -1 for A ' ( A ")

36 MATERIALS SCIENCE↗
NASA NTRS2017

An Orbital Meteoroid Stream Survey Using the Southern Argentina Agile Meteor Radar (SAAMER) Based on a Wavelet Approach

Over a million individually measured meteoroid orbits were collected with the Southern Argentina Agile MEteor Radar (SAAMER) between 2012-2015. This provides a robust statistical database to perform an initial orbital survey of meteor showers in the Southern Hemisphere via the application of a 3D wavelet transform. The method results in a composite year from all 4 years of data, enabling us to obtain an undisturbed year of meteor activity with more than one thousand meteors per day. Our automated meteor shower search methodology identified 58 showers. Of these showers, 24 were associated with previously reported showers from the IAU catalogue while 34 showers are new and not listed in the catalogue. Our searching method combined with our large data sample provides unprecedented accuracy in measuring meteor shower activity and description of shower characteristics in the Southern Hemisphere. Using simple modeling and clustering methods we also propose potential parent bodies for the newly discovered showers.

Meteor showers↗
NASA NTRS2017

A Network-Based Algorithm for Clustering Multivariate Repeated Measures Data

The National Aeronautics and Space Administration (NASA) Astronaut Corps is a unique occupational cohort for which vast amounts of measures data have been collected repeatedly in research or operational studies pre-, in-, and post-flight, as well as during multiple clinical care visits. In exploratory analyses aimed at generating hypotheses regarding physiological changes associated with spaceflight exposure, such as impaired vision, it is of interest to identify anomalies and trends across these expansive datasets. Multivariate clustering algorithms for repeated measures data may help parse the data to identify homogeneous groups of astronauts that have higher risks for a particular physiological change. However, available clustering methods may not be able to accommodate the complex data structures found in NASA data, since the methods often rely on strict model assumptions, require equally-spaced and balanced assessment times, cannot accommodate missing data or differing time scales across variables, and cannot process continuous and discrete data simultaneously. To fill this gap, we propose a network-based, multivariate clustering algorithm for repeated measures data that can be tailored to fit various research settings. Using simulated data, we demonstrate how our method can be used to identify patterns in complex data structures found in practice.

Koslovsky, Matthew↗
DOE OSTI2021

Towards complete assignment of the infrared spectrum of the protonated water cluster H + (H 2 O) 21

The spectroscopic features of protonated water species in dilute acid solutions have been long sought after for understanding the microscopic behavior of the proton in water with gas-phase water clusters H + (H 2 O) n extensively studied as bottom-up model systems. We present a new protocol for the calculation of the infrared (IR) spectra of complex systems, which combines the fragment-based Coupled Cluster method and anharmonic vibrational quasi-degenerate perturbation theory, and demonstrate its accuracy towards the complete and accurate assignment of the IR spectrum of the H + (H 2 O) 21 cluster. The site-specific IR spectral signatures reveal two distinct structures for the internal and surface four-coordinated water molecules, which are ice-like and liquid-like, respectively. The effect of inter-molecular interaction between water molecules is addressed, and the vibrational resonance is found between the O-H stretching fundamental and the bending overtone of the nearest neighboring water molecule. The revelation of the spectral signature of the excess proton offers deeper insight into the nature of charge accommodation in the extended hydrogen-bonding network underpinning this aqueous cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗