Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data mining”

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 163 records · Page 9

Modern sensitivity analysis - 15651

Sensitivity analysis has been applied to complex models, such as performance assessment models, since at least the advent of computational tools to support such an approach to model evaluation. Initially, sensitivity analysis methods were applied to deterministic models and focused on changing one input variable at a time. Probabilistic modeling opened the door to evaluating changes in all input variables simultaneously. Standardized rank regression methods were primarily used in the last century to evaluate probabilistic models. These methods assume linearity in the rank response of the model to the inputs. At the very least this assumes monotonicity in the response, but for the most part the response needs to be near-linear. This is highly unlikely for performance assessment models that are based on differential equations, multiplication and division of variables that are usually not correlated, and conservatism that is not well understood. There are better statistical methods for evaluating highly non-linear and dynamic probabilistic models. Some of these methods were founded in the data mining industry. This century has seen a rapid development of the internet that led directly to the development of data mining techniques for massive databases. Although the goals were different, these techniques can be adapted to sensitivity analysis for complex probabilistic models, which, also, form large, or even massive, databases. These modern sensitivity analysis procedures assess the importance of every explanatory variable (input parameters) used in a probabilistic model. In practice, this means that for each endpoint of interest, every explanatory variable in the model is associated with a quantitative measure of importance. For a given explanatory variable, the importance value depends on the endpoint of interest. This global approach to sensitivity analysis allows all levels of interactions to be evaluated, so that the variation in the output can be measured at every level of possible interaction. The effects are collected together during sensitivity analysis processing, and then separated out to attribute the overall contribution of each input parameter to the model output. These global sensitivity analysis procedures have the ability to characterize non-linear and non-monotonic relationships between explanatory variables and endpoints of interest. This is critically important because of the need to characterize complex interactions among multiple explanatory variables in PA models that often have non-linear and non-monotonic effects. The options for sensitivity analysis are fully explored, including an evaluation of several methods when applying them to a well-known complex non-linear non-monotonic model. The results clearly demonstrate the relative benefit of using data mining methods over simple statistical approaches such as standardized rank regression. (authors)

97 MATHEMATICS AND COMPUTING↗

Blazing Signature Filter: a library for fast pairwise similarity comparisons

Identifying similarities between datasets is a fundamental task in data mining and has become an integral part of modern scientific investigation. Whether the task is to identify co-expressed genes in large-scale expression surveys or to predict combinations of gene knockouts which would elicit a similar phenotype, the underlying computational task is often a multi-dimensional similarity test. As datasets continue to grow, improvements to the efficiency, sensitivity or specificity of such computation will have broad impacts as it allows scientists to more completely explore the wealth of scientific data. A significant practical drawback of large-scale data mining is the vast majority of pairwise comparisons are unlikely to be relevant, meaning that they do not share a signature of interest. It is therefore essential to efficiently identify these unproductive comparisons as rapidly as possible and exclude them from more time-intensive similarity calculations. The Blazing Signature Filter (BSF) is a highly efficient pairwise similarity algorithm which enables extensive data mining within a reasonable amount of time. The algorithm transforms datasets into binary metrics, allowing it to utilize the computationally efficient bit operators and provide a coarse measure of similarity. As a result, the BSF can scale to high dimensionality and rapidly filter unproductive pairwise comparison. Furthermore, two bioinformatics applications of the tool are presented to demonstrate the ability to scale to billions of pairwise comparisons and the usefulness of this approach.

59 BASIC BIOLOGICAL SCIENCES↗

Application of materials informatics to vapor-grown carbon nanofiber/vinyl ester nanocomposites through self-organizing maps and clustering techniques

Data mining and knowledge discovery techniques were employed herein to acquire new information on the viscoelastic, flexural, compressive, and tensile properties of vapor-grown carbon nanofiber (VGCNF)/vinyl ester (VE) nanocomposites. Formulation and processing factors (curing environment, presence or absence of dispersing agent, mixing method, VGCNF weight fraction, VGCNF type, high-shear mixing time, and sonication time) and testing temperature were utilized as inputs and the true ultimate strength, true yield strength, engineering elastic modulus, engineering ultimate strength, flexural modulus, flexural strength, storage modulus, loss modulus, and tan delta were selected as outputs. The data mining and knowledge discovery algorithms used in this study include self-organizing maps (SOMs) and clustering techniques. SOMs demonstrated that temperature and tan delta had the most significant effects on the output responses followed by the VGCNF high-shear mixing time, and sonication time. SOMs were also used to produce optimal responses using certain combination(s) of inputs. Fuzzy C-means algorithm (FCM) was also applied to discover patterns in the nanocomposite behavior subsequent to a principal component analysis (PCA), which is a dimensionality reduction technique. Utilizing these techniques, the nanocomposite specimens were separated into different clusters based on the testing temperature (30 °C and 120 °C being the most dominant responses), tan delta, high-shear mixing time, and sonication time. Furthermore, the VGCNF/VE specimens were separated into a cluster based on their viscoelastic responses (storage and loss moduli) at the same temperature. The FCM results indicate that, while all nanocomposite properties in the new framework are essential, the viscoelastic responses of the VGCNF/VE specimens are the most significant. Here this work highlights the utility of data mining and knowledge discovery techniques in the context of materials informatics for the discovery of patterns and trends in the material behavior that are not immediately known.

36 MATERIALS SCIENCE↗

Large-Scale Multi-Dimensional Document Clustering on GPU Clusters

Document clustering plays an important role in data mining systems. Recently, a flocking-based document clustering algorithm has been proposed to solve the problem through simulation resembling the flocking behavior of birds in nature. This method is superior to other clustering algorithms, including k-means, in the sense that the outcome is not sensitive to the initial state. One limitation of this approach is that the algorithmic complexity is inherently quadratic in the number of documents. As a result, execution time becomes a bottleneck with large number of documents. In this paper, we assess the benefits of exploiting the computational power of Beowulf-like clusters equipped with contemporary Graphics Processing Units (GPUs) as a means to significantly reduce the runtime of flocking-based document clustering. Our framework scales up to over one million documents processed simultaneously in a sixteennode GPU cluster. Results are also compared to a four-node cluster with higher-end GPUs. On these clusters, we observe 30X-50X speedups, which demonstrates the potential of GPU clusters to efficiently solve massive data mining problems. Such speedups combined with the scalability potential and accelerator-based parallelization are unique in the domain of document-based data mining, to the best of our knowledge.

99 GENERAL AND MISCELLANEOUS↗

A Visual Analytics Approach to Structured Data Analysis to Enhance Nonproliferation and Arms Control Verification Activities

Analysis activities for Nonproliferation and Arms Control verification require the use of many types of data. Tabular structured data, such as Excel spreadsheets and relational databases, have traditionally been used for data mining activities, where specific queries are issued against data to look for matching results. The application of visual analytics tools to structured data enables further exploration of datasets to promote discovery of previously unknown results. This paper discusses the application of a specific visual analytics tool to datasets related to the field of Arms Control and Nonproliferation to promote the use of visual analytics more broadly in this domain. Visual analytics focuses on analytical reasoning facilitated by interactive visual interfaces (Wong and Thomas 2004). It promotes exploratory analysis of data, and complements data mining technologies where known patterns can be mined for. Also with a human in the loop, they can bring in domain knowledge and subject matter expertise. Visual analytics has not widely been applied to this domain. In this paper, we will focus on one type of data: structured data, and show the results of applying a specific visual analytics tool to answer questions in the Arms Control and Nonproliferation domain. We chose to use the T.Rex tool, a visual analytics tool developed at PNNL, which uses a variety of visual exploration patterns to discover relationships in structured datasets, including a facet view, graph view, matrix view, and timeline view. The facet view enables discovery of relationships between categorical information, such as countries and locations. The graph tool visualizes node-link relationship patterns, such as the flow of materials being shipped between parties. The matrix visualization shows highly correlated categories of information. The timeline view shows temporal patterns in data. In this paper, we will use T.Rex with two different datasets to demonstrate how interactive exploration of the data can aid an analyst with arms control and nonproliferation verification activities. Using a dataset from PIERS (PIERS 2014), we will show how container shipment imports and exports can aid an analyst in understanding the shipping patterns between two countries. We will also use T.Rex to examine a collection of research publications from the IAEA International Nuclear Information System (IAEA 2014) to discover collaborations of concern. We hope this paper will encourage the use of visual analytics structured data analytics in the field of nonproliferation and arms control verification. Our paper outlines some of the challenges that exist before broad adoption of these kinds of tools can occur and offers next steps to overcome these challenges.

arms control↗

Prognostics and Health Management of Wind Turbines -- Current Status and Future Opportunities

The global wind industry has seen tremendous growth during the past two decades. However, the industry is challenged by premature component failures, which lead to increased turbine downtime and subsequently, cost of energy for wind power. To mitigate the impacts from these failures, the wind industry has been exploring various areas for improvements ranging from product design, new materials or lubricants, to operation and maintenance (O&M) practices. Condition-based maintenance or prognostics and health management (PHM) has been explored as one enabling technology for improving O&M practices. This chapter provides a brief overview of wind turbine PHM with a focus on operational data mining and condition monitoring of drivetrains. Some future research and development opportunities in wind turbine PHM are also briefly discussed.

17 WIND ENERGY↗

Exploring High-Dimensional Data Space: Identifying Optimal Process Conditions in Photovoltaics: Preprint

We demonstrate how advanced exploratory data analysis coupled to data-mining techniques can be used to scrutinize the high-dimensional data space of photovoltaics in the context of thin films of Al-doped ZnO (AZO), which are essential materials as a transparent conducting oxide (TCO) layer in CuInxGa1-xSe2 (CIGS) solar cells. AZO data space, wherein each sample is synthesized from a differentprocess history and assessed with various characterizations, is transformed, reorganized, and visualized in order to extract optimal process conditions. The data-analysis methods used include parallel coordinates, diffusion maps, and hierarchical agglomerative clustering algorithms combined with diffusion map embedding.

14 SOLAR ENERGY↗

IDENTIFYING ROOF FALL PREDICTORS USING FUZZY CLASSIFICATION

Microseismic monitoring involves placing geophones on the rock surfaces of a mine to record seismic activity. Classification of microseismic mine data can be used to predict seismic events in a mine to mitigate mining hazards, such as roof falls, where properly bolting and bracing the roof is often an insufficient method of preventing weak roofs from destabilizing. In this study, six months of recorded acoustic waveforms from microseismic monitoring in a Pennsylvania limestone mine were analyzed using classification techniques to predict roof falls. Fuzzy classification using features selected for computational ease was applied on the mine data. Both large roof fall events could be predicted using a Roof Fall Index (RFI) metric calculated from the results of the fuzzy classification. RFI was successfully used to resolve the two significant roof fall events and predicted both events by at least 15 hours before visual signs of the roof falls were evident.

42 ENGINEERING↗

On low-rank updates to the singular value and Tucker decompositions

The singular value decomposition is widely used in signal processing and data mining. Since the data often arrives in a stream, the problem of updating matrix decompositions under low-rank modification has been widely studied. Brand developed a technique in 2006 that has many advantages. However, the technique does not directly approximate the updated matrix, but rather its previous low-rank approximation added to the new update, which needs justification. Further, the technique is still too slow for large information processing problems. We show that the technique minimizes the change in error per update, so if the error is small initially it remains small. We show that an updating algorithm for large sparse matrices should be sub-linear in the matrix dimension in order to be practical for large problems, and demonstrate a simple modification to the original technique that meets the requirements.

99 GENERAL AND MISCELLANEOUS↗

DEVELOPING AND EXPLOITING A UNIQUE DATASET FROM SOUTH AFRICAN GOLD MINES FOR SOURCE CHARACTERIZATION AND WAVE PROPAGATION

In this project, we are developing and exploiting a unique seismic dataset to address the characteristics of small seismic events and the associated seismic signals observed at local (< 200 km) and regional (< 2000 km) distances. The dataset is being developed using mining-induced events from three deep gold mines in South Africa recorded on in-mine networks (< 1 km) composed of tens of high-frequency sensors, a network of four broadband stations installed as part of this project at the surface around the mines (1-10 km), and a network of existing broadband seismic stations at local/regional distances (50-1000 km) from the mines. Data acquisition has now been completed and includes: (1) {approx}2 years (2007 and 2008) of continuous recording by the surface broadband array, and (2) tens of thousands of mine tremors in the -3.4 < ML < 4.4 local magnitude range. Events with positive magnitudes are generally well recorded by the surface-mine stations, while magnitudes of 3.0 and larger are seen at regional distances (up to {approx} 600 km) in high-pass filtered recordings. We have now completed the quality control of the in-mine data gathered at the three gold mines included in this project. The quality control consisted of: (1) identification and analysis of outliers among the P- and S-wave travel-time picks reported by the in-mine network operator and (2) verification of sensor orientations. The outliers have been identified through a 'Wadati filter' that searches for the largest subset of P- and S-wave travel-time picks consistent with a medium of uniform wave-speed. They have observed that outliers are generally picked at a few select stations. They have also detected that trigger times were mistakenly reported as origin times by the in-mine network operator, and corrections have been obtained from the intercept times in the Wadati diagrams. Sensor orientations have been verified through rotations into the local ray-coordinate system and, when possible, corrected by correlating waveforms obtained from theoretical and empirical rotation angles. Full moment tensor solutions have been obtained for selected events within the Savuka network volume, with moment magnitudes in the 0.5 < M{sub W} < 2.6 range. The solutions were obtained by inverting P-, SV-, and SH-spectral amplitudes measured on the theoretically rotated waveforms with visually assigned polarities. Most of the solutions have a non-zero implosive contribution (47 out of 76), while a small percentage is purely deviatoric (10 out of 76). The deviatoric moment tensors range from pure double couple to pure non-double couple mechanisms. We have also calibrated the regional stations for seismic coda-derived source spectra and moment magnitude using the envelope methodology of Mayeda et al. (2003). they tie the coda M{sub w} to independent values from waveform modeling. The resulting coda-based source spectra of shallow mining-related events show significant spectral peaking that is not seen in deeper tectonic earthquakes. This coda peaking may be an independent method of identifying shallow events and is similar to coda peaking with previously observed for Nevada explosions, where the frequency of the observed spectral peak correlates with the depth of burial (Murphy et al., 2009).

58 GEOSCIENCES↗

MIC-SVM: Designing A Highly Efficient Support Vector Machine For Advanced Modern Multi-Core and Many-Core Architectures

Support Vector Machine (SVM) has been widely used in data-mining and Big Data applications as modern commercial databases start to attach an increasing importance to the analytic capabilities. In recent years, SVM was adapted to the field of High Performance Computing for power/performance prediction, auto-tuning, and runtime scheduling. However, even at the risk of losing prediction accuracy due to insufficient runtime information, researchers can only afford to apply offline model training to avoid significant runtime training overhead. To address the challenges above, we designed and implemented MICSVM, a highly efficient parallel SVM for x86 based multi-core and many core architectures, such as the Intel Ivy Bridge CPUs and Intel Xeon Phi coprocessor (MIC).

42 ENGINEERING↗

NMSBA-RS21

This report gives introductory guidance on the level of effort required to create a data warehouse for mining data. Numerous tutorials have been provided to demonstrate the process of downloading raw data, processing the raw data, and importing the data into a PostgreSQL database. Additional information and tutorial has been provided on setting up a Hadoop cluster for storing vasts amounts of data. This report has been generated as a deliverable for a New Mexico Small Business Assistance (NMSBA) project.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Hospice Landscape Report

In July 2018, CMS requested assistance from Oak Ridge National Laboratory (ORNL) to provide expert data science support aimed at developing algorithms for data mining of medical data for operational and payment purposes. The project is intended to be exploratory: work is aimed at alleviating challenges associated with improper payments, specifically audit methodologies and targeting and changes to risk scores. Project goals include developing new, sophisticated methods for audit targeting and improved profile– payment error correlations, specifically focused on Medicare Part C, the program under which MAOs provide health care services to beneficiaries. ORNL conducted RADV analyses against RAPS and EDS data as well as a hospice landscape analysis per a January 2015 dataset that included Medicare beneficiaries who were in hospice in 2017 and 2018. Ongoing work under this project also involves development of predictive models for RADV investigations and hospice landscape.

97 MATHEMATICS AND COMPUTING↗

MINING NUCLEAR TRANSIENT DATA THROUGH SYMBOLIC CONVERSION

Dynamic Probabilistic Risk Assessment (DPRA) methodologies generate enormous amounts of data for a very large number of simulations. The data contain temporal information of both the state variables of the simulator and the temporal status of specific systems/components. In order to measure system performances, limitations and resilience, such data need to be carefully analyzed with the objective of discovering the correlations between sequence/timing of events and system dynamics. A first approach toward discovering these correlations from data generated by DPRA methodologies has been performed by organizing scenarios into groups using classification or clustering based algorithms. The identification of the correlations between system dynamics and timing/sequencing of events is performed by observing the temporal distribution of these events in each group of scenarios. Instead of performing “a posteriori” analysis of these correlations, this paper shows how it is possible to identify the correlations implicitly by performing a symbolic conversion of both continuous (temporal profiles of simulator state variables) and discrete (status of systems and components) data. Symbolic conversion is performed for each simulation by properly quantizing both continuous and discrete data and then converting them as a series of symbols. After merging both series together, a temporal phrase is obtained. This phrase preserves duration, coincidence and sequence of both continuous and discrete data in a uniform and consistent manner. In this paper it is also shown that by using specific distance measures, it is still possible to post-process such symbolic data using clustering and classification techniques but in considerably less time since the memory needed to store the data is greatly reduced by the symbolic conversion.

97 MATHEMATICS AND COMPUTING↗

Graph Databases for Large-Scale Healthcare Systems: A Framework for Efficient Data Management and Data Services

Designing a database system for both efficient data management and data services has been one of the enduring challenges in the healthcare domain. In many healthcare systems, data services and data management are often viewed as two orthogonal tasks; data services refer to retrieval and analytic queries such as search, joins, statistical data extraction, and simple data mining algorithms, while data management refers to building error-tolerant and non-redundant database systems. The gap between service and management has resulted in rigid database systems and schemas that do not support effective analytics. We compose a rich graph structure from an abstracted healthcare RDBMS to illustrate how we can fill this gap in practice. We show how a healthcare graph can be automatically constructed from a normalized relational database using the proposed 3NF Equivalent Graph (3EG) transformation.We discuss a set of real world graph queries such as finding self-referrals, shared providers, and collaborative filtering, and evaluate their performance over a relational database and its 3EG-transformed graph. Experimental results show that the graph representation serves as multiple de-normalized tables, thus reducing complexity in a database and enhancing data accessibility of users. Based on this finding, we propose an ensemble framework of databases for healthcare applications.

Park, Yubin↗

Open Research Challenges with Big Data - A Data-Scientist s Perspective

In this paper, we discuss data-driven discovery challenges of the Big Data era. We observe that recent innovations in being able to collect, access, organize, integrate, and query massive amounts of data from a wide variety of data sources have brought statistical data mining and machine learning under more scrutiny and evaluation for gleaning insights from the data than ever before. In that context, we pose and debate the question - Are data mining algorithms scaling with the ability to store and compute? If yes, how? If not, why not? We survey recent developments in the state-of-the-art to discuss emerging and outstanding challenges in the design and implementation of machine learning algorithms at scale. We leverage experience from real-world Big Data knowledge discovery projects across domains of national security, healthcare and manufacturing to suggest our efforts be focused along the following axes: (i) the data science challenge - designing scalable and flexible computational architectures for machine learning (beyond just data-retrieval); (ii) the science of data challenge the ability to understand characteristics of data before applying machine learning algorithms and tools; and (iii) the scalable predictive functions challenge the ability to construct, learn and infer with increasing sample size, dimensionality, and categories of labels. We conclude with a discussion of opportunities and directions for future research.

Big data↗

Structural and Biochemical Characterization of Cinnamoyl-CoA Reductases

Cinnamoyl-coenzyme A reductase (CCR) catalyzes the reduction of hydroxycinnamoyl-coenzyme A (CoA) esters using NADPH to produce hydroxycinnamyl aldehyde precursors in lignin synthesis. Here, the catalytic mechanism and substrate specificity of cinnamoyl-CoA reductases from sorghum (Sorghum bicolor), a strategic plant for bioenergy production, were deduced from crystal structures, site-directed mutagenesis, and kinetic and thermodynamic analyses. Although SbCCR1 displayed higher affinity for caffeoyl-CoA or p-coumaroyl-CoA than for feruloyl-CoA, the enzyme showed significantly higher activity for the latter substrate. Through molecular docking and comparisons between the crystal structures of the Vitis vinifera dihydroflavonol reductase and SbCCR1, residues threonine-154 and tyrosine-310 were pinpointed as being involved in binding CoA-conjugated phenylpropanoids. Threonine-154 of SbCCR1 and other CCRs likely confers strong substrate specificity for feruloyl-CoA over other cinnamoyl-CoA thioesters, and the T154Y mutation in SbCCR1 led to broader substrate specificity and faster turnover. Through data mining using our structural and biochemical information, four additional putative CCR genes were discovered from sorghum genomic data. One of these, SbCCR2, displayed greater activity toward p-coumaroyl-CoA than did SbCCR1, which could imply a role in the synthesis of defense-related lignin. Taken together, these findings provide knowledge about critical residues and substrate preference among CCRs and provide, to our knowledge, the first three-dimensional structure information for a CCR from a monocot species.

Sattler, Steven A.↗