Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 37 records · Page 2

Machine learning-powered data cleaning for LEGEND: a semi-supervised approach using affinity propagation and support vector machines

Neutrinoless double-beta decay ($0\nu\beta\beta$) is a rare nuclear process that, if observed, will provide insight into the nature of neutrinos and help explain the matter-antimatter asymmetry in the Universe. The large enriched germanium experiment for neutrinoless double-beta decay (LEGEND) will operate in two phases to search for $0\nu\beta\beta$. The first (second) stage will employ 200 (1000) kg of High-Purity Germanium (HPGe) enriched in 76 Ge to achieve a half-life sensitivity of 10 27 (10 28 ) years. In this study, we present a semi-supervised data-driven approach to remove non-physical events captured by HPGe detectors powered by a novel artificial intelligence model. We utilize affinity propagation to cluster waveform signals based on their shape and a support vector machine to classify them into different categories. We train, optimize, and test our model on data taken from a natural abundance HPGe detector installed in the Full Chain Test experimental stand at the University of North Carolina at Chapel Hill. We demonstrate that our model yields a maximum sacrifice of physics events of $0.024 ^{+0.004}_{-0.003} \%$ after data cleaning. Our model is being used to accelerate data cleaning development for LEGEND-200 and will serve to improve data cleaning procedures for LEGEND-1000.

artificial intelligence↗

A One-Class Support Vector Machine Calibration Method for Time Series Change Point Detection

Identifying the change point of a system’s health status is critical. Indeed, a change point usually signifies an incipient fault under development. The One-Class Support Vector Machine (OC-SVM) is a popular machine learning model for anomaly detection that could be used for identifying change points; yet, it is sometimes difficult to obtain a good OC-SVM model that can be used on sensor measurement time series to identify the change points in system health status. In this paper, we propose a novel approach for calibrating OC-SVM models. Our method uses a heuristic search method to find a good set of input data and hyperparameters that yield a well-performing model. Our results on the C-MAPSS dataset demonstrate that OC-SVM can achieve satisfactory accuracy in detecting change point in time series with fewer training data, compared to state-of-the-art deep learning approaches. In our case study, the OC-SVM calibrated by the proposed model is shown to be useful especially in scenarios with limited amount of training data.

42 ENGINEERING↗

Optimal Model-Based Fault Estimation and Correction for Particle Accelerators and Industrial Plants Using Combined Support Vector Machines and First Principles Models

Timely estimation of deviations from optimal performance in complex systems and the ability to identify corrective measures in response to the estimated parameter deviations has been the subject of extensive research over the past four decades. The implications in terms of lost revenue from costly industrial processes, operation of large-scale public works projects and the volume of the published literature on this topic clearly indicates the significance of the problem. Applications range from manufacturing industries (integrated circuits, automotive, etc.), to large-scale chemical plants, pharmaceutical production, power distribution grids, and avionics. In this project we investigated a new framework for building parsimonious models that are suited for diagnosis and fault estimation of complex technical systems. We used Support Vector Machines (SVMs) to model potentially time-varying parameters of a First-Principles (FP) description of the process. The combined SVM & FP model was built (i.e. model parameters were trained) using constrained optimization techniques. We used the trained models to estimate faults affecting simulated beam lifetime. In the case where a large number of process inputs are required for model-based fault estimation, the proposed framework performs an optimal nonlinear principal component analysis of the large-scale input space, and creates a lower dimension feature space in which fault estimation results can be effectively presented to the operation personnel. To fulfill the main technical objectives of the Phase I research, our Phase I efforts have focused on: (1) SVM Training in a Combined Model Structure - We developed the software for the constrained training of the SVMs in a combined model structure, and successfully modeled the parameters of a first-principles model for beam lifetime with support vectors. (2) Higher-order Fidelity of the Combined Model - We used constrained training to ensure that the output of the SVM (i.e. the parameters of the beam lifetime model) are physically meaningful. (3) Numerical Efficiency of the Training - We investigated the numerical efficiency of the SVM training. More specifically, for the primal formulation of the training, we have developed a problem formulation that avoids the linear increase in the number of the constraints as a function of the number of data points. (4) Flexibility of Software Architecture - The software framework for the training of the support vector machines was designed to enable experimentation with different solvers. We experimented with two commonly used nonlinear solvers for our simulations. The primary application of interest for this project has been the sustained optimal operation of particle accelerators at the Stanford Linear Accelerator Center (SLAC). Particle storage rings are used for a variety of applications ranging from 'colliding beam' systems for high-energy physics research to highly collimated x-ray generators for synchrotron radiation science. Linear accelerators are also used for collider research such as International Linear Collider (ILC), as well as for free electron lasers, such as the Linear Coherent Light Source (LCLS) at SLAC. One common theme in the operation of storage rings and linear accelerators is the need to precisely control the particle beams over long periods of time with minimum beam loss and stable, yet challenging, beam parameters. We strongly believe that beyond applications in particle accelerators, the high fidelity and cost benefits of a combined model-based fault estimation/correction system will attract customers from a wide variety of commercial and scientific industries. Even though the acquisition of Pavilion Technologies, Inc. by Rockwell Automation Inc. in 2007 has altered the small business status of the Pavilion and it no longer qualifies for a Phase II funding, our findings in the course of the Phase I research have convinced us that further research will render a workable model-based fault estimation and correction for particle accelerators and industrial plants feasible.

43 PARTICLE ACCELERATORS↗

Support Vector Machines for Estimating Decision Boundaries with Numerical Simulations

Many engineering design problems can be formulated as decisions between two possible options. This is the case, for example, when a quantity of interest must be maintained below or above some threshold. The threshold thereby determines which input parameters lead to which option, and creates a boundary between the two options known as the decision boundary. This report details a machine learning approach for estimating decision boundaries, based on support vector machines (SVMs), that is amenable to large scale computational simulations. Because it is computationally expensive to evaluate each training sample, the approach iteratively estimates the decision boundary in a manner that requires relatively few training samples to glean useful estimates. The approach is then demonstrated on three example problems from structural mechanics and heat transport.

25 ENERGY STORAGE↗

Hybrid feature selection approach for power transformer fault diagnosis based on support vector machine and genetic algorithm

To further improve fault diagnosis accuracy, a new hybrid feature selection approach combined with a genetic algorithm (GA) and support vector machine (SVM) is presented in this study. Adaptive synthetic technique and arctangent transformation method are adopted to improve the statistical property of the training set (IEC TC10 dataset). Five filter methods based on different evaluation metrics are employed to rank 48 input features derived from dissolved gas analysis (DGA). Then, feature combination methods are applied to aggregate feature ranks and form a lower-dimension candidate feature subset. The GA-SVM model is implemented to optimise parameters and select optimal feature subsets. 5-fold cross-validation accuracy of the GA-SVM is used to evaluate fault diagnosis capability of feature subsets and finally, a novel subset is determined as the optimal feature subset. Accuracy comparison manifests the superiority of the optimal feature subsets over that of conventional approaches. Besides, generalisation and robustness of the optimal subset are validated by testing DGA samples from the local power utility. Results indicate that the optimal feature subset obtained by the proposed method can significantly improve the accuracies of power transformer fault diagnosis.

Kari, Tusongjiang↗

Dimension Reduction via Unsupervised Learning Yields Significant Computational Improvements for Support Vector Machine Based Protein Family Classification.

Reducing the dimension of vectors used in training support vector machines (SVMs) results in a proportional speedup in training time. For large-scale problems this can make the difference between tractable and intractable training tasks. However, it is critical that classifiers trained on reduced datasets perform as reliably as their counterparts trained on high-dimensional data. We assessed principal component analysis (PCA) and sequential project pursuit (SPP) as dimension reduction strategies in the biology application of classifying proteins into well-defined functional ‘families’ (SVM-based protein family classification) by their impact on run-time, sensitivity and selectivity. Homology vectors of 4352 elements were reduced to approximately 2% of the original data size without significantly affecting accuracy using PCA and SPP, while leading to approximately a 28-fold speedup in run-time.

59 BASIC BIOLOGICAL SCIENCES↗

A Numerical Comparison of Rule Ensemble Methods and Support Vector Machines

Machine or statistical learning is a growing field that encompasses many scientific problems including estimating parameters from data, identifying risk factors in health studies, image recognition, and finding clusters within datasets, to name just a few examples. Statistical learning can be described as 'learning from data' , with the goal of making a prediction of some outcome of interest. This prediction is usually made on the basis of a computer model that is built using data where the outcomes and a set of features have been previously matched. The computer model is called a learner, hence the name machine learning. In this paper, we present two such algorithms, a support vector machine method and a rule ensemble method. We compared their predictive power on three supernova type 1a data sets provided by the Nearby Supernova Factory and found that while both methods give accuracies of approximately 95%, the rule ensemble method gives much lower false negative rates.

97 MATHEMATICS AND COMPUTING↗

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↗

Measurement of the t$\bar{t}$ cross section at the Run II Tevatron using Support Vector Machines

This dissertation measures the t$\bar{t}$ production cross section at the Run II CDF detector using data from early 2001 through March 2007. The Tevatron at Fermilab is a p$\bar{p}$ collider with center of mass energy √s = 1.96 TeV. This data composes a sample with a time-integrated luminosity measured at 2.2 ± 0.1 fb -1 . A system of learning machines is developed to recognize t$\bar{t}$ events in the 'lepton plus jets' decay channel. Support Vector Machines are described, and their ability to cope with a multi-class discrimination problem is provided. The t$\bar{t}$ production cross section is then measured in this framework, and found to be σ t$\bar{t}$ = 7.14 ± 0.25 (stat) -0.86 +0.61 (sys) pb.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Automated beam placement for breast radiotherapy using a support vector machine based algorithm

Purpose: To develop an automated beam placement technique for whole breast radiotherapy using tangential beams. We seek to find optimal parameters for tangential beams to cover the whole ipsilateral breast (WB) and minimize the dose to the organs at risk (OARs). Methods: A support vector machine (SVM) based method is proposed to determine the optimal posterior plane of the tangential beams. Relative significances of including/avoiding the volumes of interests are incorporated into the cost function of the SVM. After finding the optimal 3-D plane that separates the whole breast (WB) and the included clinical target volumes (CTVs) from the OARs, the gantry angle, collimator angle, and posterior jaw size of the tangential beams are derived from the separating plane equation. Dosimetric measures of the treatment plans determined by the automated method are compared with those obtained by applying manual beam placement by the physicians. The method can be further extended to use multileaf collimator (MLC) blocking by optimizing posterior MLC positions. Results: The plans for 36 patients (23 prone- and 13 supine-treated) with left breast cancer were analyzed. Our algorithm reduced the volume of the heart that receives >500 cGy dose (V5) from 2.7 to 1.7 cm{sup 3} (p = 0.058) on average and the volume of the ipsilateral lung that receives >1000 cGy dose (V10) from 55.2 to 40.7 cm{sup 3} (p = 0.0013). The dose coverage as measured by volume receiving >95% of the prescription dose (V95%) of the WB without a 5 mm superficial layer decreases by only 0.74% (p = 0.0002) and the V95% for the tumor bed with 1.5 cm margin remains unchanged. Conclusions: This study has demonstrated the feasibility of using a SVM-based algorithm to determine optimal beam placement without a physician's intervention. The proposed method reduced the dose to OARs, especially for supine treated patients, without any relevant degradation of dose homogeneity and coverage in general.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

A support vector machine classifier reduces interscanner variation in the HRCT classification of regional disease pattern in diffuse lung disease: Comparison to a Bayesian classifier

Purpose: To investigate the effect of using different computed tomography (CT) scanners on the accuracy of high-resolution CT (HRCT) images in classifying regional disease patterns in patients with diffuse lung disease, support vector machine (SVM) and Bayesian classifiers were applied to multicenter data. Methods: Two experienced radiologists marked sets of 600 rectangular 20 Multiplication-Sign 20 pixel regions of interest (ROIs) on HRCT images obtained from two scanners (GE and Siemens), including 100 ROIs for each of local patterns of lungs-normal lung and five of regional pulmonary disease patterns (ground-glass opacity, reticular opacity, honeycombing, emphysema, and consolidation). Each ROI was assessed using 22 quantitative features belonging to one of the following descriptors: histogram, gradient, run-length, gray level co-occurrence matrix, low-attenuation area cluster, and top-hat transform. For automatic classification, a Bayesian classifier and a SVM classifier were compared under three different conditions. First, classification accuracies were estimated using data from each scanner. Next, data from the GE and Siemens scanners were used for training and testing, respectively, and vice versa. Finally, all ROI data were integrated regardless of the scanner type and were then trained and tested together. All experiments were performed based on forward feature selection and fivefold cross-validation with 20 repetitions. Results: For each scanner, better classification accuracies were achieved with the SVM classifier than the Bayesian classifier (92% and 82%, respectively, for the GE scanner; and 92% and 86%, respectively, for the Siemens scanner). The classification accuracies were 82%/72% for training with GE data and testing with Siemens data, and 79%/72% for the reverse. The use of training and test data obtained from the HRCT images of different scanners lowered the classification accuracy compared to the use of HRCT images from the same scanner. For integrated ROI data obtained from both scanners, the classification accuracies with the SVM and Bayesian classifiers were 92% and 77%, respectively. The selected features resulting from the classification process differed by scanner, with more features included for the classification of the integrated HRCT data than for the classification of the HRCT data from each scanner. For the integrated data, consisting of HRCT images of both scanners, the classification accuracy based on the SVM was statistically similar to the accuracy of the data obtained from each scanner. However, the classification accuracy of the integrated data using the Bayesian classifier was significantly lower than the classification accuracy of the ROI data of each scanner. Conclusions: The use of an integrated dataset along with a SVM classifier rather than a Bayesian classifier has benefits in terms of the classification accuracy of HRCT images acquired with more than one scanner. This finding is of relevance in studies involving large number of images, as is the case in a multicenter trial with different scanners.

60 APPLIED LIFE SCIENCES↗

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↗

Predicting Computer System Failures Using Support Vector Machines

Mitigating the impact of computer failure is possible if accurate failure predictions are provided. Resources, applications, and services can be scheduled around predicted failure and limit the impact. Such strategies are especially important for multi-computer systems, such as compute clusters, that experience a higher rate failure due to the large number of components. However providing accurate predictions with sufficient lead time remains a challenging problem. This paper describes a new spectrum-kernel Support Vector Machine (SVM) approach to predict failure events based on system log files. These files contain messages that represent a change of system state. While a single message in the file may not be sufficient for predicting failure, a sequence or pattern of messages may be. The approach described in this paper will use a sliding window (sub-sequence) of messages to predict the likelihood of failure. The frequency representation of the message sub-sequences observed are then used as input to the SVM that associates the messages to a class of failed or non-failed system. Experimental results using actual system log files from a Linux-based compute cluster indicate the proposed SVM approach can predict hard disk failure with an accuracy of 76% one day in advance.

99 GENERAL AND MISCELLANEOUS↗