Search NASA⌕ Search

SEARCH · Search NASA

Results for “one-class 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.

6 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2009

nu-Anomica: A Fast Support Vector Based Novelty Detection Technique

In this paper we propose nu-Anomica, a novel anomaly detection technique that can be trained on huge data sets with much reduced running time compared to the benchmark one-class Support Vector Machines algorithm. In -Anomica, the idea is to train the machine such that it can provide a close approximation to the exact decision plane using fewer training points and without losing much of the generalization performance of the classical approach. We have tested the proposed algorithm on a variety of continuous data sets under different conditions. We show that under all test conditions the developed procedure closely preserves the accuracy of standard one-class Support Vector Machines while reducing both the training time and the test time by 5 - 20 times.

Das, Santanu↗
NASA NTRSDate not supplied

Natural Language Processing Methods for Air Traffic Management Text and Speech Data

This presentation discusses two efforts of the NARI AI/ML Intern team during the Fall 2021 OSTEM Internship term. For Letters of Agreement (LoA), we have studied how LoAs are structured and explored the question ‘What is an LoA constraint?’ To do this, our approach is data-driven, iterative, and assisted by machine learning when available. In this presentation, we will walk through our tasks of manually scanning through documents, performing a preliminary entity labelling task, and our unsupervised analysis on LoA procedures sections. After this research phase, we define the smallest constraint unit in an LoA, and start to perform entity extraction. Looking towards constraint extraction, we are also exploring the use of a one-class support vector machine (OneClassSVM) model to identify patterns within the data. The second effort of our team this term is focused on Air Traffic Control System Command Center (ATCSCC) advisory meetings, and the subsequent advisory documents that get published from their content. These advisory documents are important to give readily accessible summaries of daily operations, so that data centers, airline officials, and other stakeholders can easily understand the context of these meetings in real time. In applying machine learning to this scenario, two natural language processing tasks are used. First is developing machine learning models to convert the meeting speech data into text. With this text, use of extractive and abstractive text summarization models are used to automatically generate preliminary versions of the advisory documents.

Natural Language Processing↗
NASA NTRS2020

Unsupervised Anomaly Detection in High-Dimensional Flight Data Using Convolutional Variational Auto-Encoder

The modern National Airspace System (NAS) is an extremely safe system and the aviation industry has experienced a steady decrease in fatalities over the years. This can be attributed to both improved flight critical systems with redundant hardware and software protections, as well as an increased focus on active monitoring and response to real time and historically identified vulnerabilities by implementing more resilient procedures and protocols. The main approach for identifying vulnerabilities in operations leverages domain expertise using knowledge about how the system should behave within the expected tolerances to known safety margins. This approach works well when the system has a well-defined operating condition. However, the operations in the NAS can be highly complex with various nuances that render it difficult to clearly pre-define all known safety vulnerabilities. With the advancement of data science and machine learning techniques, the potential to automatically identify emerging vulnerabilities in the observed operations has become more practical in recent years. The state-of-the-art anomaly detection approaches in aerospace data usually rely on supervised or semi-supervised learning. However, in many real-world problems such as flight safety, creating labels for the data requires huge amount of effort and is largely impractical. To address this challenge, we developed a Convolutional Variational Auto-Encoder (CVAE), which is an unsupervised learning approach for anomaly detection in high-dimensional heterogeneous time-series data. We validate performance of CVAE compared to the state-of-the-art supervised learning approach as well as unsupervised clustering-based approach using KMeans++ and kernel-based approach using One-Class Support Vector Machine (OC-SVM) on Yahoo!'s benchmark time series anomaly detection data. Finally, we showcase performance of CVAE on a case study of identifying anomalies in the first 60 seconds of commercial flights' take-offs using Flight Operational Quality Assurance (FOQA) data.

Memarzadeh, Milad↗
NASA NTRSDate not supplied

Enabling Intelligent Data Downlink Prioritization of In-Situ Observations through Generalizable and Computationally Inexpensive Anomaly Detection

High-fidelity measurements of magnetic fields and other observed properties, such as energetic particle fluxes, are a necessary component to our understanding of the highly dynamic near-Earth space environment. As our desire to study smaller-scale phenomena such as shocks and dipolorizations has increased, we have been driven to take and telemeter measurements at higher cadences. Unfortunately, many missions are unable to downlink all their captured data due to the well-known data transmission bottleneck at the DSN. These missions must then prioritize their high-cadence data such that the most scientifically useful intervals are transmitted. One simple prioritization technique uses the spacecraft position to telemeter data from only the region of interest. Although easy to implement, this method does not leverage the available scientific data and can omit intervals of useful scientific data when they lie outside the region of interest. The Magnetospheric Multiscale Mission (MMS) uses mission-specific parameterization of several data products to automatically prioritize scientifically useful intervals. Then, MMS verifies the automatically selected intervals by having a domain expert manually select intervals for downlink. The overall complexity required by this technique make it prohibitive for deployment on low-cost platforms (i.e., CubeSats) or on future missions featuring large constellations of satellites such as the Geospace Dynamics Constellation (GDC). We present preliminary results for a simple, generic, and data-driven method of downlink prioritization for magnetic field (and other) measurements. Specifically, Principal Components Analysis (PCA) and One-Class Support Vector Machines (OC-SVMs) are used to detect intervals containing anomalous activity, which can then be prioritized for subsequent downlink. The computational simplicity of this algorithm makes it an excellent candidate for implementation on spaceflight hardware, as well as provide generalizability to a broad range of missions and data products. Initial analysis of this technique has been performed using magnetic field measurements from the Magnetospheric Multiscale Mission and CASSIOP, where it automatically identified scientifically interesting intervals containing Alfvén waves and EMIC activity.

Matthew G. Finley↗
NASA NTRSDate not supplied

Enabling Intelligent Data Downlink Prioritization of In-Situ Observations through Generalizable and Computationally Inexpensive Anomaly Detection

High-fidelity measurements of magnetic fields and other observed properties, such as energetic particle fluxes, are a necessary component to our understanding of the highly dynamic near-Earth space environment. As our desire to study smaller-scale phenomena such as shocks and dipolorizations has increased, we have been driven to take and telemeter measurements at higher cadences. Unfortunately, many missions are unable to downlink all their captured data due to the well-known data transmission bottleneck at the DSN. These missions must then prioritize their high-cadence data such that the most scientifically useful intervals are transmitted. One simple prioritization technique uses the spacecraft position to telemeter data from only the region of interest. Although easy to implement, this method does not leverage the available scientific data and can omit intervals of useful scientific data when they lie outside the region of interest. The Magnetospheric Multiscale Mission (MMS) uses mission-specific parameterization of several data products to automatically prioritize scientifically useful intervals. Then, MMS verifies the automatically selected intervals by having a domain expert manually select intervals for downlink. The overall complexity required by this technique make it prohibitive for deployment on low-cost platforms (i.e., CubeSats) or on future missions featuring large constellations of satellites such as the Geospace Dynamics Constellation (GDC). We present preliminary results for a simple, generic, and data-driven method of downlink prioritization for magnetic field (and other) measurements. Specifically, Principal Components Analysis (PCA) and One-Class Support Vector Machines (OC-SVMs) are used to detect intervals containing anomalous activity, which can then be prioritized for subsequent downlink. The computational simplicity of this algorithm makes it an excellent candidate for implementation on spaceflight hardware, as well as provide generalizability to a broad range of missions and data products. Initial analysis of this technique has been performed using magnetic field measurements from the Magnetospheric Multiscale Mission and CASSIOP, where it automatically identified scientifically interesting intervals containing Alfvén waves and EMIC activity.

Matthew G. Finley↗
NASA NTRS2011

Sparse Solutions for Single Class SVMs: A Bi-Criterion Approach

In this paper we propose an innovative learning algorithm - a variation of One-class nu Support Vector Machines (SVMs) learning algorithm to produce sparser solutions with much reduced computational complexities. The proposed technique returns an approximate solution, nearly as good as the solution set obtained by the classical approach, by minimizing the original risk function along with a regularization term. We introduce a bi-criterion optimization that helps guide the search towards the optimal set in much reduced time. The outcome of the proposed learning technique was compared with the benchmark one-class Support Vector machines algorithm which more often leads to solutions with redundant support vectors. Through out the analysis, the problem size for both optimization routines was kept consistent. We have tested the proposed algorithm on a variety of data sources under different conditions to demonstrate the effectiveness. In all cases the proposed algorithm closely preserves the accuracy of standard one-class nu SVMs while reducing both training time and test time by several factors.

Das, Santanu↗