Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “data classification”

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 19 records

Neuromorphic computing for temporal scientific data classification

In this work, we apply a spiking neural network model and an associated memristive neuromorphic implementation to an application in classifying temporal scientific data. We demonstrate that the spiking neural network model achieves comparable results to a previously reported convolutional neural network model, with significantly fewer neurons and synapses required.

Schuman, Catherine↗

Quantum cluster algorithm for data classification

Abstract We present a quantum algorithm for data classification based on the nearest-neighbor learning algorithm. The classification algorithm is divided into two steps: Firstly, data in the same class is divided into smaller groups with sublabels assisting building boundaries between data with different labels. Secondly we construct a quantum circuit for classification that contains multi control gates. The algorithm is easy to implement and efficient in predicting the labels of test data. To illustrate the power and efficiency of this approach, we construct the phase transition diagram for the metal-insulator transition of VO 2 , using limited trained experimental data, where VO 2 is a typical strongly correlated electron materials, and the metallic-insulating phase transition has drawn much attention in condensed matter physics. Moreover, we demonstrate our algorithm on the classification of randomly generated data and the classification of entanglement for various Werner states, where the training sets can not be divided by a single curve, instead, more than one curves are required to separate them apart perfectly. Our preliminary result shows considerable potential for various classification problems, particularly for constructing different phases in materials.

97 MATHEMATICS AND COMPUTING↗

Multisource Data Classification Using A Hybrid Semi-supervised Learning Scheme

In many practical situations thematic classes can not be discriminated by spectral measurements alone. Often one needs additional features such as population density, road density, wetlands, elevation, soil types, etc. which are discrete attributes. On the other hand remote sensing image features are continuous attributes. Finding a suitable statistical model and estimation of parameters is a challenging task in multisource (e.g., discrete and continuous attributes) data classification. In this paper we present a semi-supervised learning method by assuming that the samples were generated by a mixture model, where each component could be either a continuous or discrete distribution. Overall classification accuracy of the proposed method is improved by 12% in our initial experiments.

54 ENVIRONMENTAL SCIENCES↗

Towards AI Based Data Classification for Decision Making During Testing

During the development of high-consequence items, test systems should be capable of differentiating between test failures resulting from narrowly missing requirements versus those indicating potentially catastrophic faults. In many instances, classifying the data corresponds to simply identifying whether measured waveforms have approximately the anticipated shape. Cast in this light, the problem reduces to converting raw data into a form optimal for use with neural network classifiers. This manuscript investigates different means of representing raw data for image classification. Raw data plots and Short Time Fourier Transform (STFT) spectrograms are classified by both custom built, small-scale, Convolution Neural Networks (CNN) and open-source, multi-million parameter, pre-trained deep CNNs. In the case of time varying frequency content, the STFTs provide images with greater detail and can be accurately classified with simpler networks. This requires less memory and runs faster than classifying the raw data using the more sophisticated options—making STFTs optimal for applications with memory constraints. STFTs are not a panacea. In some cases the time-domain signal contains useful information that should not be discarded. Rather than using raw data or STFTs, the images can be constructed from both by using red and green channels of an RGB image to visualize the real and imaginary components of the transform, with the raw data occupying the blue channel.

97 MATHEMATICS AND COMPUTING↗

Methods for data classification

The present invention provides methods for classifying data and uncovering and correcting annotation errors. In particular, the present invention provides a self-organizing, self-correcting algorithm for use in classifying data. Additionally, the present invention provides a method for classifying biological taxa.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Countering Weapons of Mass Destruction Office (CWMD) Data Categorization Study: Chemical, Biological, Radiological, and Nuclear (CBRN) Detection Device Data

Pacific Northwest National Laboratory (PNNL) seeks to address critical questions related to chemical, biological, radiological, and nuclear (CBRN) detection devices. This research aims to enhance the security and understanding of these devices by investigating various aspects of their identification, communication, and functionality. The primary focus is on network security, malware detection, device identification, and intelligence gathering. CBRN data can be categorized in various ways depending on the purpose of CBRN detection devices and the specific context of the applications for analysis. Criteria that can be used to assist in this effort include but are not limited to data type, data protocol, source/destination, application, time, security, and content. This study will inform additional paths for data classification, data profiling, data mapping, and data modeling. This will help the Countering Weapons of Mass Destruction Office (CWMD) better understand their data and make informed decisions based on the insights gained from this study and their application. The CBRN Data Categorization study will include the identification of 5–10 different CBRN detection devices with unique characteristics for assessing and analyzing the data that is being produced by and transmitted from these devices.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

SCOPe: Structural Classification of Proteins—extended, integrating SCOP and ASTRAL data and classification of new structures

Structural Classification of Proteins—extended (SCOPe, http://scop.berkeley.edu) is a database of protein structural relationships that extends the SCOP database. SCOP is a manually curated ordering of domains from the majority of proteins of known structure in a hierarchy according to structural and evolutionary relationships. Development of the SCOP 1.x series concluded with SCOP 1.75. The ASTRAL compendium provides several databases and tools to aid in the analysis of the protein structures classified in SCOP, particularly through the use of their sequences. SCOPe extends version 1.75 of the SCOP database, using automated curation methods to classify many structures released since SCOP 1.75. We have rigorously benchmarked our automated methods to ensure that they are as accurate as manual curation, though there are many proteins to which our methods cannot be applied. SCOPe is also partially manually curated to correct some errors in SCOP. SCOPe aims to be backward compatible with SCOP, providing the same parseable files and a history of changes between all stable SCOP and SCOPe releases. SCOPe also incorporates and updates the ASTRAL database. The latest release of SCOPe, 2.03, contains 59 514 Protein Data Bank (PDB) entries, increasing the number of structures classified in SCOP by 55% and including more than 65% of the protein structures in the PDB.

59 BASIC BIOLOGICAL SCIENCES↗

Data object classification using feature generation through crowdsourcing

In a computing device that implements a data object classification tool, a method for classifying data may include detecting change in spatial coordinates for each of at least two of a set of data objects within a canvas space. Each of the data objects may be associated with a vector of features. A rule set may be generated based on the vector of features associated with each of the at least two data objects. The rule set may use feature(s) that explain the changed spatial coordinates. The data objects may be selectively rearranged within the canvas space by applying the generated rule set to any remaining data objects among the set of data objects so as to assign spatial coordinates to the remaining objects. For each of the data objects, the spatial coordinates may be stored as new semantic feature(s) within the vector of features for that data object.

97 MATHEMATICS AND COMPUTING↗

Enhancing Electron Microscopy Image Classification Using Data Augmentation

Manual labeling for machine learning tasks such as image classification is tedious and labor-intensive; as a result, scientific datasets suitable for deep learning applications are scarce and limited. While data augmentation techniques have shown promise for extending image datasets, very little work has been done to understand the impact of combining multiple augmentation methods sequentially or the limits of their effectiveness when combined. Our work addresses this gap by examining how standard and combinatorial data augmentation affects the performance of machine learning models when trained on small datasets for label classification tasks. For our analysis, we generate single, double and quadruple-augmented datasets for a microscopy image classification task using six standard augmentation methods, and compare the resultant improvements observed in binary classification accuracy with three standard image classification models (DenseNet169, MobileNetV2, ResNet101V2). Our experiments show a non-monotonic relationship between the number of simultaneous augmentation methods and classification accuracy, indicating that there is a trade-off between the degree of augmentation and the model performance. These findings suggest that the optimal number of augmentation methods will vary by domain and use case. We also find that the order in which augmentation methods are applied to a limited dataset matters when combining augmentation schemes, with our use case showing performance differences up to 2.6% when the augmentation order is reversed for double-augmented datasets. Our work offers insights to the limits of data augmentation when working on image classification tasks with limited datasets.

Welsman, Jordan A↗

Characterization of mechanical discontinuities based on data-driven classification of compressional-wave travel times

Wave propagation and diffusive transport phenomena are influenced by the mechanical discontinuities in material. Here this study shows that certain bulk properties of the network of low-velocity mechanical discontinuities (e.g. air-filled cracks) in a material can be characterized by processing compressional-wave travel times using traditional data-driven classification techniques. To that end, we perform three tasks in chronological order: (1) use the discrete fracture network (DFN) method to create two-dimensional (2D) numerical models of crack-bearing material embedded with various types of low-velocity mechanical discontinuities, (2) use the fast marching method (FMM) to simulate the propagation of the wave/diffusion front from a single source through the 2D crack-bearing material to multiple receivers placed on the boundary of the material, and (3) train 9 data-driven classifiers to characterize the crack-bearing materials (i.e. bulk properties of the network of mechanical discontinuities in the crack-bearing material) by learning from the simulations of travel times detected by multiple receivers placed around the crack-bearing material. The classifiers identified the orientation, spatial distribution, and dispersion of the low-velocity mechanical discontinuities. Voting classifier performs the best among the 9 classifiers. For the characterization of bulk dispersion and distribution of discontinuities, the sensors located on the adjacent boundaries are more important; whereas for the characterization of bulk orientation of discontinuities, the sensors located on the opposite side are more important.

42 ENGINEERING↗

Long-Term Information Management (LTIM) of Safeguards Data at Repositories: Phase II

One of the challenges of implementing safeguards for geological repositories will be the long-term preservation of safeguards-related data for 100 years or more. While most countries considering the construction and operation of such facilities agree that safeguards information should be preserved, there are gaps with respect to standardized requirements, guidelines, timescales, and approaches. This study analyzes those gaps and explores research to clarify stakeholder needs, identify current policies, approaches, best practices and international standards, and explores existing safeguards information management infrastructure. The study also attempts to clarify what a safeguards data classification system might look like, how long data should be retained, and how information should be exchanged between stakeholders at different phases of a repository’s life cycle. The analysis produced a variety of recommendations on what information to preserve, how to preserve it, where to store it, retention options and how to exchange information in the long term. Key findings include the use of the globally recognized international records management standard, ISO15489, for guidance on the development of information management systems, and the development of a Key Information File (KIF). The KIF could be used to identify only the most relevant, high-level safeguards information and the history of decision making about the repository. The study also suggests implementing on-site and off-site records storage in digital and physical form; developing a safeguards data classification system; long-term records retention with periodic reviews every 5 to 10 years during each phase of the repository life cycle; and establishing transition procedures well in advance so that data shepherds and records officers can transfer information with incoming facility managers effectively and efficiently. These and other recommendations are further analyzed in this study.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Transparent application-layer/os deeper packet inspector

A computer-implemented method of deep packet inspection (DPI) in a network is provided. The method comprises collecting data packets comprising a number of traffic flows from a number of devices via a number of traffic taps and classifying each traffic flow according to data about network protocol layers of the packets comprising the traffic flow. Application layer metadata is extracted from the packets. Traffic flow classification data and the extracted metadata are ingested into a data cluster and normalized. The normalized classification data and extracted metadata is then correlated to other data sets.

Urias, Vincent↗

Automated identification of 2612 LATE-K and M dwarfs in the lamost commissioning data using classification template fits

We develop a template-fit method to automatically identify and classify late-type K and M dwarfs in spectra from the Large Sky Area Multi-object Fiber Spectroscopic Telescope (LAMOST). A search of the commissioning data, acquired in 2009–2010, yields the identification of 2612 late-K and M dwarfs. The template fit method also provides spectral classification to half a subtype, classifies the stars along the dwarf–subdwarf (dM/sdM/esdM/usdM) metallicity sequence, and provides improved metallicity/gravity information on a finer scale. The automated search and classification is performed using a set of cool star templates assembled from the Sloan Digital Sky Survey spectroscopic database. We show that the stars can be efficiently classified despite shortcomings in the LAMOST commissioning data which include bright sky lines in the red. In particular we find that the absolute and relative strengths of the critical TiO and CaH molecular bands around 7000 Å are cleanly measured, which provides accurate spectral typing from late-K to mid-M, and makes it possible to estimate metallicity classes in a way that is more efficient and reliable than with the use of spectral indices or spectral-index based parameters such as ζ{sub TiO/CaH}. Most of the cool dwarfs observed by LAMOST are found to be metal-rich dwarfs (dM). However, we identify 52 metal-poor M subdwarfs (sdM), 5 very metal-poor extreme subdwarfs (esdM) and 1 probable ultra metal-poor subdwarf (usdM). We use a calibration of spectral type to absolute magnitude and estimate spectroscopic distances for all the stars; we also recover proper motions from the SUPERBLINK and PPMXL catalogs. Our analysis of the estimated transverse motions suggests a mean velocity and standard deviation for the UVW components of velocity to be: 〈U〉=−9.8 km s{sup −1}, σ{sub U} = 35.6 km s{sup −1}; 〈V〉=−22.8 km s{sup −1}, σ{sub V}=30.6 km s{sup −1}; 〈W〉=−7.9 km s{sup −1}, σ{sub W} = 28.4 km s{sup −1}. The resulting values are in general agreement with previous reported results, which yields confidence in our spectral classification and spectroscopic distance estimates, and illustrates the potential for using LAMOST spectra of K and M dwarfs for investigating the chemo-kinematics of the local Galactic disk and halo.

79 ASTRONOMY AND ASTROPHYSICS↗