Search NASA⌕ Search

SEARCH · Search NASA

Results for “classification algorithms”

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 361 records · Page 20

Star–Galaxy Image Separation with Computationally Efficient Gaussian Process Classification

Abstract We introduce a novel method for discerning optical telescope images of stars from those of galaxies using Gaussian processes (GPs). Although applications of GPs often struggle in high-dimensional data modalities such as optical image classification, we show that a low-dimensional embedding of images into a metric space defined by the principal components of the data suffices to produce high-quality predictions from real large-scale survey data. We develop a novel method of GP classification hyperparameter training that scales approximately linearly in the number of image observations, which allows for application of GP models to large-size Hyper Suprime-Cam Subaru Strategic Program data. In our experiments, we evaluate the performance of a principal component analysis embedded GP predictive model against other machine-learning algorithms, including a convolutional neural network and an image photometric morphology discriminator. Our analysis shows that our methods compare favorably with current methods in optical image classification while producing posterior distributions from the GP regression that can be used to quantify object classification uncertainty. We further describe how classification uncertainty can be used to efficiently parse large-scale survey imaging data to produce high-confidence object catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of remote sensing precipitation data and the $\mathrm{CONNECT}$ algorithm to investigate spatiotemporal variations of heavy precipitation: Case study of major floods across Iran (Spring 2019)

In recent years, the number of floods following unprecedented rainfall events have increased in Iran during early spring (March 21st to April 20th, referred to in Iran as the month of “Farvadin”). While numerous studies have addressed changes in climate extremes and precipitation trends at different temporal scales from daily to annual across the country, analyses of short-duration and heavy precipitation, especially during recent years, are rarely considered. Furthermore, most studies investigate the variations in extremes and total precipitation using a limited number of synoptic weather stations across Iran. Here this study assesses the variations in heavy precipitation (precipitation with intensities greater than or equal to 3 mm/3 h) at 0.04° spatial and 3-hourly temporal resolution during the month of Farvardin. In addition, the effect of atmospheric river conditions over Iran and their possible link to intensifying heavy precipitation is explored. For this purpose, the CONNected-objECT (CONNECT) algorithm is applied on a precipitation dataset, Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks-Cloud Classification System (PERSIANN-CCS), and an Integrated Water Vapor Transport (IVT) dataset from the NASA Modern-Era Retrospective Analysis for Research and Applications Version-2 (MERRA-2). The results suggest that the increase in the number of floods in recent years is related to the increase in the intensity and volume of heavy precipitation events, although the frequency and duration of heavy precipitation events have not changed significantly. Furthermore, the results show that atmospheric river conditions over the country are present during the same window as each year’s most extreme events. It is found that 8 out of 13 of the largest ARs over Iran come from moisture plumes with pathways over the African and Red Sea.

54 ENVIRONMENTAL SCIENCES↗

Towards Anomaly Detection at the CMS High-Level Trigger System

Traditional trigger strategies in CMS typically rely on model-dependent selections or rigid kinematic cuts, risking the omission of unexpected exotic signatures. To address this, we propose a novel anomaly detection (AD) algorithm for the High-Level Trigger (HLT), designed to serve as a complementary second layer of filtering to the Level-1 AXOL1TL AD algorithm. We employ a transformer-based foundation model trained on a diverse ensemble of Standard Model processes. By combining a joint contrastive and classification objective, and using particle kinematics as inputs, the model learns to map events to a physics-informed latent space where anomalous events are isolated from dominant backgrounds. Preliminary results show that this strategy enhances the signal-to-background ratio across a range of rare SM and BSM scenarios. Furthermore, this work constitutes foundational R&D for the potential implementation of an analogous AD algorithm in the Level-1 trigger system for Phase-2.

Cruz, Roy [U. Wisconsin, Madison (main)] (ORCID:00↗

ZENN: A thermodynamics-inspired computational framework for heterogeneous data–driven modeling

Traditional entropy-based methods—such as cross-entropy loss in classification problems—have long been essential tools for representing the information uncertainty and physical disorder in data and for developing artificial intelligence algorithms. However, the rapid growth of data across various domains has introduced new challenges, particularly the integration of heterogeneous datasets with intrinsic disparities. To address this, we introduce a zentropy-enhanced neural network (ZENN), extending zentropy theory into the data science domain via intrinsic entropy, enabling more effective learning from heterogeneous data sources. ZENN simultaneously learns both energy and intrinsic entropy components, capturing the underlying structure of multisource data. To support this, we redesign the neural network architecture to better reflect the intrinsic properties and variability inherent in diverse datasets. We demonstrate the effectiveness of ZENN on classification tasks and energy landscape reconstructions, showing its superior generalization capabilities and robustness-particularly in predicting high-order derivatives. In image and text classification tasks, ZENN demonstrates superior generalization by introducing a learnable temperature variable that models latent multisource heterogeneity, allowing it to surpass state-of-the-art models on CIFAR-10/100, BBC News, and AG News. As a practical application in materials science, we employ ZENN to reconstruct the Helmholtz energy landscape of Fe3Pt using data generated from density functional theory and capture key material behaviors, including negative thermal expansion and the critical point in the temperature–pressure space. Overall, this work presents a zentropy-grounded framework for data-driven machine learning, positioning ZENN as a versatile and robust approach for scientific problems involving complex, heterogeneous datasets.

36 MATERIALS SCIENCE↗

A Study of Clustering Techniques and Hierarchical Matrix Formats for Kernel Ridge Regression

We present memory-efficient and scalable algorithms for kernel methods used in machine learning. Using hierarchical matrix approximations for the kernel matrix the memory requirements, the number of floating point operations, and the execution time are drastically reduced compared to standard dense linear algebra routines. We consider both the general H matrix hierarchical format as well as Hierarchically Semi-Separable (HSS) matrices. Furthermore, we investigate the impact of several preprocessing and clustering techniques on the hierarchical matrix compression. Effective clustering of the input leads to a ten-fold increase in efficiency of the compression. The algorithms are implemented using the STRUMPACK solver library. These results confirm that - with correct tuning of the hyperparameters - classification using kernel ridge regression with the compressed matrix does not lose prediction accuracy compared to the exact - not compressed - kernel matrix and that our approach can be extended to O(1M) datasets, for which computation with the full kernel matrix becomes prohibitively expensive. We present numerical experiments in a distributed memory environment up to 1,024 processors of the NERSC's Cori supercomputer using well-known datasets to the machine learning community that range from dimension 8 up to 784.

97 MATHEMATICS AND COMPUTING↗

Comparing Calibration Algorithms for the Rapid Characterization of Pretreated Corn Stover Using Near-Infrared Spectroscopy

Rapid characterization of biomass composition is a key enabling technology for biorefineries—the ability to measure the chemical composition of biomass materials entering the biorefinery as well as the composition of key process intermediate streams would allow real-time process control and the development of robust models to predict process performance. The utility of near-infrared (NIR) spectroscopy for rapid characterization requires multivariate algorithms for building calibration models. The most prevalent algorithm used for building calibration models using NIR spectra is the linear modeling algorithm Partial Least Squares Regression (PLS). Nonlinear regression algorithms (which are typically more computationally intensive than linear modeling approaches) have gained popularity in recent years due to their ability to solve a wide variety of classification and regression problems and the dramatic increase in available computational resources. In this work, we demonstrate that a calibration model can predict the composition of corn stover process intermediate samples pretreated with three different treatments—hot water (HW), dilute acid (DA), and deacetylation followed by dilute acid (DDA). We quantitatively compare three different algorithms for building prediction models based on near-infrared spectroscopy—partial least squares (PLS), support vector machines (SVM), and random forests (RF). We demonstrate the utility of improving model performance by accounting for instrument performance variability using repeated measurements of standard materials (e.g., the “repeatability file” strategy) and investigate its performance with nonlinear regression techniques, and we discuss methods for quantifying the uncertainties of specific predictions among the three methods.

09 BIOMASS FUELS↗

Validating deep learning inference during chest X-ray classification for COVID-19 screening

Abstract The new coronavirus unleashed a worldwide pandemic in early 2020, and a fatality rate several times that of the flu. As the number of infections soared, and capabilities for testing lagged behind, chest X-ray (CXR) imaging became more relevant in the early diagnosis and treatment planning for patients with suspected or confirmed COVID-19 infection. In a few weeks, proposed new methods for lung screening using deep learning rapidly appeared, while quality assurance discussions lagged behind. This paper proposes a set of protocols to validate deep learning algorithms, including our ROI Hide-and-Seek protocol, which emphasizes or hides key regions of interest from CXR data. Our protocol allows assessing the classification performance for anomaly detection and its correlation to radiological signatures, an important issue overlooked in several deep learning approaches proposed so far. By running a set of systematic tests over CXR representations using public image datasets, we demonstrate the weaknesses of current techniques and offer perspectives on the advantages and limitations of automated radiography analysis when using heterogeneous data sources.

59 BASIC BIOLOGICAL SCIENCES↗

Machine learning models for segmentation and classification of cyanobacterial cells

Abstract Timelapse microscopy has recently been employed to study the metabolism and physiology of cyanobacteria at the single-cell level. However, the identification of individual cells in brightfield images remains a significant challenge. Traditional intensity-based segmentation algorithms perform poorly when identifying individual cells in dense colonies due to a lack of contrast between neighboring cells. Here, we describe a newly developed software package called Cypose which uses machine learning (ML) models to solve two specific tasks: segmentation of individual cyanobacterial cells, and classification of cellular phenotypes. The segmentation models are based on the Cellpose framework, while classification is performed using a convolutional neural network named Cyclass. To our knowledge, these are the first developed ML-based models for cyanobacteria segmentation and classification. When compared to other methods, our segmentation models showed improved performance and were able to segment cells with varied morphological phenotypes, as well as differentiate between live and lysed cells. We also found that our models were robust to imaging artifacts, such as dust and cell debris. Additionally, the classification model was able to identify different cellular phenotypes using only images as input. Together, these models improve cell segmentation accuracy and enable high-throughput analysis of dense cyanobacterial colonies and filamentous cyanobacteria.

Huffine, Clair A.↗

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al ., npj Quantum Inf. 10 , 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. Here, in this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.

Algebraic structures↗

Unpaired image translation to mitigate domain shift in liquid argon time projection chamber detector responses

Deep learning algorithms often are developed and trained on a training dataset and deployed on test datasets. Any systematic difference between the training and a test dataset may severely degrade the final algorithm performance on the test dataset—what is known as the domain shift problem . This issue is prevalent in many scientific domains where algorithms are trained on simulated data but applied to real-world datasets. Typically, the domain shift problem is solved through various domain adaptation (DA) methods. However, these methods are often tailored for a specific downstream task, such as classification or semantic segmentation, and may not easily generalize to different tasks. This work explores the feasibility of using an alternative way to solve the domain shift problem that is not specific to any downstream algorithm. The proposed approach relies on modern Unpaired Image-to-Image (UI2I) translation techniques, designed to find translations between different image domains in a fully unsupervised fashion. In this study, the approach is applied to a domain shift problem commonly encountered in Liquid Argon Time Projection Chamber (LArTPC) detector research when seeking a way to translate samples between two differently distributed LArTPC detector datasets deterministically. This translation allows for mapping real-world data into the simulated data domain where the downstream algorithms can be run with much less domain-shift-related performance degradation. Conversely, using the translation from the simulated data to a real-world domain can increase the realism of the simulated dataset and reduce the magnitude of any systematic uncertainties. To evaluate the quality of the translations, we use both pixel-wise metrics and a downstream task to measure the effectiveness of UI2I methods for mitigating the domain shift problem. We adapted several popular UI2I translation algorithms to work on scientific data and demonstrated the viability of these techniques for solving the domain shift problem with LArTPC detector data. To facilitate further development of DA techniques for scientific datasets, the ‘Simple Liquid-Argon Track Samples’ dataset used in this study is also published.

97 MATHEMATICS AND COMPUTING↗

Comprehensive defect evaluation of advanced nuclear fuels using high-resolution acoustic signals and optimized sensor separation

Graphite pebble composite structures based on TRistructural-ISOtropic (TRISO) particles are being developed as core nuclear fuels in advanced power reactors, promising safe operation at increased temperatures. Ensuring the structural integrity of these nuclear fuels requires comprehensive and accurate non-destructive evaluation (NDE) techniques to characterize defects and damage in the pebbles. However, traditional acoustic evaluation methods face limitations in defect characterization due to the highly attenuative, and geometrically and compositionally complex nature of these structures. This study proposes an improved acoustic NDE technique for accurate detection and classification of anticipated relevant defects and damage in graphite pebbles using high-resolution acoustic signals and optimized transmit-receive sensor networks. The proposed approach utilizes a triangular three-sensor network as the base unit, comprising three transmit-receive sensors. The sensor separation distance, as well as acoustic excitation center frequency, pulse-width, and bandwidth are optimized to enhance spatial resolution and improve signal-to-noise ratio, enabling effective characterization of the smallest size and widest range of defects in pebbles. Furthermore, the use of the triangular sensor configuration instead of a more conventional transmit-receive sensor pair expands the inspection region from a one-dimensional linear path to a two-dimensional area, increasing spatial coverage. To mitigate challenges associated with processing of complex acoustic signals arising from high-frequency, high-bandwidth excitation in these structures, a machine-learning-based signal processing algorithm is integrated with the sensor network. In the machine-learning-based algorithm, multi-domain features are extracted from the acoustic signals to capture intricate signal characteristics, significantly improving defect identification and classification compared to traditional approaches. The proposed acoustic NDE technique offers considerable promise for practical and reliable defect/damage diagnostics of advanced nuclear pebble fuels.

42 ENGINEERING↗

A Hierarchical Framework for CO2 Storage Capacity in Deep Saline Aquifer Formations

Carbon dioxide (CO 2 ) storage in deep saline aquifers is a vital option for CO 2 mitigation at a large scale. Determining storage capacity is one of the crucial steps toward large-scale deployment of CO 2 storage. Results of capacity assessments tend toward a consensus that sufficient resources are available in saline aquifers in many parts of the world. However, current CO 2 capacity assessments involve significant inconsistencies and uncertainties caused by various technical assumptions, storage mechanisms considered, algorithms, and data types and resolutions. Furthermore, other constraint factors (such as techno-economic features, site suitability, risk, regulation, social-economic situation, and policies) significantly affect the storage capacity assessment results. Consequently, a consensus capacity classification system and assessment method should be capable of classifying the capacity type or even more related uncertainties. We present a hierarchical framework of CO 2 capacity to define the capacity types based on the various factors, algorithms, and datasets. Finally, a review of onshore CO 2 aquifer storage capacity assessments in China is presented as examples to illustrate the feasibility of the proposed hierarchical framework.

58 GEOSCIENCES↗

Spatio-Temporal Deep Graph Network for Event Detection, Localization, and Classification in Cyber-Physical Electric Distribution System

This work proposes a deep graph learning framework to identify, locate, and classify power, cyber, and cyber power events at the distribution system level. The proposed algorithm jointly exploits spatial, temporal, and node-level cyber and physical data features. The developed graph neural network, together with a deep autoencoder, utilizes physical measurements from distribution level phasor measurement units and cyber data from communication network logs. The spatial structure of the synchrophasor measurements and network is incorporated through a weighted adjacency matrix. The temporal structure is incorporated by defining a spatial operation in the gated recurrent unit. This spatio-temporal learning element resides inside a power event detection, localization, and classification module that provides the degree of confidence for an event label. To accurately pinpoint the location of an event to the nearest bus equipped with a measurement unit, a combination of squared error and proximity score is utilized. Also included is a cyber event detection module that employs heteroskedasticity to analyze the significance of various cyber features during different types of attacks. Finally, a dual-bit cyber-power decision table determines the nature of the event. The proposed method is validated on two distribution systems modeled in OPAL-RT/Hypersim with limited phasor measurement units for different possible physical and cyber events. Further analyses include comparison with other state-of-the-art methods and validation in the presence of measurement noise. As a result, our method outperforms existing approaches and achieves an average detection accuracy of 97.97%, F1-score of 96.88%, precision of 96.53%, and recall of 98.57%.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Functional protein mining with conformal guarantees

Molecular structure prediction and homology detection offer promising paths to discovering protein function and evolutionary relationships. However, current approaches lack statistical reliability assurances, limiting their practical utility for selecting proteins for further experimental and in-silico characterization. To address this challenge, we introduce a statistically principled approach to protein search leveraging principles from conformal prediction, offering a framework that ensures statistical guarantees with user-specified risk and provides calibrated probabilities (rather than raw ML scores) for any protein search model. Our method (1) lets users select many biologically-relevant loss metrics (i.e. false discovery rate) and assigns reliable functional probabilities for annotating genes of unknown function; (2) achieves state-of-the-art performance in enzyme classification without training new models; and (3) robustly and rapidly pre-filters proteins for computationally intensive structural alignment algorithms. Our framework enhances the reliability of protein homology detection and enables the discovery of uncharacterized proteins with likely desirable functional properties.

59 BASIC BIOLOGICAL SCIENCES↗

Unsupervised machine learning for unbiased chemical classification in X-ray absorption spectroscopy and X-ray emission spectroscopy

Here we report a comprehensive computational study of unsupervised machine learning for extraction of chemically relevant information in X-ray absorption near edge structure (XANES) and in valence-to-core X-ray emission spectra (VtC-XES) for classification of a broad ensemble of sulphorganic molecules. By progressively decreasing the constraining assumptions of the unsupervised machine learning algorithm, moving from principal component analysis (PCA) to a variational autoencoder (VAE) to t-distributed stochastic neighbour embedding (t-SNE), we find improved sensitivity to steadily more refined chemical information. Surprisingly, when embedding the ensemble of spectra in merely two dimensions, t-SNE distinguishes not just oxidation state and general sulphur bonding environment but also the aromaticity of the bonding radical group with 87% accuracy as well as identifying even finer details in electronic structure within aromatic or aliphatic sub-classes. We find that the chemical information in XANES and VtC-XES is very similar in character and content, although they unexpectedly have different sensitivity within a given molecular class. We also discuss likely benefits from further effort with unsupervised machine learning and from the interplay between supervised and unsupervised machine learning for X-ray spectroscopies. Our overall results, i.e., the ability to reliably classify without user bias and to discover unexpected chemical signatures for XANES and VtC-XES, likely generalize to other systems as well as to other one-dimensional chemical spectroscopies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

How reliable is distribution of relaxation times (DRT) analysis? A dual regression-classification perspective on DRT estimation, interpretation, and accuracy

The distribution of relaxation times (DRT) has gained increasing attention and adoption in recent years as a versatile method for analyzing electrochemical impedance spectroscopy (EIS) data obtained from complex devices like fuel cells, electrolyzers, and batteries. The DRT deconvolutes the impedance without a priori specification of a generative model, which is especially useful for interpretation and model selection when the governing principles of the system under study are not fully understood. However, DRT estimation is an ill-posed inversion problem that must be addressed with a subjective choice of regularization and tuning, which leaves substantial risk of misleading interpretations of EIS data. In this work, we suggest a new classification view of the DRT inversion to clarify DRT estimation and interpretation. We introduce a dual regression-classification framework that unifies the classification and regression views of the DRT inversion with wide-reaching implications for DRT analysis. The dual framework is employed to demonstrate a new kind of DRT inversion algorithm and develop novel evaluation metrics that capture previously ignored aspects of DRT accuracy. These approaches are applied to both synthetic data and experimental spectra collected from a protonic ceramic fuel cell and a lithium-ion battery to illustrate their broad utility. The dual inversion algorithm shows promising performance for accurate DRT estimation and autonomous model identification, while the dual evaluation approach produces metrics that meaningfully assess the strengths and risks of DRT algorithms. Here this work provides valuable insight for both practical application of the DRT to experimental data and further development of EIS analysis methods.

36 MATERIALS SCIENCE↗

Quantum machine learning for chemistry and physics

Machine learning (ML) has emerged as a formidable force for identifying hidden but pertinent patterns within a given data set with the objective of subsequent generation of automated predictive behavior. In recent years, it is safe to conclude that ML and its close cousin, deep learning (DL), have ushered in unprecedented developments in all areas of physical sciences, especially chemistry. Not only classical variants of ML, even those trainable on near-term quantum hardwares have been developed with promising outcomes. Such algorithms have revolutionized materials design and performance of photovoltaics, electronic structure calculations of ground and excited states of correlated matter, computation of force-fields and potential energy surfaces informing chemical reaction dynamics, reactivity inspired rational strategies of drug designing and even classification of phases of matter with accurate identification of emergent criticality. In this review we shall explicate a subset of such topics and delineate the contributions made by both classical and quantum computing enhanced machine learning algorithms over the past few years. We shall not only present a brief overview of the well-known techniques but also highlight their learning strategies using statistical physical insight. The objective of the review is not only to foster exposition of the aforesaid techniques but also to empower and promote cross-pollination among future research in all areas of chemistry which can benefit from ML and in turn can potentially accelerate the growth of such algorithms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Combining Spike Time Dependent Plasticity (STDP) and Backpropagation (BP) for Robust and Data Efficient Spiking Neural Networks (SNN)

National security applications require artificial neural networks (ANNs) that consume less power, are fast and dynamic online learners, are fault tolerant, and can learn from unlabeled and imbalanced data. We explore whether two fundamentally different, traditional learning algorithms from artificial intelligence and the biological brain can be merged. We tackle this problem from two directions. First, we start from a theoretical point of view and show that the spike time dependent plasticity (STDP) learning curve observed in biological networks can be derived using the mathematical framework of backpropagation through time. Second, we show that transmission delays, as observed in biological networks, improve the ability of spiking networks to perform classification when trained using a backpropagation of error (BP) method. These results provide evidence that STDP could be compatible with a BP learning rule. Combining these learning algorithms will likely lead to networks more capable of meeting our national security missions.

97 MATHEMATICS AND COMPUTING↗