SEARCH · Search NASA

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

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Computational catalyst discovery: Active classification through myopic multiscale sampling

We report the recent boom in computational chemistry has enabled several projects aimed at discovering useful materials or catalysts. We acknowledge and address two recurring issues in the field of computational catalyst discovery. First, calculating macro-scale catalyst properties is not straightforward when using ensembles of atomic-scale calculations [e.g., density functional theory (DFT)]. We attempt to address this issue by creating a multi-scale model that estimates bulk catalyst activity using adsorption energy predictions from both DFT and machine learning models. The second issue is that many catalyst discovery efforts seek to optimize catalyst properties, but optimization is an inherently exploitative objective that is in tension with the explorative nature of early-stage discovery projects. In other words, why invest so much time finding a “best” catalyst when it is likely to fail for some other, unforeseen problem? We address this issue by relaxing the catalyst discovery goal into a classification problem: “What is the set of catalysts that is worth testing experimentally?” Here, we present a catalyst discovery method called myopic multiscale sampling, which combines multiscale modeling with automated selection of DFT calculations. It is an active classification strategy that seeks to classify catalysts as “worth investigating” or “not worth investigating” experimentally. Our results show an ~7–16 times speedup in catalyst classification relative to random sampling. These results were based on offline simulations of our algorithm on two different datasets: a larger, synthesized dataset and a smaller, real dataset.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Scaling the training of particle classification on simulated MicroBooNE events to multiple GPUs

Measurements in Liquid Argon Time Projection Chamber (LArTPC) neutrino detectors, such as the MicroBooNE detector at Fermilab, feature large, high fidelity event images. Deep learning techniques have been extremely successful in classification tasks of photographs, but their application to LArTPC event images is challenging, due to the large size of the events. Events in these detectors are typically two orders of magnitude larger than images found in classical challenges, like recognition of handwritten digits contained in the MNIST database or object recognition in the ImageNet database. Ideally, training would occur on many instances of the entire event data, instead of many instances of cropped regions of interest from the event data. However, such efforts lead to extremely long training cycles, which slow down the exploration of new network architectures and hyperparameter scans to improve the classification performance. We present studies of scaling a LArTPC classification problem on multiple architectures, spanning multiple nodes. The studies are carried out on simulated events in the MicroBooNE detector. We emphasize that it is beyond the scope of this study to optimize networks or extract the physics from any results here. Institutional computing at Pacific Northwest National Laboratory and the SummitDev machine at Oak Ridge National Laboratory’s Leadership Computing Facility have been used. To our knowledge, this is the first use of state-of-the-art Convolutional Neural Networks for particle physics and their attendant compute techniques onto the DOE Leadership Class Facilities. We expect benefits to accrue particularly to the Deep Underground Neutrino Experiment (DUNE) LArTPC program, the flagship US High Energy Physics (HEP) program for the coming decades.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Graph Neural Networks for low-energy event classification & reconstruction in IceCube

IceCube, a cubic-kilometer array of optical sensors built to detect atmospheric and astrophysical neutrinos between 1 GeV and 1 PeV, is deployed 1.45 km to 2.45 km below the surface of the ice sheet at the South Pole. The classification and reconstruction of events from the in-ice detectors play a central role in the analysis of data from IceCube. Reconstructing and classifying events is a challenge due to the irregular detector geometry, inhomogeneous scattering and absorption of light in the ice and, below 100 GeV, the relatively low number of signal photons produced per event. To address this challenge, it is possible to represent IceCube events as point cloud graphs and use a Graph Neural Network (GNN) as the classification and reconstruction method. The GNN is capable of distinguishing neutrino events from cosmic-ray backgrounds, classifying different neutrino event types, and reconstructing the deposited energy, direction and interaction vertex. Based on simulation, we provide a comparison in the 1 GeV–100 GeV energy range to the current state-of-the-art maximum likelihood techniques used in current IceCube analyses, including the effects of known systematic uncertainties. For neutrino event classification, the GNN increases the signal efficiency by 18% at a fixed background rate, compared to current IceCube methods. Alternatively, the GNN offers a reduction of the background (i.e. false positive) rate by over a factor 8 (to below half a percent) at a fixed signal efficiency. For the reconstruction of energy, direction, and interaction vertex, the resolution improves by an average of 13%–20% compared to current maximum likelihood techniques in the energy range of 1 GeV–30 GeV. The GNN, when run on a GPU, is capable of processing IceCube events at a rate nearly double of the median IceCube trigger rate of 2.7 kHz, which opens the possibility of using low energy neutrinos in online searches for transient events.

47 OTHER INSTRUMENTATION↗

DOE OSTI2022

Fast decay of classification error in variational quantum circuits

Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.

Zhang, Bingzhi↗

DOE OSTI2025

SIDDA: SInkhorn Dynamic Domain Adaptation for image classification with equivariant neural networks

Modern neural networks (NNs) often do not generalize well in the presence of a ‘covariate shift’; that is, in situations where the training and test data distributions differ, but the conditional distribution of classification labels given the data remains unchanged. In such cases, NN generalization can be reduced to a problem of learning more robust, domain-invariant features. Domain adaptation (DA) methods include a broad range of techniques aimed at achieving this; however, these methods have struggled with the need for extensive hyperparameter tuning, which then incurs significant computational costs. In this work, we introduce SInkhorn Dynamic Domain Adaptation (SIDDA), an out-of-the-box DA training algorithm built upon the Sinkhorn divergence, that can achieve effective domain alignment with minimal hyperparameter tuning and computational overhead. We demonstrate the efficacy of our method on multiple simulated and real datasets of varying complexity, including simple shapes, handwritten digits, real astronomical observations, and remote sensing data. These datasets exhibit covariate shifts due to noise, blurring, differences between telescopes, and variations in imaging wavelengths. SIDDA is compatible with a variety of NN architectures, and it works particularly well in improving classification accuracy and model calibration when paired with symmetry-aware equivariant NNs (ENNs). We find that SIDDA consistently enhances the generalization capabilities of NNs, achieving up to a ${\approx}40\%$ improvement in classification accuracy on unlabeled target data, while also providing a more modest performance gain of $\lesssim 1\%$ on labeled source data. We also study the efficacy of DA on ENNs with respect to the varying group orders of the dihedral group DN, and find that the model performance improves as the degree of equivariance increases. Finally, if SIDDA achieves proper domain alignment, it also enhances model calibration on both source and target data, with the most significant gains in the unlabeled target domain—achieving over an order of magnitude improvement in the expected calibration error and Brier score. SIDDA’s versatility across various NN models and datasets, combined with its automated approach to domain alignment, has the potential to significantly advance multi-dataset studies by enabling the development of highly generalizable models.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Seismic moment tensor classification using elliptical distribution functions on the hypersphere

Discrimination of underground explosions from naturally occurring earthquakes and other anthropogenic sources is one of the fundamental challenges of nuclear explosion monitoring. In an operational setting, the number of events that can be thoroughly investigated by analysts is limited by available resources. The capability to rapidly screen out events that can be robustly identified as not being explosions is, therefore, of great potential benefit. Nevertheless, possible mis-classification of explosions as earthquakes currently limits the use of screening methods for verification of test-ban treaties. Moment tensors provide a physics-based classification tool for the characterization of different seismic sources and have enabled the advent of new techniques for discriminating between earthquakes and explosions. Following normalization and projection of their six-degree vectors onto the hypersphere, existing screening approaches use spherically symmetric metrics to determine whether any new moment tensor may have been an explosion. Here, we show that populations of moment tensors for both earthquakes and explosions are anisotropically distributed on the hypersphere. Distributions possessing elliptical symmetry, such as the scaled von Mises–Fisher distribution, therefore provide a better description of these populations than the existing spherically symmetric models. We describe a method that uses these elliptical distributions in combination with a Bayesian classifier to achieve successful classification rates of 99 per cent for explosions and 98 per cent for earthquakes using existing catalogues of events from the western United States. The 1983 May 5 Crowdie underground nuclear test and 2018 July 20 DAG-1 deep-borehole chemical explosion are the only two explosions out of 140 that are incorrectly classified. Application of the method to the 2006–2017 nuclear tests in the Democratic People’s Republic of Korea yields 100 per cent identification rates and we provide a simple routine MTid for general usage. The approach provides a means to rapidly assess the likelihood of an event being an explosion and can be built into monitoring workflows that rely on simultaneously assessing multiple different discrimination metrics.

58 GEOSCIENCES↗

DOE OSTI2019

A systematic review of validated suicide outcome classification in observational studies

Abstract Background Suicidal outcomes, including ideation, attempt, and completed suicide, are an important drug safety issue, though few epidemiological studies address the accuracy of suicidal outcome ascertainment. Our primary objective was to evaluate validated methods for suicidal outcome classification in electronic health care database studies. Methods We performed a systematic review of PubMed and EMBASE to identify studies that validated methods for suicidal outcome classification published 1 January 1990 to 15 March 2016. Abstracts and full texts were screened by two reviewers using prespecified criteria. Sensitivity, specificity, and predictive value for suicidal outcomes were extracted by two reviewers. Methods followed PRISMA-P guidelines, PROSPERO Protocol: 2016: CRD42016042794. Results We identified 2202 citations, of which 34 validated the accuracy of measuring suicidal outcomes using International Classification of Diseases (ICD) codes or algorithms, chart review or vital records. ICD E-codes (E950-9) for suicide attempt had 2–19% sensitivity, and 83–100% positive predictive value (PPV). ICD algorithms that included events with ‘uncertain’ intent had 4–70% PPV. The three best-performing algorithms had 74–92% PPV, with improved sensitivity compared with E-codes. Read code algorithms had 14–68% sensitivity and 0–56% PPV. Studies estimated 19–80% sensitivity for chart review, and 41–97% sensitivity and 100% PPV for vital records. Conclusions Pharmacoepidemiological studies measuring suicidal outcomes often use methodologies with poor sensitivity or predictive value or both, which may result in underestimation of associations between drugs and suicidal behaviour. Studies should validate outcomes or use a previously validated algorithm with high PPV and acceptable sensitivity in an appropriate population and data source.

Swain, Richard S.↗

DOE OSTI2020

Spectroscopic classification, variability, and SED of the Fermi -detected CSS 3C 286: the radio-loudest NLS1 galaxy?

ABSTRACT 3C 286 is a well-known calibrator source in radio astronomy. It is also one of very few compact steep-spectrum (CSS) sources detected in γ-rays. Here, we perform a detailed spectroscopic and variability analysis and present the first quasi-simultaneous optical to X-ray spectral energy distribution (SED) in order to reveal physical mechanisms that dominate its emission at different wavelengths, and arrive at a reliable optical source classification. The first main result of our study reveals several pitfalls when applying simple broad- or narrow-line Seyfert 1 (BLS1 or NLS1) classification criteria that only look at the [O iii]–Hβ complex. [O iii] and Hβ can be dominated by the same outflow components, in which case full width at half-maximum (Hβ) is no reliable classification criterion, and extinction by intrinsic or intervening material can make the highest velocity Hβ component undetectable. After careful combination of all information from ultraviolet (UV)–optical spectra along with multiwavelength data, we confirm that 3C 286 can be classified as NLS1 galaxy, with line properties and supermassive black hole mass (of order 108 M⊙ and accreting near the Eddington limit) close to the BLS1 regime, making it an important borderline object. The quasi-simultaneous SED taken with Swift shows a sharp rise in the optical–UV, implying the presence of a strong accretion-disc component with extreme UV excess, consistent with emission-line diagnostics. Finally, we report the discovery of X-ray variability of 3C 286, plausibly dominated by jet emission, and variable by at least a factor of ∼4. This result suggests to exercise caution when using 3C 286 as radio calibrator in high-resolution radio very long baseline interferometry observations.

Yao, Su↗

DOE OSTI2023

The miniJPAS survey quasar selection – II. Machine learning classification with photometric measurements and uncertainties

Astrophysical surveys rely heavily on the classification of sources as stars, galaxies, or quasars from multiband photometry. Surveys in narrow-band filters allow for greater discriminatory power, but the variety of different types and redshifts of the objects present a challenge to standard template-based methods. In this work, which is part of a larger effort that aims at building a catalogue of quasars from the miniJPAS survey, we present a machine learning-based method that employs convolutional neural networks (CNNs) to classify point-like sources including the information in the measurement errors. We validate our methods using data from the miniJPAS survey, a proof-of-concept project of the Javalambre Physics of the Accelerating Universe Astrophysical Survey (J-PAS) collaboration covering ∼1 deg 2 of the northern sky using the 56 narrow-band filters of the J-PAS survey. Due to the scarcity of real data, we trained our algorithms using mocks that were purpose-built to reproduce the distributions of different types of objects that we expect to find in the miniJPAS survey, as well as the properties of the real observations in terms of signal and noise. We compare the performance of the CNNs with other well-established machine learning classification methods based on decision trees, finding that the CNNs improve the classification when the measurement errors are provided as inputs. The predicted distribution of objects in miniJPAS is consistent with the putative luminosity functions of stars, quasars, and unresolved galaxies. Our results are a proof of concept for the idea that the J-PAS survey will be able to detect unprecedented numbers of quasars with high confidence.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

A catalogue of cataclysmic variables from 20 yr of the Sloan Digital Sky Survey with new classifications, periods, trends, and oddities

ABSTRACT We present a catalogue of 507 cataclysmic variables (CVs) observed in SDSS I to IV including 70 new classifications collated from multiple archival data sets. This represents the largest sample of CVs with high-quality and homogeneous optical spectroscopy. We have used this sample to derive unbiased space densities and period distributions for the major sub-types of CVs. We also report on some peculiar CVs, period bouncers and also CVs exhibiting large changes in accretion rates. We report 70 new CVs, 59 new periods, 178 unpublished spectra, and 262 new or updated classifications. From the SDSS spectroscopy, we also identified 18 systems incorrectly identified as CVs in the literature. We discuss the observed properties of 13 peculiar CVS, and we identify a small set of eight CVs that defy the standard classification scheme. We use this sample to investigate the distribution of different CV sub-types, and we estimate their individual space densities, as well as that of the entire CV population. The SDSS I to IV sample includes 14 period bounce CVs or candidates. We discuss the variability of CVs across the Hertzsprung–Russell diagram, highlighting selection biases of variability-based CV detection. Finally, we searched for, and found eight tertiary companions to the SDSS CVs. We anticipate that this catalogue and the extensive material included in the Supplementary Data will be useful for a range of observational population studies of CVs.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

Galaxy morphological classification in deep-wide surveys via unsupervised machine learning

ABSTRACT Galaxy morphology is a fundamental quantity, which is essential not only for the full spectrum of galaxy-evolution studies, but also for a plethora of science in observational cosmology (e.g. as a prior for photometric-redshift measurements and as contextual data for transient light-curve classifications). While a rich literature exists on morphological-classification techniques, the unprecedented data volumes, coupled, in some cases, with the short cadences of forthcoming ‘Big-Data’ surveys (e.g. from the LSST), present novel challenges for this field. Large data volumes make such data sets intractable for visual inspection (even via massively distributed platforms like Galaxy Zoo), while short cadences make it difficult to employ techniques like supervised machine learning, since it may be impractical to repeatedly produce training sets on short time-scales. Unsupervised machine learning, which does not require training sets, is ideally suited to the morphological analysis of new and forthcoming surveys. Here, we employ an algorithm that performs clustering of graph representations, in order to group image patches with similar visual properties and objects constructed from those patches, like galaxies. We implement the algorithm on the Hyper-Suprime-Cam Subaru-Strategic-Program Ultra-Deep survey, to autonomously reduce the galaxy population to a small number (160) of ‘morphological clusters’, populated by galaxies with similar morphologies, which are then benchmarked using visual inspection. The morphological classifications (which we release publicly) exhibit a high level of purity, and reproduce known trends in key galaxy properties as a function of morphological type at z < 1 (e.g. stellar-mass functions, rest-frame colours, and the position of galaxies on the star-formation main sequence). Our study demonstrates the power of unsupervised machine learning in performing accurate morphological analysis, which will become indispensable in this new era of deep-wide surveys.

Martin, G.↗

DOE OSTI2023

CasPEDIA Database: a functional classification system for class 2 CRISPR-Cas enzymes

Abstract CRISPR-Cas enzymes enable RNA-guided bacterial immunity and are widely used for biotechnological applications including genome editing. In particular, the Class 2 CRISPR-associated enzymes (Cas9, Cas12 and Cas13 families), have been deployed for numerous research, clinical and agricultural applications. However, the immense genetic and biochemical diversity of these proteins in the public domain poses a barrier for researchers seeking to leverage their activities. We present CasPEDIA (http://caspedia.org), the Cas Protein Effector Database of Information and Assessment, a curated encyclopedia that integrates enzymatic classification for hundreds of different Cas enzymes across 27 phylogenetic groups spanning the Cas9, Cas12 and Cas13 families, as well as evolutionarily related IscB and TnpB proteins. All enzymes in CasPEDIA were annotated with a standard workflow based on their primary nuclease activity, target requirements and guide-RNA design constraints. Our functional classification scheme, CasID, is described alongside current phylogenetic classification, allowing users to search related orthologs by enzymatic function and sequence similarity. CasPEDIA is a comprehensive data portal that summarizes and contextualizes enzymatic properties of widely used Cas enzymes, equipping users with valuable resources to foster biotechnological development. CasPEDIA complements phylogenetic Cas nomenclature and enables researchers to leverage the multi-faceted nucleic-acid targeting rules of diverse Class 2 Cas enzymes.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2026

Optimal transport for 𝑒/𝜋 0 particle classification in LArTPC neutrino experiments

The efficient classification of electromagnetic activity from 𝜋 0 and electrons remains an open problem in the reconstruction of neutrino interactions in liquid argon time projection chamber (LArTPC) detectors. We address this problem using the mathematical framework of optimal transport (OT), which has been successfully employed for event classification in other high energy physics contexts and is ideally suited to the high-resolution calorimetry of LArTPCs. Using a publicly available simulated dataset from the MicroBooNE Collaboration, we show that OT methods achieve state-of-the-art reconstruction performance in 𝑒/𝜋 0 classification. The success of this first application indicates the broader promise of OT methods for LArTPC-based neutrino experiments.

Neutrino detection↗

DOE OSTI2022

Classification of (2 + 1) D invertible fermionic topological phases with symmetry

Here we provide a classification of invertible topological phases of interacting fermions with symmetry in two spatial dimensions for general fermionic symmetry groups G f and general values of the chiral central charge c - . Here G f is a central extension of a bosonic symmetry group G b by fermion parity, (-1) F , specified by a second cohomology class [ω 2 ]∈ $\mathscr{H}^2$(Gb,$\mathbb{Z}_2$). Our approach proceeds by gauging fermion parity and classifying the resulting G b symmetry-enriched topological orders while keeping track of certain additional data and constraints. We perform this analysis through two perspectives, using G-crossed braided tensor categories and Spin(2c - ) 1 Chern-Simons theory coupled to a background G gauge field. These results give a way to characterize and classify invertible fermionic topological phases in terms of a concrete set of data and consistency equations, which is more physically transparent and computationally simpler than the more abstract methods using cobordism theory and spectral sequences. Our results also generalize and provide a different approach to the recent classification of fermionic symmetry-protected topological phases by Wang and Gu, which have chiral central charge c - = 0. We show how the tenfold way classification of topological insulators and superconductors fits into our scheme, along with general nonperturbative constraints due to certain choices of c - and G f . Mathematically, our results also suggest an explicit general parametrization of deformation classes of (2 + 1)D invertible topological quantum field theories with G f symmetry.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Toward a classification of PT-symmetric quantum systems: From dissipative dynamics to topology and wormholes

Studies of many-body non-Hermitian parity-time (PT)-symmetric quantum systems are attracting a lot of interest due to their relevance in research areas ranging from quantum optics and continuously monitored dynamics to Euclidean wormholes in quantum gravity and dissipative quantum chaos. While a symmetry classification of non-Hermitian systems leads to 38 universality classes, we show that, under certain conditions, PT-symmetric systems are grouped into 24 universality classes. We identify 14 of them in a coupled two-site Sachdev-Ye-Kitaev (SYK) model and confirm the classification by spectral analysis using exact diagonalization techniques. Intriguingly, in 4 of these 14 universality classes, AIII ν , BDI ν † , BDI + + ν , and CI − − ν , we identify a basis in which the SYK Hamiltonian has a block structure in which some blocks are rectangular, with ν ∈ N the difference between the number of rows and columns. We show analytically that this feature leads to the existence of ν robust purely eigenvalues, whose level statistics follow the predictions of Hermitian random matrix theory for classes A, AI, BDI, and CI, respectively. We have recently found that this ν is a topological invariant, so these classes are topological. By contrast, nontopological real eigenvalues display a crossover between Hermitian and non-Hermitian level statistics. Similarly to the case of Lindbladian dynamics, the reduction of universality classes leads to unexpected results, such as the absence of Kramers degeneracy in a given sector of the theory. Another novel feature of the classification scheme is that different sectors of the PT-symmetric Hamiltonian may have different symmetries. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

DOE OSTI2019

Domain Adaptation for Convolutional Neural Networks Based Remote Sensing Scene Classification

Remote sensing (RS) scene classification plays an important role in the field of earth observation. With the rapid development of the remote sensing techniques, a large number of RS scene images are available. Since manually labeling largescale RS scene images is both labor and time consuming, when a new unlabeled dataset is obtained, how to use the existing labeled datasets to classify the new unlabeled images is an important research direction. Different RS scene image datasets may be taken from different type of sensors, and the images may vary from imaging modalities, spatial resolutions and image scales, so the distribution discrepancy exists among different image datasets. As a result, simply applying Convolutional Neural Networks (CNN) trained on source domain cannot accurately classify the images on target domain. Domain Adaptation (DA) can be helpful to solve this problem. In this paper, we design a Subspace Alignment (SA) and CNN based framework to solve the DA problem in RS scene image classification. A new SA layer is proposed and added into CNN models for DA, which could align the source and target domains in some feature subspace. Finetuning the modified CNN model with the added SA layer is able to make the CNN model adapt to the aligned feature subspace and helps to relieve the domain distribution discrepancy. The experiments conducted on two public datasets show that adding the SA layer into CNN can improve the scene classification on target domain.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Outage Cause Classification of Power Distribution Systems with Machine Learning and Real-World Data

Power distribution systems are geographically dispersed by nature. It may be affected by various factors, such as vegetation, weather, animal and human behaviors. Present response procedures to an outage event massively rely on expert experience and thus tend to be time-consuming. Automatic outage event detection and classification will help to reduce the responding and restoration time. However, this issue is less addressed with existing research done in this area. In this applied research, a set of waveform pre-processing techniques are first proposed to prepare the waveform data for being used as inputs to the classification algorithm. Further, a machine learning-based algorithm is proposed to classify the outage events according to their root causes, e.g. tree contact, animal contact, lightning, etc. Available data include three phase current & voltage waveforms and contextual information during the distribution system outages. The proposed machine learning algorithm takes the current and voltage waveforms as direct inputs in search of features that humans are unable to capture. Real data provided by a distribution company in the East Tennessee region is used to test the proposed pre-processing techniques and the classification algorithm.

Sun, Haoyuan↗

DOE OSTI2021

Hierarchical Convolutional Neural Networks for Event Classification on PMU Measurements

Event classification is one of the central components of automated disturbance analysis based on PMU measurements. Obtaining high-quality event labels remains a challenge for supervised learning-based classification of local and system-wide events in power grids due to its labor-intensive requirement. We present a sensitivity study considering rapidly refined, partially and fully inspected event labels that leads to evidence that hierarchical convolutional neural networks (HCNNs) outperform traditional classification models regardless of the quality of the available event labels. Furthermore, it is demonstrated that performance similar to the one obtained using entirely domain-driven labeling can be achieved as long as the involved expert does not mislabel more than ~5% of the event data captured by PMU measurements.

47 OTHER INSTRUMENTATION↗