Search NASA⌕ Search

SEARCH · Search NASA

Results for “learning classifiers”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Supervised Machine Learning Approach for Classifying Earth Science Publications

The data collections archived and distributed by the GES DISC NASA data center are widely utilized for various Earth Science studies. As these collections are created, many research works are published regarding these collections' algorithms, their validation, and their applications. As NASA data centers collect these publications for public use, it is helpful to categorize them based on how they relate to their associated datasets. Specifically, whether the publication linked to the GES DISC dataset is using it for applicational research, describing the algorithm used for the dataset creation, validating the dataset, or providing a general overview of the data collection. Currently, this process requires simple manual labeling, and as such, it may be possible to solve via automation. To approach this problem, machine learning classifiers were developed to predict a publication's category. Manually labeled publications were used as the training data for the supervised machine learning algorithms, specifically Random Forest and Multinomial Naïve Bayes. After balancing the dataset and implementing the Multinomial Naïve Bayes algorithm, the classification accuracy achieved was substantially higher than the baseline accuracy, thus significantly improving the efficiency of publication labeling.

Rohan Dayal↗
NASA NTRSDate not supplied

Automated classification of scientific publications linked to GES DISC datasets

The data collections archived and distributedby the GES DISC NASA data center arewidely utilized for various Earth Science studies.As these collections are created, many researchworks are published regarding the collections, algorithms,validations and applications. SinceGES DISC collects these publications and providestheir citations for the users, it is helpful tocategorize them based on how they relate to the datasetsthey are associated with. Specifically,whether the publication that is linked to GES DISCdataset is using it for applicational research,or if it describes the algorithm for dataset creation,or the validation of the dataset, or providesthe general overview of the data collection. Currently,this process requires simple manuallabelling, and as such, may be possible to solve viaautomation. To approach this problem, wedeveloped machine learning classifiers to predictthe category a publication belongs to. We usedmanually labeled publications as training data forsupervised machine learning algorithms:Random Forest and Naive Bayes. We achieved classificationaccuracy that is substantially betterthan the baseline accuracy, thus greatly improvingthe efficiency of the publication internalanalysis.

Rohan Dayal↗
NASA NTRS2020

Flood Mapping Using UAVSAR and Convolutional Neural Networks

We have mapped flooded areas in data collected by the NASA/JPL Uninhabited Aerial Vehicle Synthetic Aperture Radar (UAVSAR) using two convolutional neural network (CNN) image classifier architectures: U-Net and SegNet. Our study area was a region around Houston, TX, USA affected by widespread flooding in 2017 due to Hurricane Harvey. To train and test the classifiers, we manually labelled over 10000 image segments in two flight lines. Both U-Net and SegNet yielded higher accuracy than a previous non-machine learning classifier we used as a baseline. U-Net had slightly higher accuracy than SegNet. The classifiers performed better in areas with more homogeneous land cover. To independently validate the classifier accuracy we used NOAA aerial imagery, with overall accuracy around 80%. Future work includes assessing the classifier robustness in other study areas, assessing the classifier dependence on UAVSAR incidence angle, particularly for open water and bare ground, and collecting more training data, particularly in urban areas. This study demonstrates the potential of CNN image classifiers for mapping flooded areas in airborne polarimetric SAR imagery, and for land cover classification of polarimetric SAR imagery more generally.

Denbina, Michael W↗
NASA NTRS2019

Evaluation of Classifier Complexity for Delay Tolerant Network Routing

The growing popularity of small cost effective satellites (SmallSats, CubeSats, etc.) creates the potential for a variety of new science applications involving multiple nodes functioning together or independently to achieve a task, such as swarms and constellations. As this technology develops and is deployed for missions in Low Earth Orbit and beyond, the use of delay tolerant networking (DTN) techniques may improve communication capabilities within the network. In this paper, a network hierarchy is developed from heterogeneous networks of SmallSats, surface vehicles, relay satellites and ground stations which form an integrated network. There is a tradeoff between complexity, flexibility, and scalability of user defined schedules versus autonomous routing as the number of nodes in the network increases. To address these issues, this work proposes a machine learning classifier based on DTN routing metrics. A framework is developed which will allow for the use of several categories of machine learning algorithms (decision tree, random forest and deep learning) to be applied to a dataset of historical network statistics, which allows for the evaluation of algorithm complexity versus performance to be explored. We develop the emulation of a hierarchical network, consisting of tens of nodes which form a cognitive network architecture. CORE (Common Open Research Emulator) is used to emulate the network using bundle protocol and DTN IP neighbor discovery.

Dudukovich, Rachel↗
DOE OSTI2025

Explaining word embeddings with perfect fidelity: a case study in predicting research impact

The best-performing approaches for scholarly document quality prediction are based on embedding models. In addition to their performance when used in classifiers, embedding models can also provide predictions even for words that were not contained in the labelled training data for the classification model, which is important in the context of the ever-evolving research terminology. Although model-agnostic explanation methods, such as Local interpretable model-agnostic explanations, can be applied to explain machine learning classifiers trained on embedding models, these produce results with questionable correspondence to the model. We introduce a new feature importance method, Self-Model Entities Rated (SMER), for logistic regression-based classification models trained on word embeddings. We show that SMER has theoretically perfect fidelity with the explained model, as the average of logits of SMER scores for individual words (SMER explanation) exactly corresponds to the logit of the prediction of the explained model. Quantitative and qualitative evaluation is performed through five diverse experiments conducted on 50,000 research articles (papers) from the CORD-19 corpus. In conclusion, through an AOPC curve analysis, we experimentally demonstrate that SMER produces better explanations than LIME, SHAP and global tree surrogates.

Coarse-grained models↗
DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

Danovo Energy Solution's presented its paper named: Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events at the 2026 Georgia Tech Fault & Disturbance Analysis Conference. The full paper can be found at OSTI ID# 3169150 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danova Energy Solutions]↗
DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

This paper is the basis for a presentation help at the 2026 Georgia Tech Fault & Disturbance Analysis Conference, which can be found at OSTI # 3168287 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danovo Energy Solutions]↗
DOE OSTI2026

A two-stage optical fusion framework for wildfire severity mapping across the conterminous United States

Accurate wildfire severity mapping (WSM) is essential for post-fire recovery planning, erosion risk assessment, ecosystem monitoring, and disaster risk reduction. Although Landsat and Sentinel optical imagery have been widely used for burn severity assessment, the added value of fusing multiple optical sensors has not been sufficiently quantified across diverse fire events, particularly since the launch of Landsat-9. This study evaluates whether multisensor optical fusion improves wildfire severity mapping relative to single-sensor baselines using Sentinel-2, Landsat-8, and Landsat-9 imagery across 40 wildfire events in the conterminous United States. We tested a two-stage fusion framework that combines feature-level fusion with pixel-level dimensionality reduction. First, feature-level fused datasets were created through early fusion by combining standardized post-fire bands from each sensor into a single predictor stack. Both raw reflectance bands and pairwise spectral transforms were retained to capture within- and cross-sensor spectral interactions. Second, Linear Discriminant Analysis was applied to both single-sensor and fused datasets to produce comparable low-dimensional feature spaces. Six machine-learning classifiers were then used to benchmark model performance with repeated spatially buffered train–test splits. Results show that Landsat-9 was the strongest single-sensor baseline. Among the fusion strategies, Sentinel-2 + Landsat-9 produced the most consistent improvement and reduced performance variability. Landscape-condition analysis further showed that this fusion was most beneficial in shrubland-dominated and high-terrain fires, where it achieved the highest overall mean accuracy and the fewest failures. In contrast, its benefits were less reliable in evergreen forests, mixed vegetation, and low- to moderate-elevation terrain. In operational settings, the Sentinel-2 + Landsat-9 configuration offers a practical solution for post-fire recovery planning, erosion-risk assessment, watershed management, and ecological monitoring when field observations are available and timely satellite-based information is needed.

Landsat↗
DOE OSTI2024

Machine Learning Framework for Conotoxin Class and Molecular Target Prediction

Conotoxins are small and highly potent neurotoxic peptides derived from the venom of marine cone snails which have captured the interest of the scientific community due to their pharmacological potential. These toxins display significant sequence and structure diversity, which results in a wide range of specificities for several different ion channels and receptors. Despite the recognized importance of these compounds, our ability to determine their binding targets and toxicities remains a significant challenge. Predicting the target receptors of conotoxins, based solely on their amino acid sequence, remains a challenge due to the intricate relationships between structure, function, target specificity, and the significant conformational heterogeneity observed in conotoxins with the same primary sequence. We have previously demonstrated that the inclusion of post-translational modifications, collisional cross sections values, and other structural features, when added to the standard primary sequence features, improves the prediction accuracy of conotoxins against non-toxic and other toxic peptides across varied datasets and several different commonly used machine learning classifiers. Here, we present the effects of these features on conotoxin class and molecular target predictions, in particular, predicting conotoxins that bind to nicotinic acetylcholine receptors (nAChRs). We also demonstrate the use of the Synthetic Minority Oversampling Technique (SMOTE)-Tomek in balancing the datasets while simultaneously making the different classes more distinct by reducing the number of ambiguous samples which nearly overlap between the classes. In predicting the alpha, mu, and omega conotoxin classes, the SMOTE-Tomek PCA PLR model, using the combination of the SS and P feature sets establishes the best performance with an overall accuracy (OA) of 95.95%, with an average accuracy (AA) of 93.04%, and an f1 score of 0.959. Using this model, we obtained sensitivities of 98.98%, 89.66%, and 90.48% when predicting alpha, mu, and omega conotoxin classes, respectively. Similarly, in predicting conotoxins that bind to nAChRs, the SMOTE-Tomek PCA SVM model, which used the collisional cross sections (CCSs) and the P feature sets, demonstrated the highest performance with 91.3% OA, 91.32% AA, and an f1 score of 0.9131. The sensitivity when predicting conotoxins that bind to nAChRs is 91.46% with a 91.18% sensitivity when predicting conotoxins that do not bind to nAChRs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Sentiment analysis of the United States public support of nuclear power on social media using large language models

This study utilized large language models (LLMs) to analyze public sentiment in the United States (US) regarding nuclear power on social media, focusing on X/Twitter, considering climate change challenges and advancements in nuclear power technology. Approximately, 1.26 million nuclear tweets from 2008–2023 were examined to fine-tune LLMs for sentiment classification. We found the crucial role of accurate data labeling for model performance, with potential implications for a 15% improvement, achieved through high-confidence labels. LLMs demonstrated better performance compared to traditional machine learning classifiers, with reduced susceptibility to overfitting and up to 96% classification accuracy. LLMs are used to segment the US public tweets into policy and energy-related categories, revealing that 68% are politically themed. Policy tweets tended to convey negative sentiment, often reflecting opposing political perspectives and focusing on nuclear deals and international relations. Energy-related tweets covered diverse topics with predominantly neutral to positive sentiment, indicating broad support for nuclear power in 48 out of 50 US states. The US public positive sentiments toward nuclear power stemmed from its high power density, reliability regardless of weather conditions, environmental benefits, application versatility, and recent innovations and advancements in both fission and fusion technologies. Negative sentiments primarily focused on waste management, high capital costs, and safety concerns. The neutral campaign highlighted global nuclear facts and advancements, with varying tones leaning towards positivity or negativity. An interesting neutral theme was the advocacy for the combined use of renewable and nuclear energy to attain net-zero goals.

Energy & Fuels↗
DOE OSTI2025

Open Specy 1.0: Automated (Hyper)spectroscopy for Microplastics

Microplastic spectral analysis is one of the most time-consuming processes in studying microplastic pollution, often requiring days per sample. Researchers are transitioning to automated batch and hyperspectral image analysis techniques to enhance efficiency. Open Specy, initially aimed at manual single-spectrum analysis, has now integrated automated methods. This updated version, Open Specy 1.0, introduces several new features, including two algorithms for automated processing (smoothing and particle compression), an extensive library containing over 40,000 open-source Raman and FTIR spectra, and two machine learning classifiers (logistic regression and k medoids) developed from this library. Furthermore, it includes a revamped user interface, an R package, and a benchmark data set for testing future advancements in automated techniques. Researchers evaluated various configurations for hyperspectral smoothing, particle identification, compression, and splitting, to achieve combined recovery rates between 50 and 150% particle counts, identities, and sizes with a coefficient of variation (CV) of less than 40% (the accredited standard). Mean absorbance times the standard deviation provided a consistent particle identification. Hyperspectral smoothing led to a 96% combined recovery rate and reduced variability (CV = 38%) compared to the 86% recovery (CV = 83%) of nonsmoothed controls. Additionally, compressing spectra for particles was significantly faster (>3x) and showed similar accuracy but with reduced variability than processing each pixel individually. Key challenges persist in automating spectral analysis, particularly in refining particle splitting algorithms, and improving identification routines to minimize false positives and negatives. In conclusion, new methods in sample preparation for better stabilization and dispersion of particles could overcome some of these issues.

13 HYDRO ENERGY↗
DOE OSTI2025

Leveraging intermediate resonances to probe CP violation at colliders

We explore the phenomenological impact of interference in tree-level contributions to three-body final states in $2\rightarrow 3$ scattering processes. This work introduces a novel search strategy leveraging asymmetries to enable sensitivity to CP-violating effects in less well-explored regions of phase space. Analytically, we demonstrate the effectiveness of this observable in probing interference between Standard Model charged-current decays and effective left-handed vector interactions, illustrated in a toy model featuring a scalar leptoquark, $S_1 \sim (3, 1, -\,1/3)$. Numerically, we apply this framework to studying the process $pp\rightarrow b \tau \nu $; unlike traditional high-$p_T$ searches or “bump hunts”, this approach utilizes an intermediate energy regime – where new physics is neither light enough to be produced on shell or heavy enough to justify an effective field theory treatment. A proof-of-principle analysis at parton level demonstrates a percent-level asymmetry, with sensitivity also to BSM weak-CP phase. While the specific phase sensitivity is diminished at particle level due to showering and detector effects, a machine learning classifier can recover sensitively to the presence of SM-BSM interference, significantly outperforming standard analysis methods. Notably discrimination between BSM signal and SM background could be achieved at the 2$\sigma $ level for the current LHC dataset and 8$\sigma $ at the High-Luminosity LHC. Moreover, this asymmetry observable as defined can also be more broadly applied to other searches for CP-violation in $2\rightarrow 3$ processes in present and future collider environments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Spectrometer-free quantitative vapor sensing and classification via spatiotemporal imaging of porous silicon metasurfaces

Metasurfaces offer a compact platform for optical vapor sensing, but their practical deployment has been limited by weak evanescent light–matter interactions and reliance on spectrally resolved instrumentation. Here, we report porous silicon (pSi) metasurfaces for spectrometer-free quantitative detection of volatile organic compounds (VOCs) with strongly enhanced light–matter interaction. The engineered porosity increases sensitivity by >100× relative to non-porous dielectric metasurfaces, enabling limits of detection of 1.65 ppm for methanol and 9.1 ppm for ethanol across a broad dynamic range (<10 ppm to >103 ppm). Imaging-based readout provides a lightweight, spectrometer-free pathway for real-time quantitative sensing. Beyond quantitative detection, the mesoporous architecture introduces adsorption–desorption kinetics as an additional information channel. Analysis of the resulting spatiotemporal signatures enables kinetic fingerprinting without reliance on infrared spectral features or surface functionalization, and a lightweight machine-learning classifier differentiates acetone, methanol, ethanol, and isopropanol with 91.6% accuracy. These results establish porous metasurfaces as spatiotemporal sensing elements that couple quantitative vapor detection with kinetic fingerprinting through real-time dynamical responses, enabling low-cost, high-performance optical sensors.

Dash, Tomoshree [Clemson University]↗
DOE OSTI2025

Synthetic Infrasound Data for Machine Learning Detectors

Synthetic data is a powerful tool to generate large amounts of training data for machine learning models. The methods outlined in this report will be used to retrain the deep learning classifier for increased accuracy. Synthetic data will be useful to address the natural class imbalance between the different categories in the original ML work. Additionally, these tools will be applied for a variety of signal analysis methods that would use signals with a known signal-to-noise ratio for validation and testing.

58 GEOSCIENCES↗
NASA NTRS1993

Genetic learning in rule-based and neural systems

The design of neural networks and fuzzy systems can involve complex, nonlinear, and ill-conditioned optimization problems. Often, traditional optimization schemes are inadequate or inapplicable for such tasks. Genetic Algorithms (GA's) are a class of optimization procedures whose mechanics are based on those of natural genetics. Mathematical arguments show how GAs bring substantial computational leverage to search problems, without requiring the mathematical characteristics often necessary for traditional optimization schemes (e.g., modality, continuity, availability of derivative information, etc.). GA's have proven effective in a variety of search tasks that arise in neural networks and fuzzy systems. This presentation begins by introducing the mechanism and theoretical underpinnings of GA's. GA's are then related to a class of rule-based machine learning systems called learning classifier systems (LCS's). An LCS implements a low-level production-system that uses a GA as its primary rule discovery mechanism. This presentation illustrates how, despite its rule-based framework, an LCS can be thought of as a competitive neural network. Neural network simulator code for an LCS is presented. In this context, the GA is doing more than optimizing and objective function. It is searching for an ecology of hidden nodes with limited connectivity. The GA attempts to evolve this ecology such that effective neural network performance results. The GA is particularly well adapted to this task, given its naturally-inspired basis. The LCS/neural network analogy extends itself to other, more traditional neural networks. Conclusions to the presentation discuss the implications of using GA's in ecological search problems that arise in neural and fuzzy systems.

Smith, Robert E.↗
NASA NTRS2010

Confidence-Based Feature Acquisition

Confidence-based Feature Acquisition (CFA) is a novel, supervised learning method for acquiring missing feature values when there is missing data at both training (learning) and test (deployment) time. To train a machine learning classifier, data is encoded with a series of input features describing each item. In some applications, the training data may have missing values for some of the features, which can be acquired at a given cost. A relevant JPL example is that of the Mars rover exploration in which the features are obtained from a variety of different instruments, with different power consumption and integration time costs. The challenge is to decide which features will lead to increased classification performance and are therefore worth acquiring (paying the cost). To solve this problem, CFA, which is made up of two algorithms (CFA-train and CFA-predict), has been designed to greedily minimize total acquisition cost (during training and testing) while aiming for a specific accuracy level (specified as a confidence threshold). With this method, it is assumed that there is a nonempty subset of features that are free; that is, every instance in the data set includes these features initially for zero cost. It is also assumed that the feature acquisition (FA) cost associated with each feature is known in advance, and that the FA cost for a given feature is the same for all instances. Finally, CFA requires that the base-level classifiers produce not only a classification, but also a confidence (or posterior probability).

Wagstaff, Kiri L.↗
NASA NTRS2010

Landmark Detection in Orbital Images Using Salience Histograms

NASA's planetary missions have collected, and continue to collect, massive volumes of orbital imagery. The volume is such that it is difficult to manually review all of the data and determine its significance. As a result, images are indexed and searchable by location and date but generally not by their content. A new automated method analyzes images and identifies "landmarks," or visually salient features such as gullies, craters, dust devil tracks, and the like. This technique uses a statistical measure of salience derived from information theory, so it is not associated with any specific landmark type. It identifies regions that are unusual or that stand out from their surroundings, so the resulting landmarks are context-sensitive areas that can be used to recognize the same area when it is encountered again. A machine learning classifier is used to identify the type of each discovered landmark. Using a specified window size, an intensity histogram is computed for each such window within the larger image (sliding the window across the image). Next, a salience map is computed that specifies, for each pixel, the salience of the window centered at that pixel. The salience map is thresholded to identify landmark contours (polygons) using the upper quartile of salience values. Descriptive attributes are extracted for each landmark polygon: size, perimeter, mean intensity, standard deviation of intensity, and shape features derived from an ellipse fit.

Wagstaff, Kiri L.↗
NASA NTRS2018

Delay Tolerant Network Routing as a Machine Learning Classification Problem

This paper discusses a machine learning-based approach to routing for delay tolerant networks (DTNs) [1]. DTNs are networks which experience frequent disconnections between nodes, uncertainty of an end-to-end path, long one-way trip times, and may have high error rates and asymmetric links. Such networks exist in deep space satellite networks, very rural environments, disaster areas and underwater environments. In this work, we use machine learning classifiers to predict a set of neighboring nodes which are the most likely to deliver a message to a desired location based on message history delivery information.We use the Common Open Research Emulator (CORE) [2] to emulate the DTN environment based on real-world location traces and collect network traffic statistics from the Bundle Protocol implementation IBR-DTN [3]. The software architecture for classification-based routing, analysis and preparation of the network history data and prediction results are discussed.

Delay Tolerant Networks↗