Search NASA⌕ Search

SEARCH · Search NASA

Results for “Support Vector Machines”

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 109 records · Page 6

The Selection of Heat Treatment Parameters to Obtain Austempered Ductile Iron with the Required Impact Strength

The effect of austempering parameters on impact energy of non-alloyed cast iron with nodular graphite was examined. The analysis involved the austenitizing temperature in the range of 830-950 °C for the time of 60 min and the austempering temperature in the range of 300-400 °C for the time of 8, 16, 32 and 64 min. The value of the impact energy KV was determined. It has been found that the austenitizing temperature and austempering conditions affect the impact energy of ADI. The conducted analytical studies helped to develop a method for the selection of heat treatment parameters to obtain the ausferritic ductile iron with appropriate impact energy KV. The applied machine learning methods included support vector machine, decision trees, artificial neural networks and the method of variational component analysis.

36 MATERIALS SCIENCE↗

A novel probabilistic regression model for electrical peak demand estimate of commercial and manufacturing buildings

Due to the high cost of electricity in commercial and industrial sectors, demand forecast models have gained increasing attention. However, there are two unresolved issues: (1) Models are not adaptable when exposed to previously unknown data (2) The value of regression methods vs. state-of-the-art machine learning models has not been made apparent before. This study’s goal is to develop probabilistic demand estimation models. Herein, we propose a probabilistic Bayesian regression framework that can not only estimate future demands with high accuracy but also be updated once new information is available. By applying the proposed algorithm to two real-world case studies (commercial and manufacturing), we show a 40.3% and 30.8% improvement in terms of mean absolute error for the two cases. Moreover, the proposed technique outperforms powerful machine learning approaches, including support vector machine by 10.39%, random forest by 6.17%, and multilayer perceptron by 9.14% in terms of mean absolute percentage error.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Delineating Variabilities of Groundwater Level Prediction Across the Agriculturally Intensive Transboundary Aquifers of South Asia

We report the groundwater depletion in South Asia’s Himalayan, transboundary Indus-Ganges-Brahmaputra-Meghna (IGBM) rivers basin is among the highest globally. Given the high irrigation demand and population, groundwater sustainability requires an improved understanding of groundwater systems for the accurate prediction of groundwater levels (GWLs). However, the prediction of groundwater system behaviors is a significant challenge since it is dominated by spatiotemporal and subsurface depth-dependent drivers. Earlier studies that address the challenges are mainly based on the short spatial and temporal extent and/or do not separate the renewable (i.e., shallow) vs nonrenewable (i.e., deeper) groundwater signals. Here, we first identified the variable importance of spatial and depth-dependent drivers on GWL in the IGBM basin. Our results indicate a greater influence of anthropogenic factors (i.e., widespread pumping and increased population) in most parts of the IGBM basin, except in the precipitation-dominated basin of the Brahmaputra. Our next purpose was to delineate a multifactorial approach for GWL prediction using the two most used machine learning models (i.e., support vector machine and feed-forward neural network) in the literature. In general, the machine learning model outputs show a good match in comparison to the GWL from the observation wells (n = 2303 distributed across India and Bangladesh) with some limitations in areas with increased groundwater irrigation. We separately compared the results from shallow (<35 m) and deep (>35 m) observation wells, emphasizing the significance of deep groundwater pumping. Our approach highlights the importance of spatiotemporal to multidepth factors in GWL prediction and can be adopted in other parts of the globe to predict GWLs.

54 ENVIRONMENTAL SCIENCES↗

Differentiation and classification of bacterial endotoxins based on surface enhanced Raman scattering and advanced machine learning

Bacterial endotoxin, a major component of the Gram-negative bacterial outer membrane leaflet, is a lipopolysaccharide shed from bacteria during their growth and infection and can be utilized as a biomarker for bacterial detection. Here, the surface enhanced Raman scattering (SERS) spectra of eleven bacterial endotoxins with an average detection amount of 8.75 pg per measurement have been obtained based on silver nanorod array substrates, and the characteristic SERS peaks have been identified. With appropriate spectral pre-processing procedures, different classical machine learning algorithms, including support vector machine, k-nearest neighbor, random forest, etc., and a modified deep learning algorithm, RamanNet, have been applied to differentiate and classify these endotoxins. It has been found that most conventional machine learning algorithms can attain a differentiation accuracy of >99%, while RamanNet can achieve 100% accuracy. Such an approach has the potential for precise classification of endotoxins and could be used for rapid medical diagnoses and therapeutic decisions for pathogenic infections.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Classification of four-qubit entangled states via machine learning

We apply the support vector machine (SVM) algorithm to derive a set of entanglement witnesses (EW) to identify entanglement patterns in families of four-qubit states. The effectiveness of SVM for practical EW implementations stems from the coarse-grained description of families of equivalent entangled quantum states. The equivalence criteria in our work is based on the stochastic local operations and classical communication classification and the description of the four-qubit entangled Werner states. We numerically verify that the SVM approach provides an effective tool to address the entanglement witness problem when the coarse-grained description of a given family state is available. Here, we also discuss and demonstrate the efficiency of nonlinear kernel SVM methods as applied to four-qubit entangled state classification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Annular Core Research Reactor (ACRR) Pulse Curve Characterization

Reactor pulse characterization at the Annular Core Research Reactor (ACRR) at Sandia Technical Area V (TA-V) is commonly done through photo conductive detection (PCD) and calorimeter detectors. Each of these offer a mode of analyzing a digital signal with different advantages/methods for determination of integrated dose or temporal based metrology. This report outlines a method and code that takes the millions of data points from such detectors and delivers a characteristic pulse trendline through two main methods: digital signal filtration and machine learning, in particular, Support Vector Machines (SVMs). Each method's endpoint is to deliver a characteristic curve for the many bucket environments of ACRR while considering other points of interest including delayed gamma removal for prompt dose metrics. This work draws and adds on previous work detailing the delayed gamma fraction contributions from CINDER simulations of the ACRR. Results from this project show a method to determine characteristic curves in a way that has previously been limited by data set size.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Finding new perovskite halides via machine learning

Advanced materials with improved properties have the potential to fuel future technological advancements. However, identification and discovery of these optimal materials for a specific application is a non-trivial task, because of the vastness of the chemical search space with enormous compositional and configurational degrees of freedom. Materials informatics provides an efficient approach toward rational design of new materials, via learning from known data to make decisions on new and previously unexplored compounds in an accelerated manner. Here, we demonstrate the power and utility of such statistical learning (or machine learning, henceforth referred to as ML) via building a support vector machine (SVM) based classifier that uses elemental features (or descriptors) to predict the formability of a given ABX 3 halide composition (where A and B represent monovalent and divalent cations, respectively, and X is F, Cl, Br, or I anion) in the perovskite crystal structure. The classification model is built by learning from a dataset of 185 experimentally known ABX 3 compounds. After exploring a wide range of features, we identify ionic radii, tolerance factor, and octahedral factor to be the most important factors for the classification, suggesting that steric and geometric packing effects govern the stability of these halides. As a result, the trained and validated models then predict, with a high degree of confidence, several novel ABX 3 compositions with perovskite crystal structure.

36 MATERIALS SCIENCE↗

Prediction of Solar Radiation on Building Rooftops: A Data-Mining Approach

Solar energy technologies offer a clean, renewable, and domestic energy source, and are essential components of a sustainable energy future. The accurate measurement of solar radiation data is essential for optimum site selection of future distributed solar power plants as well as sizing photovoltaic systems. However, solar radiation data are not readily available because measured sequences of radiation values are obtained for a few locations in a country. When the data are available, they are usually at different time periods and spatial scale. The availability of solar radiation data at hourly or daily time scale will enhance the integration of solar energy into electricity generation and promote a sustainable energy future. The ability to generate approximate solar radiation values is often the only practical way to obtain radiation data at hourly or daily time scale. As a result, several models have been developed for estimating solar radiation values based on analytical, numerical simulation, and statistical approaches. However, these models have inherent challenges. We will discuss some of those challenges in this paper. To enhance the prediction of solar radiation values, a novel approach is presented for estimating solar radiation values using support vector machine technique. The approach accounts for unique characteristics that influence solar radiation values. The preliminary results obtained offer useful insights for model enhancements.

machine learning↗

Cyber-Attack Identification of Synchrophasor Data Via VMD and Multifusion SVM

A large amount of synchrophasor data in the wide area measurement system (WAMS) needs to be collected and transmitted to the phasor data concentrator, thereby increasing the possibility of being attacked by hackers. The attacked data are therefore hidden into the normal synchrophasor data so that the synchrophasor data based application will be affected. To remedy this problem, an identification framework is proposed to detect the data cyber-attack in WAMS utilizing variational mode decomposition (VMD) and multifusion support vector machine (MSVM). First, VMD is used to transform the attacked data into multiple modal components. Thereafter, a novel MSVM is employed to classify the deterministic features using the proposed linear combined multikernel (LCM). Further, this LCM can fuse multiple types of features, including the time, frequency, and statistical domains of the synchrophasor data. Utilizing the actual data from FNET/GridEye, different experiments are conducted under multiple attack strengths and types. The results demonstrate that the identification framework has higher precision and robustness compared with other conventional classifiers.

97 MATHEMATICS AND COMPUTING↗

MapReduce SVM Game

Despite technological advances making computing devices faster, smaller, and more prevalent in today's age, data generation and collection has outpaced data processing capabilities. Simply having more compute platforms does not provide a means of addressing challenging problems in the big data era. Rather, alternative processing approaches are needed and the application of machine learning to big data is hugely important. The MapReduce programming paradigm is an alternative to conventional supercomputing approaches, and requires less stringent data passing constrained problem decompositions. Rather, MapReduce relies upon defining a means of partitioning the desired problem so that subsets may be computed independently and recom- bined to yield the net desired result. However, not all machine learning algorithms are amenable to such an approach. Game-theoretic algorithms are often innately distributed, consisting of local interactions between players without requiring a central authority and are iterative by nature rather than requiring extensive retraining. Effectively, a game-theoretic approach to machine learning is well suited for the MapReduce paradigm and provides a novel, alternative new perspective to addressing the big data problem. In this paper we present a variant of our Support Vector Machine (SVM) Game classifier which may be used in a distributed manner, and show an illustrative example of applying this algorithm.

97 MATHEMATICS AND COMPUTING↗

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗

Nuclear Power Fault Diagnostics and Preventative Maintenance Optimization

Operation and maintenance costs for nuclear power plants are very large. Reactors are starting to shut down even after their operating licenses have been extended, because they are not price competitive compared to other energy sources. The nuclear industry is witnessing early closure of nuclear power plants due to economic reasons despite excellent safety records. Therefore, it is imperative to reduce costs to prevent these early closures. This paper showcases recent research into advanced fault diagnostics techniques and preventative maintenance optimization to reduce these maintenance costs. This report focuses on the condensate and feedwater system for both pressurized and boiling water reactor systems. The computerized maintenance management system, which contains the plant’s digital record of all the corrective- and preventative-maintenance work orders, was used as a ground truth to locate potential faults and label the process data as healthy or faulty. Various feature extraction techniques were utilized to further differentiate the faults from the healthy data. Support vectors machines were used to categorize other test sets of process data as healthy or faulty through a cross validation procedure. Similar faults were not found within this system leading to preventative maintenance optimization. Unnecessary amounts of preventative maintenance lead to inflated maintenance costs. This paper summarizes the steps for preventative maintenance optimization from component health determination to recommendation for action. This optimization was completed for condensate pumps, condensate booster pumps, and the respective motors that drive them.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

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]↗

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]↗

A Data-Driven Approach for High-Impedance Fault Localization in Distribution Systems

Accurate and quick identification of high-impedance faults (HIFs) is critical for the reliable operation of distribution systems. Unlike other faults in power grids, HIFs are very difficult to detect by conventional overcurrent relays due to the low fault current. Although HIFs can be affected by various factors, the voltage-current characteristics can substantially imply how the system responds to the disturbance and thus provides opportunities to effectively localize HIFs. In this work, we propose a data-driven approach for the identification of HIF events. To tackle the nonlinearity of the voltage-current trajectory, first, we formulate optimization problems to approximate the trajectory with piecewise functions. Then we collect the function features of all segments as inputs and use the support vector machine approach to efficiently identify HIFs at different locations. Numerical studies on the IEEE 123-node test feeder demonstrate the validity and accuracy of the proposed approach for real-time HIF identification.

explainable artificial intelligence↗

A Data-Driven Approach for High-Impedance Fault Localization in Distribution Systems: Preprint

Accurate and quick identification of high-impedance faults (HIFs) is critical for the reliable operation of distribution systems. Unlike other faults in power grids, HIFs are very difficult to detect by conventional overcurrent relays due to the low fault current. Although HIFs can be affected by various factors, the voltage-current characteristics can substantially imply how the system responds to the disturbance and thus provides opportunities to effectively localize HIFs. In this work, we propose a data-driven approach for the identification of HIF events. To tackle the nonlinearity of the voltage-current trajectory, first, we formulate optimization problems to approximate the trajectory with piecewise functions. Then we collect the function features of all segments as inputs and use the support vector machine approach to efficiently identify HIFs at different locations. Numerical studies on the IEEE 123-node test feeder demonstrate the validity and accuracy of the proposed approach for real-time HIF identification.

explainable artificial intelligence↗

QUBO formulations for training machine learning models

Abstract Training machine learning models on classical computers is usually a time and compute intensive process. With Moore’s law nearing its inevitable end and an ever-increasing demand for large-scale data analysis using machine learning, we must leverage non-conventional computing paradigms like quantum computing to train machine learning models efficiently. Adiabatic quantum computers can approximately solve NP-hard problems, such as the quadratic unconstrained binary optimization (QUBO), faster than classical computers. Since many machine learning problems are also NP-hard, we believe adiabatic quantum computers might be instrumental in training machine learning models efficiently in the post Moore’s law era. In order to solve problems on adiabatic quantum computers, they must be formulated as QUBO problems, which is very challenging. In this paper, we formulate the training problems of three machine learning models—linear regression, support vector machine (SVM) and balanced k-means clustering—as QUBO problems, making them conducive to be trained on adiabatic quantum computers. We also analyze the computational complexities of our formulations and compare them to corresponding state-of-the-art classical approaches. We show that the time and space complexities of our formulations are better (in case of SVM and balanced k-means clustering) or equivalent (in case of linear regression) to their classical counterparts.

97 MATHEMATICS AND COMPUTING↗