SEARCH · Search NASA

Results for “data clustering”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Community Energy by Design: A Simulation-Based Design Workflow Using Measured Data Clustering to Calibrate Urban Building Energy Models (UBEMs)

This paper presents a workflow that informs urban design decisions using measured data clustering to calibrate urban building energy models. The method's goal is to support urban design in terms of form, building systems configurations, as well as influencing user behavior aspects in the built environment through a systemic analysis of measured data to develop reliable future-case design scenario energy models. Detailed data on appliance-level electricity use are employed via data clustering to calibrate a urban building energy model for the Mueller community in Austin, TX, USA. The data were collected by the Pecan Street Institute for a year in 2014 from consumers in Austin and other surrounding cities. First, collected energy data were restructured and cleaned from corrupt and/or missing information. Second, in order to identify common energy use patterns, a model-based clustering algorithm for functional data was applied. Behavioral/usage profiles are determined through clustering and translated into usage schedules and behaviors. As a result, an urban building energy model built in the urban modeling interface (umi) was calibrated, with fully calibrated and semi-calibrated buildings, within a maximum calibration error margin of 14% for daily-scale averages. Finally, an illustration of calibrated-urban building energy model design case scenarios is presented, and implications on community energy potential effects are discussed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2023

Informed Feature Selection for Data Clustering of CSP Plant Production

To make concentrating solar power (CSP) more cost competitive, rigourous optimizations must be run to improve plant design and operations. However, these optimizaitons rely on time consuming annual simulations that solve an electricity dispatch scheduling problem to maximize plant revenue. To reduce the runtime of annual dispatch simulations of CSP plants, a data clustering approach is utilized. This approach assumes that like days of revenue and electricity generation can be identified using weather and price data. Although weather and price are important factors for electricity production, this work investigates how thermal energy storage (TES) inventory at the beginning of a day, denoted as Si, can be used as a supplemental feature to group like days. A framework for creating and training a deep neural network to predict Si is proposed. This model is validated and assessed using eleven sets of testing data that were not used during training. Then, the data clustering approach is performed three seperate times with features of weather and price along with either Si from the neural network, Si from the full annual simulation, or no Si. Ultimately, the results suggest that using Si as an additional clustering feature improves the data clustering simulation accuracy by 1.4%.

Tuman, Matthew J. (ORCID:000900038772051X)↗

DOE OSTI2021

Efficient prediction of concentrating solar power plant productivity using data clustering

Concentrating solar power (CSP) plants convert solar energy to electricity and can be deployed with a thermal storage capability to shift electricity generation from time periods with available solar resource to those with high electricity demand or electricity price. Rigorous optimization of plant design and operational strategies can improve the market-competitiveness and commercial viability; however, such optimization may require hundreds of annual performance simulations, each of which can be computationally expensive when including considerations such as optimization of dispatch scheduling, sub-hourly time resolution, and stochastic effects due to uncertain weather or electricity price forecasts. This paper proposes a methodology to reduce the computational burden associated with simulation of electricity yield and revenue for CSP plants over a single- or multi-year period. Data-clustering techniques are employed to select a small number of limited-duration time blocks for simulation that, when appropriately weighted, can reproduce generation and revenue over a single year or within each year of a multi-year period. After selection of appropriate data features and weighting factors defining similarity between time-series profiles, the methodology captured annual revenue within 2.3%, 1.7%, or 1.2% using simulation of 10, 30, or 50 three-day exemplar time blocks, respectively, for each of three single-year location/weather/market scenarios and five plant configurations ranging from low to high solar multiple and storage capacity. When applied to multi-year datasets, the proposed methodology can capture inter-year variability that is unavailable from typical meteorological year (TMY) datasets while simultaneously requiring simulation of less than a single year of data.

14 SOLAR ENERGY↗

DOE OSTI2023

Crowd cluster data in the USA for analysis of human response to COVID-19 events and policies

We provide data on daily social contact intensity of clusters of people at different types of Points of Interest (POI) by zip code in Florida and California. This data is obtained by aggregating fine-scaled details of interactions of people at the spatial resolution of 10 m, which is then normalized as a social contact index. We also provide the distribution of cluster sizes and average time spent in a cluster by POI type. This data will help researchers perform fine-scaled, privacy-preserving analysis of human interaction patterns to understand the drivers of the COVID-19 epidemic spread and mitigation. Current mobility datasets either provide coarse-level metrics of social distancing, such as radius of gyration at the county or province level, or traffic at a finer scale, neither of which is a direct measure of contacts between people. We use anonymized, de-identified, and privacy-enhanced location-based services (LBS) data from opted-in cell phone apps, suitably reweighted to correct for geographic heterogeneities, and identify clusters of people at non-sensitive public areas to estimate fine-scaled contacts.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2022

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2019

Data clustering for the high-resolution alignment of microstructure and strain fields

The emergence of small-scale deformation mapping by a combination of scanning electron microscopy and digital image correlation (SEM-DIC) has enabled full-field investigations into the complex roles of microstructure on microscale deformation mechanisms. However, these investigations are hindered by errors in alignment between the microstructure data, generally acquired by electron backscatter diffraction (EBSD), and the microscale strain data obtained by SEM-DIC. Distortions, stitching artifacts, and spatial resolution differences between microstructure and strain fields can lead to misalignments on the order of μms. This alignment uncertainty introduces error into microstructure-strain localization analyses and precludes the examination of deformation mechanisms near grain boundaries. To improve alignment between EBSD-obtained grain boundaries and SEM-DIC strain data, an approach was created wherein a mantle was first established around the EBSD-acquired grain boundaries. Strain data was then clustered within this mantle using a k-means algorithm to identify grain boundary strain localization, and these boundary points were fit to obtain a continuous curve for each individual boundary. Clustered point outliers, such as those due to grain boundary-local dislocation slip, were statistically identified by using an absolute error threshold and removed from the grain boundary fit. The ending identification of grain boundaries in the microscale strain data is significantly improved from EBSD-identified boundaries.

36 MATERIALS SCIENCE↗

DOE OSTI2023

A Two-Step Time-Series Data Clustering Method for Building-Level Load Profile

Residential and commercial buildings have huge potential to contribute value to improve grid resilience by participating grid services. To reveal the significant value, it is critical to estimate the grid service capability from these buildings. Unlike the large-scale distributed energy resources such as wind and solar farms, those buildings need to participate grid services in aggregation, not by individual. Therefore, it is important to appropriately group buildings for aggregation. The load profiles in the same group will have similar characteristics at the same time step, so grid operators can send the grid service signal to the customer group with a higher chance to respond at that time step. In this paper, we develop a load profile clustering method to classify the building-level load profiles for grid service capability estimation. In our two-step clustering approach, we first calculate the total load consumption for each building, clustering the load profiles based on energy consumption level. Then, we further cluster the load profiles in each energy cluster based on the load shape. The parameter selection for each clustering step is discussed. The proposed method is applied on actual building-level load profiles, and the results have proved the effectiveness of this method.

advanced metering infrastructure (AMI)↗

DOE OSTI2023

A Two-Step Time-Series Data Clustering Method for Building-Level Load Profile

AMI↗

DOE OSTI2023

A Two-Step Time-Series Data Clustering Method for Building-Level Load Profile: Preprint

Residential and commercial buildings have huge potential to contribute value to improve grid resilience by participating grid services. To reveal the significant value, it is critical to estimate the grid service capability from these buildings. Unlike the large-scale distributed energy resources such as wind and solar farms, those buildings need to participate grid services in aggregation, not by individual. Therefore, it is important to appropriately group buildings for aggregation. In this paper, we develop a load profile clustering method to classify the building-level load profiles for grid service capability estimation. In our two-step clustering approach, we first calculate the total load consumption for each building, clustering the load profiles based on energy consumption level. Then, we further cluster the load profiles in each energy cluster based on the load shape. The parameter selection for each clustering step is discussed. The proposed method is applied on actual building-level load profiles, and the results have proved the effectiveness of this method.

advanced metering infrastructure (AMI)↗

DOE OSTI2023

Constraining the dark matter contribution of $\gamma$ rays in clusters of galaxies using Fermi -LAT data

Clusters of galaxies are the largest gravitationally bound systems in the Universe. Their dynamics are dominated by dark matter (DM), which makes them among the best targets for indirect DM searches. We analyze 12 years of data collected by the Fermi Large Area Telescope (Fermi-LAT) in the direction of 49 clusters of galaxies selected for their proximity to the Earth and their high x-ray flux, which makes them the most promising targets. We first create physically motivated models for the DM density around each cluster considering different assumptions for the substructure distribution. Then we perform a combined search for a $\gamma$-ray signal in the Fermi-LAT data between 500 MeV and 1 TeV. We find a signal of $\gamma$ rays potentially associated with DM that is at a statistical significance of 2.5⁢σ-3.0⁢σ when considering a slope for the subhalo mass distribution α =1.9 and minimum mass of M min =10 -6⁢ M ⊙ . The best-fit DM mass and annihilation cross sections for a b⁢$\overline{b}$ annihilation channel are m X =40–60 GeV and $\langle$σ⁢ν$\rangle$=(2–4)×10 -25 cm 3 /s. When we consider α =2.0 and M min =10 -9⁢ M ⊙ , the best fit of the cross section reduces to $\langle$σ⁢ν$\rangle$=(4–10)×10 -26 cm 3 /s. For both DM substructure models there is a tension between the values of $\langle$σ⁢ν$\rangle$ that we find and the upper limits obtained with the nondetection of a $\gamma$-ray flux from Milky Way dwarf spheroidal galaxies. In conclusion, this signal is thus more likely associated with $\gamma$ rays produced in the intracluster region by cosmic rays colliding with gas and photon fields.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Cluster-mining: an approach for determining core structures of metallic nanoparticles from atomic pair distribution function data

Explore the source record for details and available documents.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2021

Improving the Accuracy of Clustering Electric Utility Net Load Data using Dynamic Time Warping

Identifying patterns in electric utility net load data in a time-series format is very useful in preparing the operation for next day. Machine learning algorithms have been used in other domains and those concepts are applied in this paper on real-world net load measurement data. Clustering is the practice of grouping data with similar characteristics as determined by the distance measure. The K-means clustering algorithm is utilized here with actual electric utility data. The paper uses the standard distance measure, Euclidean distance (ED), and compares its performance against the dynamic time warping (DTW) measure. An actual case study with real data is presented, and DTW distance measure-based method observed to result better accuracy compared to the ED based method for substation net load measurements predominantly with residential customers.

clustering↗

DOE OSTI2022

Improving Cosmological Constraints from Galaxy Cluster Number Counts with CMB-cluster-lensing Data: Results from the SPT-SZ Survey and Forecasts for the Future

Abstract We show the improvement to cosmological constraints from galaxy cluster surveys with the addition of cosmic microwave background (CMB)-cluster lensing data. We explore the cosmological implications of adding mass information from the 3.1 σ detection of gravitational lensing of the CMB by galaxy clusters to the Sunyaev–Zel’dovich (SZ) selected galaxy cluster sample from the 2500 deg 2 SPT-SZ survey and targeted optical and X-ray follow-up data. In the ΛCDM model, the combination of the cluster sample with the Planck power spectrum measurements prefers σ 8 Ω m / 0.3 0.5 = 0.831 ± 0.020 . Adding the cluster data reduces the uncertainty on this quantity by a factor of 1.4, which is unchanged whether the 3.1 σ CMB-cluster lensing measurement is included or not. We then forecast the impact of CMB-cluster lensing measurements with future cluster catalogs. Adding CMB-cluster lensing measurements to the SZ cluster catalog of the ongoing SPT-3G survey is expected to improve the expected constraint on the dark energy equation of state w by a factor of 1.3 to σ ( w ) = 0.19. We find the largest improvements from CMB-cluster lensing measurements to be for σ 8 , where adding CMB-cluster lensing data to the cluster number counts reduces the expected uncertainty on σ 8 by respective factors of 2.4 and 3.6 for SPT-3G and CMB-S4.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Data-Driven Clustering and Classification of Outage Patterns with Insights into their Links to Extreme Events

At a global level extreme events have increased in both scale and impact. These events have the potential to affect the electrical grid infrastructure and cause a wide range of outages, which can lead to a disruption in daily patterns, cost millions of dollars and also the loss of life. Currently, to track these outage events there have been various approaches developed ranging from regional to national level quantifications for what defines an outage. However, this variation in methods can potentially lead to subjective decision-making and a lack of proper management in relation to the event. While previous work has made strides in determining spatio-temporal patterns, minimal attention has been given to the type and number of outages an area may be exposed to. The differences in incurred cost and the overall severity of an event between a transformer box malfunction and a hurricane are drastic, and by finding historical signals, we can allow for more efficient management, potentially saving lives and millions of dollars. Here, we leverage unsupervised machine learning techniques to delineate outage patterns among 22 counties within the United States and find that there are clear, segregated clusters (0.93 silhouette) of data which are related by event behavior and underlying cause. This finding will allow for energy stakeholders, policy makers, and researchers to gain a deeper understanding of the extent and severity of historic events and to better prepare for electrical grid infrastructure planning and management.

Koob, Benjamin [ORNL]↗

DOE OSTI2019

Technologies for node-degree based clustering of data sets

Technologies for node-degree based clustering include a computing device to construct a graph that includes multiple vertices corresponding to the data points of a data set. The computing device inserts an edge between each pair of vertices that has a corresponding similarity metric that meets a predetermined threshold similarity metric. The computing device determines a node degree for each vertex in the graph and initializes a cutoff node degree as the lowest node degree of the vertices. The computing device selects a test subset of the graph that includes vertices having a node degree less than or equal to the cutoff node degree. The computing device determines whether the test subset covers the graph and if not increases the cutoff node degree. If the test subset covers the graph, the data points corresponding to the vertices of the test subset are the representative cluster. Other embodiments are described and claimed.

Sitik, Ahmet Can↗

DOE OSTI2020

Description of Sensor Assignment Optimization Method as Deployed on a Multi-Node Cluster

Data analytic methods are being developed to address the problem of how to assign a sensor set in a nuclear facility such that a requisite level of process monitoring capability is realized and that the sensor set is sufficiently rich to determine the status of the individual sensors with respect to need for calibration. There is an awareness in the nuclear industry that data analytics combined with rich sensor sets represent a means to improve operations and reduce costs. In the industry the calibration problem has been previously approached as an empirical data-driven problem with several methods having been developed. However, the experience of the utilities over the past ten years with these methods indicates that the absence of physics-based information renders the data-driven approach less reliable. Complicating factors such as the inherent variability of operation (both equipment alignment and operating condition) can confound a pure data-driven approach while there are no rigorous guidelines for determining what constitutes an adequate sensor set. The solution under development to overcome these shortcomings supplements the data analytic method with process information in a so-called process-constrained data-analytic approach. Simple balance equations are written for generic components (e.g., mechanical pump, valve, and heat exchanger). These do not require a priori knowledge of process parameters, such as heat transfer coefficients or friction factors. All that is needed on the part of the utility user is to identify the components and how they are connected. This report describes the development of a parallel computing capability for determining the optimal sensor set. The optimal sensor set problem suffers from the curse of dimensionality. Computation time increases exponentially as the size of the system grows. To overcome this difficulty a pre-conditioner algorithm is developed to find an approximate solution close the actual solution. This serves as a seed for the full-blown algorithm and acts to constrain the space that must searched. The optimization algorithms are described and the implementation on a parallel computing platform is described. The application of the method to a use case we are solving in collaboration with our utility partner served to illustrate how the default sensor set in a nuclear plant may not provide sufficient coverage to infer sensor calibration status.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2021

Main-sequence Scatter is Real: The Joint Dependence of Galaxy Clustering on Star Formation and Stellar Mass

We present new measurements of the clustering of stellar-mass-complete samples of ∼40,000 SDSS galaxies at z ∼ 0.03 as a joint function of stellar mass and specific star formation rate (sSFR). Our results confirm what Coil et al. find at z ∼ 0.7: galaxy clustering is a stronger function of sSFR at fixed stellar mass than of stellar mass at fixed sSFR. We also find that galaxies above the star-forming main sequence (SFMS) with higher sSFR are less clustered than galaxies below the SFMS with lower sSFR, at a given stellar mass. A similar trend is present for quiescent galaxies. This confirms that main-sequence scatter, and scatter within the quiescent sequence, is physically connected to the large-scale cosmic density field. We compare the resulting galaxy bias versus sSFR, and relative bias versus sSFR ratio, for different galaxy samples across 0 < z < 1.2 to mock galaxy catalogs based on the empirical galaxy evolution model of Behroozi et al. This model fits PRIMUS and DEEP2 clustering data well at intermediate redshift, but agreement with SDSS is not as strong. We show that increasing the correlation between galaxy SFR and halo accretion rate at z ∼ 0 in the model substantially improves agreement with SDSS data. Mock catalogs suggest that central galaxies contribute substantially to the dependence of clustering on sSFR at a given stellar mass and that the signal is not simply an effect of satellite galaxy fraction differences with sSFR. Our results are highly constraining for galaxy evolution models and show that the stellar-to-halo mass relation depends on sSFR.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗