Exploring the strength of weak ties to direct active learning for community label prediction.
Abstract not provided.
Hopwood, Michael William↗
SEARCH · Search NASA
Results for “community labeling”
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.
Community detection in hypergraphs via mutual information maximization
Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.
97 MATHEMATICS AND COMPUTING↗
Direction-optimizing Label Propagation and its Application for Community Detection
Label Propagation is a machine learning algorithm typically used for classification. It has also been found to be an effective method for detecting communities in networks. It has two attractive features as a community detection method: it has nearly linear runtime and it requires no \textit{a priori} community information. We propose a new Direction Optimizing Label Propagation Algorithm (DOLPA) that relies on the use of {\em frontiers} and alternates between label {\em push} and label {\em pull} operations to enhance the performance of LPA. Specifically, DOLPA has parameters for tuning the processing order of vertices in a graph. This reduces the number of edges visited and improves the quality of solution. We apply DOLPA to community detection and present the design and implementation of the algorithm as well as its shared-memory parallelization using OpenMP. Empirically, we evaluate our algorithm using synthetic graphs as well as real-world networks. Compared with the state-of-art \textit{Parallel Label Propagation} algorithm, we achieve at least two times the F-Score while reducing the runtime by 50\% for synthetic graphs with overlapping communities. We also compare DOLPA against the state-of-art parallel implementation of the Louvain method using the same graphs and show that DOLPA achieves about three times the F-Score at 10\% the runtime. On real-world graphs, we get a speedup of up to $10\times$ using 64 threads.
Liu, X↗
Exploring the Value of Nodes with Multicommunity Membership for Classification with Graph Convolutional Neural Networks
Sampling is an important step in the machine learning process because it prioritizes samples that help the model best summarize the important concepts required for the task at hand. The process of determining the best sampling method has been rarely studied in the context of graph neural networks. In this paper, we evaluate multiple sampling methods (i.e., ascending and descending) that sample based off different definitions of centrality (i.e., Voterank, Pagerank, degree) to observe its relation with network topology. We find that no sampling method is superior across all network topologies. Additionally, we find situations where ascending sampling provides better classification scores, showing the strength of weak ties. Two strategies are then created to predict the best sampling method, one that observes the homogeneous connectivity of the nodes, and one that observes the network topology. In both methods, we are able to evaluate the best sampling direction consistently.
97 MATHEMATICS AND COMPUTING↗
Space and Terrestrial Considerations for Access to High Energy U.S. Proton Accelerators for the Electronics Community
Explore the source record for details and available documents.
Kenneth A LaBel↗
ClimateNet: an expert-labeled open dataset and deep learning architecture for enabling high-precision analyses of extreme weather
Abstract. Identifying, detecting, and localizing extreme weather events is a crucial first step in understanding how they may vary under different climate change scenarios. Pattern recognition tasks such as classification, object detection, and segmentation (i.e., pixel-level classification) have remained challenging problems in the weather and climate sciences. While there exist many empirical heuristics for detecting extreme events, the disparities between the output of these different methods even for a single event are large and often difficult to reconcile. Given the success of deep learning (DL) in tackling similar problems in computer vision, we advocate a DL-based approach. DL, however, works best in the context of supervised learning – when labeled datasets are readily available. Reliable labeled training data for extreme weather and climate events is scarce. We create “ClimateNet” – an open, community-sourced human-expert-labeled curated dataset that captures tropical cyclones (TCs) and atmospheric rivers (ARs) in high-resolution climate model output from a simulation of a recent historical period. We use the curated ClimateNet dataset to train a state-of-the-art DL model for pixel-level identification – i.e., segmentation – of TCs and ARs. We then apply the trained DL model to historical and climate change scenarios simulated by the Community Atmospheric Model (CAM5.1) and show that the DL model accurately segments the data into TCs, ARs, or “the background” at a pixel level. Further, we show how the segmentation results can be used to conduct spatially and temporally precise analytics by quantifying distributions of extreme precipitation conditioned on event types (TC or AR) at regional scales. The key contribution of this work is that it paves the way for DL-based automated, high-fidelity, and highly precise analytics of climate data using a curated expert-labeled dataset – ClimateNet. ClimateNet and the DL-based segmentation method provide several unique capabilities: (i) they can be used to calculate a variety of TC and AR statistics at a fine-grained level; (ii) they can be applied to different climate scenarios and different datasets without tuning as they do not rely on threshold conditions; and (iii) the proposed DL method is suitable for rapidly analyzing large amounts of climate model output. While our study has been conducted for two important extreme weather patterns (TCs and ARs) in simulation datasets, we believe that this methodology can be applied to a much broader class of patterns and applied to observational and reanalysis data products via transfer learning.
54 ENVIRONMENTAL SCIENCES↗
Structure‐Aware Representation Learning for Effective Performance Prediction
ABSTRACT Application performance is a function of several unknowns stemming from the interactions between the application, runtime, OS, and underlying hardware, making it challenging to model performance using deep learning techniques, especially without a large labeled dataset. Collecting such labeled longitudinal datasets can take weeks. Intuitively, developers could save analysis time during code development by taking a comparative approach between multiple applications. However, the unknown dynamic interactions between applications and execution environments make it difficult for deep learning‐based models to predict the performance of new applications. In this paper, we address these problems by presenting a labeled dataset for the community and taking a comparative analysis approach to explore the source code differences between different correct implementations of the same problem. This paper assesses the feasibility of using purely static information, for example, Abstract Syntax Tree (AST), of applications to predict performance change based on code structure. We evaluate several deep learning‐based representation learning techniques for source code and propose an architecture for the tree‐based Long Short‐Term Memory (LSTM) models to discover latent representations for a source code's hierarchical structure. We demonstrate that our proposed architecture enables feed‐forward predictive models to predict change in performance using source code with up to 84% accuracy.
Ramadan, Tarek [Department of Computer Science Tex↗
Sharing the Sun Community Solar Project Data
This database represents a list of community solar projects, complete and pending, identified through various sources. The dataset is updated multiple times per year. The current version is the first file located below. Previous versions of the dataset published before June of 2024 can be found in the dataset below labeled “ARCHIVE_Sharing the Sun Community Solar Project Data_Before 06.24.“ The list has been reviewed but errors may exist, and the list may not be comprehensive. Errors in the sources e.g. press releases may be duplicated in the list. Blank spaces represent missing information. NLR invites input to improve the database including, to correct erroneous information, add missing projects, fill in missing information, and remove inactive projects. Updated information can be submitted to Sudha Kannan ( sudha.kannan@nlr.gov ).
14 SOLAR ENERGY↗
Phenomena Portal: Large- Scale Visual Exploration of Atmospheric Phenomena
The Earth science community is experiencing a high influx of remote sensing data due to recent advancements in sensor technology. This enables the community to extend their research on a larger scale than ever before. Unfortunately, traditional data processing techniques do not scale well to these new, high volume data sources. State-of-the-art machine learning (ML) pipelines have been proven to overcome these burdens in various other fields but are underexploited within the physical sciences community. Moreover, ML is reliant on labeled data, which is currently sparsely available, owing to the fact that ML adoption is still in the early stages within the Earth and atmospheric science communities. To address these issues, we developed the Phenomena Portal, a visual exploration tool that uses ML to detect various atmospheric phenomena on a global scale. This allows the Earth and atmospheric science communities to view trends of occurrences of phenomena, identify potential relationships between them, and analyze spatiotemporal patterns over time. These detections can also serve as initial labeled data for ML research pertaining to the respective phenomena. The tool also incorporates feedback from subject matter experts to further improve the model detection accuracy, thereby facilitating human-in-the-loop. This presentation will provide an overview of the ML model development and cloud deployment. We also discuss the capabilities of the user interface for displaying the detections.
Muthukumaran Ramasubramanian↗
Culturability as an indicator of succession in microbial communities
Successional theory predicts that opportunistic species with high investment of energy in reproduction and wide niche width will be replaced by equilibrium species with relatively higher investment of energy in maintenance and narrower niche width as communities develop. Since the ability to rapidly grow into a detectable colony on nonselective agar medium could be considered as characteristic of opportunistic types of bacteria, the percentage of culturable cells may be an indicator of successional state in microbial communities. The ratios of culturable cells (colony forming units on R2A agar) to total cells (acridine orange direct microscopic counts) and culturable cells to active cells (reduction of 5-cyano-2,3-ditolyl tetrazolium chloride) were measured over time in two types of laboratory microcosms (the rhizosphere of hydroponically grown wheat and aerobic, continuously stirred tank reactors containing plant biomass) to determine the effectiveness of culturabilty as an index of successional state. The culturable cell:total cell ratio in the rhizosphere decreased from approximately 0.25 to less than 0.05 during the first 30-50 days of plant growth, and from 0.65 to 0.14 during the first 7 days of operation of the bioreactor. The culturable cell:active cell ratio followed similar trends, but the values were consistently greater than the culturable cell:total cell ratio, and even exceeded I in early samples. Follow-up studies used a cultivation-independent method, terminal restriction fragment length polymorphisms (TRFLP) from whole community DNA, to assess community structure. The number of TRFLP peaks increased with time, while the number of culturable types did not, indicating that the general decrease in culturability is associated with a shift in community structure. The ratio of respired to assimilated C-14-labeled amino acids increased with the age of rhizosphere communities, supporting the hypothesis that a shift in resource allocation from growth to maintenance occurs with time. Results from this work indicate that the percentage of culturable cells may be a useful method for assessing the successional state of microbial communities.
NASA Center KSC↗
Soil Respiration and Microbial Biomass from Soil Incubations with 13C Labeled Additions
This data set provides the respiration and soil microbial biomass data from a series of short and long-term laboratory incubation experiments with 13C labeled substrates to examine how plant communities (forest vs. grassland), edaphic properties, and microbial communities influence C cycling and the long-term fate of C in soil systems. Paired forest and grassland soils from four locations were incubated with 13C labeled glucose in a short-term (144 hours) study while 13C labeled cellulose was added to soils used in the long-term (729 days) study. Soil respiration, microbial biomass, and soil 13C values were monitored throughout the study. Soils were collected from paired forest and grassland locations in the following states in the United States of America: Tennessee (TN), Ohio (OH), Iowa (IA), and Missouri (MO). This dataset contains one data file in comma-separate (*.csv) format.
54 ENVIRONMENTAL SCIENCES↗
Rainforest-to-pasture conversion stimulates soil methanogenesis across the Brazilian Amazon
The Amazon rainforest is a biodiversity hotspot and large terrestrial carbon sink threatened by agricultural conversion. Rainforest-to-pasture conversion stimulates the release of methane, a potent greenhouse gas. The biotic methane cycle is driven by microorganisms; therefore, this study focused on active methane-cycling microorganisms and their functions across land-use types. We collected intact soil cores from three land use types (primary rainforest, pasture, and secondary rainforest) of two geographically distinct areas of the Brazilian Amazon (Santarém, Pará and Ariquemes, Rondônia) and performed DNA stable-isotope probing coupled with metagenomics to identify the active methanotrophs and methanogens. At both locations, we observed a significant change in the composition of the isotope-labeled methane-cycling microbial community across land use types, specifically an increase in the abundance and diversity of active methanogens in pastures. We conclude that a significant increase in the abundance and activity of methanogens in pasture soils could drive increased soil methane emissions. Furthermore, we found that secondary rainforests had decreased methanogenic activity similar to primary rainforests, and thus a potential to recover as methane sinks, making it conceivable for forest restoration to offset greenhouse gas emissions in the tropics. These findings are critical for informing land management practices and global tropical rainforest conservation.
59 BASIC BIOLOGICAL SCIENCES↗
An improved dataset for predicting mammal infecting viruses from genetic sequence information
There have been several attempts to develop machine learning (ML) models to identify human infecting viruses from their genomic sequences, with varying degrees of success. Direct comparison between models is problematic, because these models are typically trained and evaluated on different datasets with alternative data splitting schemes, features, and model performance metrics. In this paper we present a standardized dataset of mammal infecting and non-infecting viral pathogens, refined from the previous work of Mollentze et al. to include the latest literature evidence, roughly doubling the number of curated host-virus records available to the community, and new host target labels, primate and mammal. The new host labels were included for several reasons, including previous reports that classification performance is better at broader taxonomic ranks and the idea that there may be more data for primate infection that might serve as a suitable proxy for zoonotic potential and avoidance of false positives for human infection due to absence of evidence. On this dataset, we report the performance of eight machine learning models for predicting mammal-infecting viruses from their genomic sequences. We find that randomly assigning cases in our improved dataset to training/testing sets, when compared to the original assignments into training/testing in Mollentze et al., increases the overall average ROC AUC of prediction of human infection from 0.663 ± 0.070 to 0.784 ± 0.013, consistent with the reduction in phylogenetic distance between train and test sets (relative entropy change from 3.00 to 0.08). The broadest host category of mammal infection can be predicted most reliably at 0.850 ± 0.020. We share our improved dataset and code to enable standardized comparisons of machine learning methods to predict human host infections. Overall, we have presented preliminary evidence that classification of virus host infection is more tractable at higher taxonomic ranks, that unsurprisingly reducing the phylogenetic distance between training and test sets can improve predictive performance, that peptide kmer features appear to be harmful to out of sample model performance, and we are left with the question of whether models for virus host prediction can reasonably be expected to perform well in out of sample scenarios given the likelihood that viruses do not share a common ancestor. Consistent with this concern, when the data is resampled such that there is no overlap between viral families in training and test sets (relative entropy > 24), models perform no better than random chance at prediction of human infection regardless of whether kmers are included (ROC AUC 0.50 ± 0.08) or not (ROC AUC 0.50 ± 0.04).
59 BASIC BIOLOGICAL SCIENCES↗
Simulating metagenomic stable isotope probing datasets with MetaSIPSim
DNA-stable isotope probing (DNA-SIP) links microorganisms to their in-situ function in diverse environmental samples. Combining DNA-SIP and metagenomics (metagenomic-SIP) allows us to link genomes from complex communities to their specific functions and improves the assembly and binning of these targeted genomes. However, empirical development of metagenomic-SIP methods is hindered by the complexity and cost of these studies. We developed a toolkit, ‘MetaSIPSim,’ to simulate sequencing read libraries for metagenomic-SIP experiments. MetaSIPSim is intended to generate datasets for method development and testing. To this end, we used MetaSIPSim generated data to demonstrate the advantages of metagenomic-SIP over a conventional shotgun metagenomic sequencing experiment. Through simulation we show that metagenomic-SIP improves the assembly and binning of isotopically labeled genomes relative to a conventional metagenomic approach. Improvements were dependent on experimental parameters and on sequencing depth. Community level G + C content impacted the assembly of labeled genomes and subsequent binning, where high community G + C generally reduced the benefits of metagenomic-SIP. Furthermore, when a high proportion of the community is isotopically labeled, the benefits of metagenomic-SIP decline. Finally, the choice of gradient fractions to sequence greatly influences method performance. Metagenomic-SIP is a valuable method for recovering isotopically labeled genomes from complex communities. We show that metagenomic-SIP performance depends on optimization of experimental parameters. MetaSIPSim allows for simulation of metagenomic-SIP datasets which facilitates the optimization and development of metagenomic-SIP experiments and analytical approaches for dealing with these data.
59 BASIC BIOLOGICAL SCIENCES↗
Quantitative DNA Stable Isotope Probing Identifies Active Microorganisms Assimilating Volatile Fatty Acids in Full-Scale Enhanced Biological Phosphorus Removal Processes
Enhanced biological phosphorus removal (EBPR) systems often rely on exogenous carbon sources, such as volatile fatty acids (VFAs), to achieve higher P removal. Here, we employed DNA quantitative stable isotope probing (qSIP) using two VFAs, acetate and propionate, in cyclic anaerobic/aerobic incubations to assess their effects on P cycling and microbial activity with biomass from two full-scale EBPR water resource-recovery facilities that utilize VFA addition. We found that anaerobic VFA uptake preferences differed within known groups of PAOs, such as Candidatus Accumulibacter and Tetrasphaera-affiliated members (e.g., Ca. Phosphoribacter), between the two biomasses. The combination of qSIP with metagenomics identified isotopically labeled phages that were linked to active PAOs, highlighting their potential roles in modulating EBPR community composition and activity. The highest levels of anaerobic labeling from acetate were in genomes belonging to Saccharimonadales and Rickettsiales, which are generally host-associated with bacteria and eukaryotes, respectively. Furthermore, this finding highlights the possibility of cross-feeding between PAO hosts and their parasites or predators, as well as the role of so-far uncharacterized organisms participating in carbon cycling under EBPR conditions. Collectively, these results expand our understanding of the ecological interactions involved in communities anaerobically uptaking VFAs and cycling P that are central to EBPR.
Polyphosphate accumulating organisms↗
Ultra-sensitive isotope probing to quantify activity and substrate assimilation in microbiomes
Abstract Background Stable isotope probing (SIP) approaches are a critical tool in microbiome research to determine associations between species and substrates, as well as the activity of species. The application of these approaches ranges from studying microbial communities important for global biogeochemical cycling to host-microbiota interactions in the intestinal tract. Current SIP approaches, such as DNA-SIP or nanoSIMS allow to analyze incorporation of stable isotopes with high coverage of taxa in a community and at the single cell level, respectively, however they are limited in terms of sensitivity, resolution or throughput. Results Here, we present an ultra-sensitive, high-throughput protein-based stable isotope probing approach (Protein-SIP), which cuts cost for labeled substrates by 50–99% as compared to other SIP and Protein-SIP approaches and thus enables isotope labeling experiments on much larger scales and with higher replication. The approach allows for the determination of isotope incorporation into microbiome members with species level resolution using standard metaproteomics liquid chromatography-tandem mass spectrometry (LC–MS/MS) measurements. At the core of the approach are new algorithms to analyze the data, which have been implemented in an open-source software ( https://sourceforge.net/projects/calis-p/ ). We demonstrate sensitivity, precision and accuracy using bacterial cultures and mock communities with different labeling schemes. Furthermore, we benchmark our approach against two existing Protein-SIP approaches and show that in the low labeling range used our approach is the most sensitive and accurate. Finally, we measure translational activity using 18 O heavy water labeling in a 63-species community derived from human fecal samples grown on media simulating two different diets. Activity could be quantified on average for 27 species per sample, with 9 species showing significantly higher activity on a high protein diet, as compared to a high fiber diet. Surprisingly, among the species with increased activity on high protein were several Bacteroides species known as fiber consumers. Apparently, protein supply is a critical consideration when assessing growth of intestinal microbes on fiber, including fiber-based prebiotics. Conclusions We demonstrate that our Protein-SIP approach allows for the ultra-sensitive (0.01 to 10% label) detection of stable isotopes of elements found in proteins, using standard metaproteomics data.
59 BASIC BIOLOGICAL SCIENCES↗
State Policies and Programs for Community Solar
The purpose of this dataset is to summarize current community solar policies and related stipulations by state in the United States. The dataset is updated multiple times per year. The current version is the first file located below. Previous versions of the dataset published before August of 2024 can be found in the dataset below labeled “ARCHIVE_State Policies and Programs for Community Solar_Before 08.24.“ This list has been reviewed, but errors may exist, and the list may not be comprehensive. NLR invites input to update or add to the database. Please submit updates, additions, and corrections to Jenna Harmon (Jenna.Harmon@nlr.gov) and Sonja Berdahl (sonja.berdahl@nlr.gov).
14 SOLAR ENERGY↗
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis
Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.
97 MATHEMATICS AND COMPUTING↗