Search NASA⌕ Search

SEARCH · Search NASA

Results for “clustering methods”

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 181 records · Page 10

Deep structural clustering for single-cell RNA-seq data jointly through autoencoder and graph neural network

Abstract Single-cell RNA sequencing (scRNA-seq) permits researchers to study the complex mechanisms of cell heterogeneity and diversity. Unsupervised clustering is of central importance for the analysis of the scRNA-seq data, as it can be used to identify putative cell types. However, due to noise impacts, high dimensionality and pervasive dropout events, clustering analysis of scRNA-seq data remains a computational challenge. Here, we propose a new deep structural clustering method for scRNA-seq data, named scDSC, which integrate the structural information into deep clustering of single cells. The proposed scDSC consists of a Zero-Inflated Negative Binomial (ZINB) model-based autoencoder, a graph neural network (GNN) module and a mutual-supervised module. To learn the data representation from the sparse and zero-inflated scRNA-seq data, we add a ZINB model to the basic autoencoder. The GNN module is introduced to capture the structural information among cells. By joining the ZINB-based autoencoder with the GNN module, the model transfers the data representation learned by autoencoder to the corresponding GNN layer. Furthermore, we adopt a mutual supervised strategy to unify these two different deep neural architectures and to guide the clustering task. Extensive experimental results on six real scRNA-seq datasets demonstrate that scDSC outperforms state-of-the-art methods in terms of clustering accuracy and scalability. Our method scDSC is implemented in Python using the Pytorch machine-learning library, and it is freely available at https://github.com/DHUDBlab/scDSC.

Gan, Yanglan↗

Scaling and Quality of Modularity Optimization Methods for Graph Clustering

Real-world graphs exhibit structures known as “communities” or “clusters” consisting of a group of vertices with relatively high connectivity between them, as compared to the rest of the vertices in the network. Graph clustering or community detection is a fundamental graph operation used to analyze real-world graphs occurring in the areas of computational biology, cybersecurity, electrical grids, etc. Similar to other graph algorithms, owing to irregular memory accesses and inherently sequential nature, current algorithms for community detection are challenging to parallelize. However, in order to analyze large networks, it is important to develop scalable parallel implementations of graph clustering that are capable of exploiting the architectural features of modern supercomputers. In response to the 2019 Streaming Graph Challenge, we present quality and performance analysis of our distributed- memory community detection using Vite, which is our distributed memory implementation of the popular Louvain method, on the ALCF Theta supercomputer. Clustering methods such as Louvain that rely on modularity maximization are known to suffer from the resolution limit problem, preventing identification of clusters of certain sizes. Hence, we also include quality analysis of our shared-memory implementation of the Fast-tracking Resistance method, in comparison with Louvain on the challenge datasets. Furthermore, we introduce an edge-balanced graph distribution for our distributed memory implementation, that significantly reduces communication, offering up to 80% improvement in the overall execution time. In addition to performance/quality analysis, we also include details on the power/energy consumption, and memory traffic of the distributed-memory clustering implementation using real-world graphs with over a billion edges.

Ghosh, Sayan↗

Excited states in variational Monte Carlo using a penalty method

Here, in this article, the authors present a technique using variational Monte Carlo to solve for excited states of electronic systems. This technique is based on enforcing orthogonality to lower energy states, which results in a simple variational principle for the excited states. Energy optimization is then used to solve for the excited states. This technique is applied to the well-characterized benzene molecule, in which ~10 000 parameters are optimized for the first 12 excited states. Agreement within ~0.2 eV is obtained with higher scaling coupled cluster methods; small disagreements with experiment are likely due to vibrational effects.

36 MATERIALS SCIENCE↗

Rank-reduced coupled-cluster. III. Tensor hypercontraction of the doubles amplitudes

In this work, we develop a quartic-scaling implementation of coupled-cluster singles and doubles (CCSD) based on low-rank tensor hypercontraction (THC) factorizations of both the electron repulsion integrals (ERIs) and the doubles amplitudes. This extends our rank-reduced (RR) coupled-cluster method to incorporate higher-order tensor factorizations. The THC factorization of the doubles amplitudes accounts for most of the gain in computational efficiency as it is sufficient, in conjunction with a Cholesky decomposition of the ERIs, to reduce the computational complexity of most contributions to the CCSD amplitude equations. Further THC factorization of the ERIs reduces the complexity of certain terms arising from nested commutators between the doubles excitation operator and the two-electron operator. We implement this new algorithm using graphical processing units and demonstrate that it enables CCSD calculations for molecules with 250 atoms and 2500 basis functions using a single computer node. Furthermore, we show that the new method computes correlation energies with comparable accuracy to the underlying RR-CCSD method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scaling NWChem with Efficient and Portable Asychronous Communication in MPI RMA

NWChem is one of the most widely used computational chemistry application suites for chemical and biological systems. Despite its vast success, the computational efficiency of NWChem is still low. This is especially true in higher accuracy methods such as the CCSD(T) coupled cluster method, where it currently achieves a mere 50% computational efficiency when run at large scales. In this paper, we demonstrate the most computationally efficient scaling of NWChem CCSD(T) to date, and use it to solve large water clusters. We use our recently proposed process-based asynchronous progress framework for MPI RMA, called Casper, to scale the computation on water clusters at near-100% computational efficiency on up to 12288 cores.

Si, Min↗

Quantifying uncertainties in α -nucleus reaction dynamics informed from first principles

The ab initio symmetry-adapted no-core shell model is a microscopic many-body method which naturally describes challenging collective and clustering features of atomic nuclei. Wave functions and observables computed with realistic nucleon-nucleon forces in this framework are tied to first principles, and are hence well-suited for rigorous uncertainty quantification. We discuss α-deuteron and α- 12 C cluster potentials informed by symmetry-adapted calculations, and propagate uncertainties in the effective binary cluster method as well as those in the nuclear interaction to reaction observables, namely scattering phase shifts, cross sections, partial widths and resonance energies. Here, we find that the overall uncertainties are dominated by those originating in the underlying nuclear force, speaking to the need for tighter constraints on realistic nucleon-nucleon interactions.

Ab initio↗

A bootstrap approach to bump hunting

An important question in cluster analysis and pattern recognition is the determination of the number of clusters into which a given population should be divided. Frequently, particularly when certain specific clustering methods are being used, the number of clusters is taken to be equal to the number of modes, or local maxima, in the probability density function underlying the given data set. The use of kernal density estimates in mode estimation is discussed. The test statistic to be used is defined and a bootstrap technique for assessing significance is given. An illustrative application is followed by an examination of the asymptotic behavior of the test statistic.

Silverman, B. W.↗

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗

An ab initio benchmark study of the H + CO --> HCO reaction

The H + CO --> HCO reaction has been characterized with correlation consistent basis sets at five levels of theory in order to benchmark the sensitivities of the barrier height and reaction ergicity to the one-electron and n-electron expansions of the electronic wave function. Single and multireference methods are compared and contrasted. The coupled cluster method RCCSD(T) was found to be in very good agreement with Davidson-corrected internally-contracted multireference configuration interaction (MRCI+Q). Second-order Moller-Plesset perturbation theory (MP2) was also employed. The estimated complete basis set (CBS) limits for the barrier height (in kcal/mol) for the five methods, including harmonic zero-point energy corrections, are MP2, 4.66; RCCSD, 4.78; RCCSD(T), 4.15; MRCI, 5.10; and MRCI+Q, 4.07. Similarly, the estimated CBS limits for the ergicity of the reaction are: MP2, -17.99; RCCSD, -13.34; RCCSD(T), -13.79; MRCI, -11.46; and MRCI+Q, -13.70. Additional basis set explorations for the RCCSD(T) method demonstrate that aug-cc-pVTZ sets, even with some functions removed, are sufficient to reproduce the CBS limits to within 0.1-0.3 kcal/mol.

NASA Discipline Exobiology↗

Geometric phase in coupled cluster theory

It has been well-established that the topography around conical intersections between excited electronic states is incorrectly described by coupled cluster and many other single reference theories (the intersections are “defective”). Despite this, we show both analytically and numerically that the geometric phase effect (GPE) is correctly reproduced upon traversing a path around a defective excited-state conical intersection (CI) in coupled cluster theory. The theoretical analysis is carried out by using a non-Hermitian generalization of the linear vibronic coupling approach. Interestingly, the approach qualitatively explains the characteristic (incorrect) shape of the defective CIs and CI seams. Moreover, the validity of the approach and the presence of the GPE indicate that defective CIs are local (and not global) artifacts. This implies that a sufficiently accurate coupled cluster method could predict nuclear dynamics, including geometric phase effects, as long as the nuclear wavepacket never gets too close to the conical intersections.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Discrete range clustering using Monte Carlo methods

For automatic obstacle avoidance guidance during rotorcraft low altitude flight, a reliable model of the nearby environment is needed. Such a model may be constructed by applying surface fitting techniques to the dense range map obtained by active sensing using radars. However, for covertness, passive sensing techniques using electro-optic sensors are desirable. As opposed to the dense range map obtained via active sensing, passive sensing algorithms produce reliable range at sparse locations, and therefore, surface fitting techniques to fill the gaps in the range measurement are not directly applicable. Both for automatic guidance and as a display for aiding the pilot, these discrete ranges need to be grouped into sets which correspond to objects in the nearby environment. The focus of this paper is on using Monte Carlo methods for clustering range points into meaningful groups. One of the aims of the paper is to explore whether simulated annealing methods offer significant advantage over the basic Monte Carlo method for this class of problems. We compare three different approaches and present application results of these algorithms to a laboratory image sequence and a helicopter flight sequence.

Chatterji, G. B.↗

Fuzzy set methods for object recognition in space applications

Progress on the following tasks is reported: feature calculation; membership calculation; clustering methods (including initial experiments on pose estimation); and acquisition of images (including camera calibration information for digitization of model). The report consists of 'stand alone' sections, describing the activities in each task. We would like to highlight the fact that during this quarter, we believe that we have made a major breakthrough in the area of fuzzy clustering. We have discovered a method to remove the probabilistic constraints that the sum of the memberships across all classes must add up to 1 (as in the fuzzy c-means). A paper, describing this approach, is included.

Keller, James M.↗

Parallel multiple-chain DRAM MCMC for large-scale geosteering inversion and uncertainty quantification

Geosteering is the proactive control of a wellbore placement based on the downhole measurements, aiming at maximizing economic production from the well. We report the recent development of azimuthal resistivity logging-whiledrilling (LWD) tools have a much larger depth of detection, thus sets higher demands for geosteering inversion as more unknown parameters need to be taken into account in the earth model to be inverted. For complicated nonlinear problems, traditional deterministic inversion methods are more likely to be trapped near local optima. In general, Markov chain Monte Carlo (MCMC) inversion methods are more capable of finding the global optimal solution and providing additional uncertainty analyses by sampling from the target distribution. However, MCMC methods usually have the problem of slow convergence. Even though optimization methods like delayed rejection (DR) and adaptive Metropolis (AM) were proposed to speed up the convergence, using MCMC methods to solve geosteering inversion problems may still incur unacceptable time cost. To reduce the sampling cost of MCMC methods, we use parallel multiple-chain DRAM MCMC methods to solve geosteering inverse problems and estimate the corresponding uncertainty. A clustering method, density-based spatial clustering of applications with noise (DBSCAN), is applied to select the best solution among many results. Lastly, the simulation results show that running many relatively short MCMC chains for one problem can obtain a similar result as running a long single chain. Besides, avoiding communications between multiple Markov chains during the sampling process yields almost linear scalability.

97 MATHEMATICS AND COMPUTING↗

Dual-fermion approach to the Anderson-Hubbard model

In this work, we apply the recently developed dual-fermion algorithm for disordered interacting systems to the Anderson-Hubbard model. This algorithm is compared with dynamical cluster approximation calculations for a one-dimensional system to establish the quality of the approximation in comparison with an established cluster method. We continue with a three-dimensional (3D) system and look at the antiferromagnetic, Mott, and Anderson localization transitions. The dual-fermion approach leads to quantitative as well as qualitative improvement of the dynamical mean-field results, and it allows one to calculate the hysteresis in the double occupancy in 3D, taking into account nonlocal correlations.

36 MATERIALS SCIENCE↗

Ab initio study and assignment of electronic states in molecular RaCl

Radium compounds have attracted recently considerable attention due to both development of experimental techniques for high-precision laser spectroscopy of molecules with short-lived nuclei and amenability of certain radium compounds for direct cooling with lasers. Currently, radium monofluoride (RaF) is one of the most studied molecules among the radium compounds, both theoretically and recently also experimentally. Complementary studies of further diatomic radium derivatives are highly desired to assess the influence of chemical substitution on diverse molecular parameters, especially on those connected with laser cooling, such as vibronic transition probabilities, and those related to violations of fundamental symmetries. Here in this article high-precision ab initio studies of electronic and vibronic levels of diatomic radium monochloride (RaCl) are presented. Recently developed approaches for treating electronic correlation with Fock-space coupled cluster methods are applied for this purpose. Theoretical results are compared to an early experimental investigation by Lagerqvist and used to partially reassign the experimentally observed transitions and molecular electronic levels of RaCl. Effective constants of $\mathscr{P}$-odd hyperfine interaction W a and $\mathscr{P, T}$-odd scalar-pseudoscalar nucleus-electron interaction Ws in the ground electronic state of RaCl are estimated within the framework of a quasirelativistic Zeroth-Order Regular Approximation approach and compared to parameters in RaF and RaOH.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Atomic isotropic hyperfine properties for second row elements (Al–Cl)

Isotropic hyperfine properties have been obtained for the second row elements Al–Cl using a systematic composite approach consisting of a sequence of core/valence correlation consistent basis sets, up through aug-cc-pCV7Z, along with configuration interaction and coupled cluster methods. The best nonrelativistic final values for the atomic ground states (in MHz) are -1.80 27 Al ( 2 P o 1/2 ), -24.31 29 Si ( 3 P 0 ), 63.70 31 P ( 4 So 3/2 ), 20.77 33 S ( 3 P 2 ), and 35.42 35 Cl ( 2 P o 3/2 ). We find a large K shell contribution to the spin density at the nucleus that is almost canceled by the L and M shell contributions. The spin density in atomic units is approximately linear with respect to the atomic number.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

sOPTICS: a modified density-based algorithm for identifying galaxy groups/clusters and brightest cluster galaxies

A direct approach to studying the galaxy–halo connection is to analyse groups and clusters of galaxies that trace the underlying dark matter haloes, emphasizing the importance of identifying galaxy clusters and their associated brightest cluster galaxies (BCGs). In this work, we test and propose a robust density-based clustering algorithm that outperforms the traditional Friends-of-Friends (FoF) algorithm in the currently available galaxy group/cluster catalogues. Our new approach is a modified version of the Ordering Points To Identify the Clustering Structure (OPTICS) algorithm, which accounts for line-of-sight positional uncertainties due to redshift space distortions by incorporating a scaling factor, and is thereby referred to as sOPTICS. When tested on both a galaxy group catalogue based on semi-analytic galaxy formation simulations and observational data, our algorithm demonstrated robustness to outliers and relative insensitivity to hyperparameter choices. In total, we compared the results of eight clustering algorithms. The proposed density-based clustering method, sOPTICS, outperforms FoF in accurately identifying giant galaxy clusters and their associated BCGs in various environments with higher purity and recovery rate, also successfully recovering 115 BCGs out of 118 reliable BCGs from a large galaxy sample. Furthermore, when applied to an independent observational catalogue without extensive re-tuning, sOPTICS maintains high recovery efficiency, confirming its flexibility and effectiveness for large-scale astronomical surveys.

79 ASTRONOMY AND ASTROPHYSICS↗