Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “support vector machine”

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

Multi-Kernel Adaptive Support Vector Machine for Scalable Predictive Maintenance

Application of data-driven solutions across an industry is challenging, since the data are often stored locally, and increasing privacy and security concerns restrict access to the data. In addition, it is highly unlikely that all potential data patterns are captured in a single data source. Because it is highly unlikely that all potential data patterns are captured in a single data source, machine learning (ML) models developed from a single source cannot be robust enough. An alternative is to train the ML model at each source and develop a distributed knowledge discovery and aggregation approach to build global knowledge. In this paper, we develop and demonstrate a distributed ML model, federated transfer learning (FTL), using a multi-kernel-based adaptive support vector machine (MK-A-SVM). For federated learning (FL), the multi-kernel (MK) approach enables feature-specific model aggregation under data heterogeneity; whereas for transfer learning (TL) the adaptive model enables utilization of an aggregated model from a different task. The proposed approach is validated using nuclear power plant (NPP) vertical motor-driven pump data to predict the health condition of vertical motor-driven pumps as an anomaly detection. The efficiency of the proposed approach is also quantified and compared with neural network.

42 ENGINEERING↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

Classification Using Support Vector Machines with Uncertainty Quantification

Binary classification using machine learning is needed to address engineering problems such as identifying passing/failing parts based on measured features from aging hardware. In these classifications, providing the uncertainty of each prediction is essential to support engineering decision making. One popular classifier is the support vector machine (SVM). There are many variations, with the simplest being a linear division between two classes with a hyperplane. Kernel methods can be implement

Taylor, Sofia Nitsche↗

Measurement of the inclusive $t\bar{t}$ production cross section in the lepton + jets channel in $pp$ collisions at $\sqrt{s}$ = 7 TeV with the ATLAS detector using support vector machines

A measurement of the top quark pair-production cross section in the lepton + jets decay channel is presented. It is based on 4.6 fb -1 of $\sqrt{s}$ = 7 TeV pp collision data collected during 2011 by the ATLAS experiment at the CERN Large Hadron Collider. A three-class, multidimensional event classifier based on support vector machines is used to differentiate $t\bar{t}$ events from backgrounds. The $t\bar{t}$ production cross section is found to be σ $t\bar{t}$ = 168.5 ± 0.7(stat)$^{+6.2}_{-5.9}$(syst)$^{+ 3.4}_{-3.2}$(lumi) pb. In conclusion, the result is consistent with the Standard Model prediction based on QCD calculations at next-to-next-to-leading order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian Support Vector Machine (BSVM)

A machine learning based approach is developed to detect events that have rarely been seen in the historical data. The data can include building energy consumption, sensor data, environmental data and any data that may affect the building's energy consumption. The algorithm is a modified nonlinear Bayesian support vector machine, which examines daily energy consumption profile, detect the days with abnormal events, and diagnose the cause of the events.

Source record↗

Open-circuit submodule fault diagnosis in MMCs using support vector machines

Series connection of semiconductor submodules (SM) in a modular multilevel converter (MMC) makes the MMC prone to open-circuit (OC) IGBT failures inside SMs. If left undetected, these faults degrade the operation of the MMC and lead to its instability. This article proposes a method to detect, localise, and classify single OC SM faults in an MMC using support vector machines (SVM) trained with data obtained from the capacitor voltage balancing block of the MMC control system. The proposed method relies on data extracted from the sorted capacitor voltage arrays of the upper and lower phase arms. Therefore, it does not require extra measurements and hardware. Additionally, it offers a fixed time for detecting and localising OC SM faults. This method is easy to implement as SVM has a simple decision function. Time-domain simulation case studies are performed on a three-phase nine-level MMC to evaluate the performance of the proposed method.

42 ENGINEERING↗

Application of a new hybrid particle swarm optimization-mixed kernels function-based support vector machine model for reservoir porosity prediction: A case study in Jacksonburg-Stringtown oil field, West Virginia, USA

Porosity is a fundamental property that characterizes the storage capability of fluid and gas-bearing formations in a reservoir. An accurate porosity value can be measured from core samples in the laboratory; however, core analysis is expensive and time consuming. Well-log data can be used to calculate porosity, but the availability of log suites is often limited in mature fields. Therefore, robust porosity prediction requires integration of core-measured porosity with available well-log suites to control for changes in lithology and fluid content. A support vector machine (SVM) model with mixed kernel function (MKF) is used to construct the relationship between limited conventional well-log suites and sparse core data. Porosity is the desired output, and two conventional well-log responses (gamma ray [GR] and bulk density) and three well-log-derived parameters (the slope of GR, the slope of density, and [Formula: see text]) are input parameters. A global stochastic searching algorithm, particle swarm optimization (PSO), is applied to improve the efficiency of locating the appropriate values of five control parameters in MKF-SVM model. The results of SVM with different traditional kernel functions were compared, and the MKF-SVM model provided an improvement over the traditional SVM model. To confirm the advantage of the hybrid PSO-MKF-SVM model, the results from three models: (1) radial basis function (RBF)-based least-squares SVM, (2) multilayer perceptron artificial neural network (ANN), and (3) RBF ANN, are compared with the result of the hybrid PSO-MKF-SVM model. The results indicate that the hybrid PSO-MKF-SVM model improves porosity prediction with the highest correlation coefficient ([Formula: see text] of 0.9560), the highest coefficient of determination ([Formula: see text] of 0.9140), the lowest root-mean-square error (1.6505), average absolute error value (1.4050), and maximum absolute error (2.717).

Geochemistry & Geophysics↗

Support Vector Machines for Classification of Direct Energy Deposition Standoff Distance for Improved Process Control

A critical factor in the implementation of direct energy deposition is the ability to maintain the standoff distance between the nozzle and the build surface, as this influences powder capture efficiency and overall part quality. Due to process-related variations, layer height may vary, causing unintended variation in standoff distance and poor build quality. While prior work has utilized contact probing to qualify standoff distance during processing, in situ methods for qualification of standoff distance are of major interest. The present work seeks to understand efficacy of image-based methods for classifying standoff distance variation in real-time using support vector machines (SVMs). It was hypothesized that the size of the melt pool and the amount of spatter will have significant correlations with deviations in the standoff distance; thus, SVMs were used on a dataset that is comprised of morphological features of melt pool size and image entropy. The SVM model was used to classify melt pool images into categories according to standoff distance variation from nominal. K-folds cross validation was used to find the optimal hyperparameters for the SVM model. To understand the impact of the selected features on the classification performance and inference speed, multiple models were trained with differing numbers of included features. Results for classification score, inference time, and image preprocessing/feature extraction from these data are reported. The present results show that the SVM model was able to predict the standoff distance classification with an accuracy of 97 percent and a speed of 0.122 s per image, making it a viable solution for real-time control of standoff distance.

Klesmith, Zoe↗

On the Investigation of Phase Fault Classification in Power Grid Signals: A Case Study for Support Vector Machines, Decision Tree and Random Forest

In monitoring the power grid, an ability to differentiate between fault types is essential to ensuring electrical safety. Accordingly, this study introduces a fault detection and classification method by considering different machine learning (ML) and feature extraction (FE) methods combinations. Specifically, the proposed method is established in two classification layers; the first layer determines the fault, and the second layer distinguishes the type of fault. Based on the proposed system model, this study seeks to determine the influential data attributes in a power grid signal using FE methods, including fast Fourier transform, power spectral density (PSD), auto-correlation, and wavelet transform (WT). A cross-comparison of the effectiveness of the Support Vector Machine (SVM), Decision Tree (DT), and Random Forest (RF) is also performed to accomplish the classification layers of the proposed method. The designed algorithm is analyzed under the various combinations of FE and ML methods, and outcomes are presented by considering the trade-off between computational complexity and prediction accuracy. The results reveal that the RF-based ML algorithm shows the most accurate classification performance with PSD, and the most time-saving of the models is the DT WT. Also, SVM emerges superior on a subsequent test of the simulated models on real-world signals.

Galbraith, Kelli↗

PREDICTION OF SOLAR FLARE SIZE AND TIME-TO-FLARE USING SUPPORT VECTOR MACHINE REGRESSION

We study the prediction of solar flare size and time-to-flare using 38 features describing magnetic complexity of the photospheric magnetic field. This work uses support vector regression to formulate a mapping from the 38-dimensional feature space to a continuous-valued label vector representing flare size or time-to-flare. When we consider flaring regions only, we find an average error in estimating flare size of approximately half a geostationary operational environmental satellite (GOES) class. When we additionally consider non-flaring regions, we find an increased average error of approximately three-fourths a GOES class. We also consider thresholding the regressed flare size for the experiment containing both flaring and non-flaring regions and find a true positive rate of 0.69 and a true negative rate of 0.86 for flare prediction. The results for both of these size regression experiments are consistent across a wide range of predictive time windows, indicating that the magnetic complexity features may be persistent in appearance long before flare activity. This is supported by our larger error rates of some 40 hr in the time-to-flare regression problem. The 38 magnetic complexity features considered here appear to have discriminative potential for flare size, but their persistence in time makes them less discriminative for the time-to-flare problem.

79 ASTRONOMY AND ASTROPHYSICS↗