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 55 records · Page 3

Using a Support Vector Machine and a Land Surface Model to Estimate Large-Scale Passive Microwave Temperatures over Snow-Covered Land in North America

A support vector machine (SVM), a machine learning technique developed from statistical learning theory, is employed for the purpose of estimating passive microwave (PMW) brightness temperatures over snow-covered land in North America as observed by the Advanced Microwave Scanning Radiometer (AMSR-E) satellite sensor. The capability of the trained SVM is compared relative to the artificial neural network (ANN) estimates originally presented in [14]. The results suggest the SVM outperforms the ANN at 10.65 GHz, 18.7 GHz, and 36.5 GHz for both vertically and horizontally-polarized PMW radiation. When compared against daily AMSR-E measurements not used during the training procedure and subsequently averaged across the North American domain over the 9-year study period, the root mean squared error in the SVM output is 8 K or less while the anomaly correlation coefficient is 0.7 or greater. When compared relative to the results from the ANN at any of the six frequency and polarization combinations tested, the root mean squared error was reduced by more than 18 percent while the anomaly correlation coefficient was increased by more than 52 percent. Further, the temporal and spatial variability in the modeled brightness temperatures via the SVM more closely agrees with that found in the original AMSR-E measurements. These findings suggest the SVM is a superior alternative to the ANN for eventual use as a measurement operator within a data assimilation framework.

Modeling↗

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↗

Adaptive Learning for Reliability Analysis using Support Vector Machines

A novel algorithm is presented for adaptive learning of an unknown function that separates two regions of a domain.In the context of reliability analysis these two regions represent the failure domain, where a set of constraints or requirements are violated, and a safe domain where they are satisfied. The Limit State Function (LSF) separates these two regions. Evaluating the constraints for a given parameter point requires the evaluation of a computational model that may well be expensive. For this reason we wish to construct a meta-model that can estimate the LSFas accurately as possible, using only a limited amount of training data. This work presents an adaptive strategy employing a Support Vector Machine (SVM) as a meta-model to provide a semi-algebraic approximation of the LSF.We describe an optimization process that is used to select informative parameter points to add to training data at each iteration to improve the accuracy of this approximation. A formulation is introduced for bounding the predictions of the meta-model; in this way we seek to incorporate this aspect of Gaussian Process Models (GPMs) within anSVM meta-model. Finally, we apply our algorithm to two benchmark test cases, demonstrating performance that is comparable with, if not superior, to a standard technique for reliability analysis that employs GPMs

Adaptive learning↗

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↗

Assimilation of Multi-Frequency, Multi-Polarization Passive Microwave Brightness Temperature Observations in North America over Snow-Covered Regions Using Support Vector Machines

Accurately estimating the mass of water within a snowpack (a.k.a. snow water equivalent, or SWE) across regional or continental scales is a challenge. In order to overcome some of the limitations in traditional SWE retrieval algorithms or radiative transfer-based snow emission models, this study explores the use of a support vector machine (SVM) to merge an advanced land surface model within a radiance emission (i.e., brightness temperature) assimilation framework. The goal of direct radiance assimilation is preferable as it avoids inconsistencies in the use of ancillary data between the assimilation system and the independently-generated geophysical retrieval. The impact of assimilating multiple observations simultaneously at different frequency and polarization combinations is then evaluated via comparisons to state-of-the-art SWE and snow depth products as well as available ground-based measurements across North America for the years 2002 through 2011. It is found that assimilation-derived estimates (relative to estimates without assimilation) tend to better agree with state-of-the-art snow products. In addition, an overall improvement in goodness-of-fit statistics for snow estimates is achieved via assimilation when compared against ground-based snow measurements. In addition, these improvements in snow are shown to translate into improvements in streamflow predictions. Specifically, 11 out of the 13 major snow-dominated basins investigated have improved cumulative runoff estimates versus ground-based discharge measurements compared to the no-assimilation scenario. It is proven that a SVM can serve as an efficient and effective observation operator for a snow mass analysis within a radiance assimilation system.

Xue, Yuan↗

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↗

Classifying Aircraft using Velocity Data with Support Vector Machines and Likelihood Ratio Tests

Timely classification of aircraft is important for small unmanned aerial system (sUAS) technologies, such as onboard collision avoidance systems, and aerial perimeter security for prisons and sports venues. This work uses velocity-based metrics to classify multi-rotor sUAS, fixed wings UAS, and general aviation planes using two classification methods: Support Vector Machines (SVM), and Likelihood Ratio (LR) tests. We found that a 96% classification accuracy is achieved when either classifier is trained using average speed derived from flight controller data or radar data and tested with one second of radar data. Further, we show that LR tests perform similarly to SVM for single metric classification. In addition, we present two novel metrics for classifying aircraft: log variance of absolute change in speed, and log variance of relative change in speed. Finally, we discuss challenges associated with training classifiers with flight controller data but testing on radar data.

Logan T Dihel↗

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↗

Using support vector machine for improving protein-protein interaction prediction utilizing domain interactions

Understanding protein interactions is essential to gain insights into the biological processes at the whole cell level. The high-throughput experimental techniques for determining protein-protein interactions (PPI) are error prone and expensive with low overlap amongst them. Although several computational methods have been proposed for predicting protein interactions there is definite room for improvement. Here we present DomainSVM, a predictive method for PPI that uses computationally inferred domain-domain interaction values in a Support Vector Machine framework to predict protein interactions. DomainSVM method utilizes evidence of multiple interacting domains to predict a protein interaction. It outperforms existing methods of PPI prediction by achieving very high explanation ratios, precision, specificity, sensitivity and F-measure values in a 10 fold cross-validation study conducted on the positive and negative PPIs in yeast. A Functional comparison study using GO annotations on the positive and the negative test sets is presented in addition to discussing novel PPI predictions in Salmonella Typhimurium.

59 BASIC BIOLOGICAL SCIENCES↗