Data from fitting Gaussian process models to various data sets using eight Gaussian process software packages.
Ontology highlight
ABSTRACT:
SUBMITTER: Erickson CB
PROVIDER: S-EPMC5995745 | biostudies-literature | 2018 Jun
REPOSITORIES: biostudies-literature
Publications
Data from fitting Gaussian process models to various data sets using eight Gaussian process software packages.
Erickson Collin B CB Ankenman Bruce E BE Sanchez Susan M SM
Data in brief 20171212
This data article provides the summary data from tests comparing various Gaussian process software packages. Each spreadsheet represents a single function or type of function using a particular input sample size. In each spreadsheet, a row gives the results for a particular replication using a single package. Within each spreadsheet there are the results from eight Gaussian process model-fitting packages on five replicates of the surface. There is also one spreadsheet comparing the results from ...[more]
Similar Datasets
Project description:BackgroundBioinformatics investigators often gain insights by combining information across multiple and disparate data sets. Merging data from multiple sources frequently results in data sets that are incomplete or contain missing values. Although missing data are ubiquitous, existing implementations of Gaussian mixture models (GMMs) either cannot accommodate missing data, or do so by imposing simplifying assumptions that limit the applicability of the model. In the presence of missing data, a standard ad hoc practice is to perform complete case analysis or imputation prior to model fitting. Both approaches have serious drawbacks, potentially resulting in biased and unstable parameter estimates.ResultsHere we present missingness-aware Gaussian mixture models (MGMM), an R package for fitting GMMs in the presence of missing data. Unlike existing GMM implementations that can accommodate missing data, MGMM places no restrictions on the form of the covariance matrix. Using three case studies on real and simulated 'omics data sets, we demonstrate that, when the underlying data distribution is near-to a GMM, MGMM is more effective at recovering the true cluster assignments than either the existing GMM implementations that accommodate missing data, or fitting a standard GMM after state of the art imputation. Moreover, MGMM provides an accurate assessment of cluster assignment uncertainty, even when the generative distribution is not a GMM.ConclusionCompared to state-of-the-art competitors, MGMM demonstrates a better ability to recover the true cluster assignments for a wide variety of data sets and a large range of missingness rates. MGMM provides the bioinformatics community with a powerful, easy-to-use, and statistically sound tool for performing clustering and density estimation in the presence of missing data. MGMM is publicly available as an R package on CRAN: https://CRAN.R-project.org/package=MGMM .
| S-EPMC9158227 | biostudies-literature
Project description:Modelling spatial and temporal patterns in ecology is imperative to understand the complex processes inherent in ecological phenomena. Log-Gaussian Cox processes are a popular choice among ecologists to describe the spatiotemporal distribution of point-referenced data. In addition, point pattern models where events instigate others nearby (i.e., self-exciting behaviour) are becoming increasingly popular to infer the contagious nature of events (e.g., animal sightings). While there are existing R packages that facilitate fitting spatiotemporal point processes and, separately, self-exciting models, none incorporate both. We present an R package, stelfi, that fits spatiotemporal self-exciting and log-Gaussian Cox process models using Template Model Builder through a range of custom-written C++ templates. We illustrate the use of stelfi's functions fitting models to Sasquatch (bigfoot) sightings data within the USA. The structure of these data is typical of many seen in ecology studies. We show, from a temporal Hawkes process to a spatiotemporal self-exciting model, how the models offered by the package enable additional insights into the temporal and spatial progression of point pattern data. We present extensions to these well-known models that include spatiotemporal self-excitation and joint likelihood models, which are better suited to capture the complex mechanisms inherent in many ecological data. The package stelfi offers user-friendly functionality, is open source, and is available from CRAN. It offers the implementation of complex spatiotemporal point process models in R for applications even beyond the field of ecology.
| S-EPMC10864691 | biostudies-literature
Project description:For multivariate spatial Gaussian process (GP) models, customary specifications of cross-covariance functions do not exploit relational inter-variable graphs to ensure process-level conditional independence among the variables. This is undesirable, especially for highly multivariate settings, where popular cross-covariance functions such as the multivariate Matérn suffer from a "curse of dimensionality" as the number of parameters and floating point operations scale up in quadratic and cubic order, respectively, in the number of variables. We propose a class of multivariate "Graphical Gaussian Processes" using a general construction called "stitching" that crafts cross-covariance functions from graphs and ensures process-level conditional independence among variables. For the Matérn family of functions, stitching yields a multivariate GP whose univariate components are Matérn GPs, and conforms to process-level conditional independence as specified by the graphical model. For highly multivariate settings and decomposable graphical models, stitching offers massive computational gains and parameter dimension reduction. We demonstrate the utility of the graphical Matérn GP to jointly model highly multivariate spatial data using simulation examples and an application to air-pollution modelling.
| S-EPMC9838617 | biostudies-literature
Project description:BackgroundWith the current focus on personalized medicine, patient/subject level inference is often of key interest in translational research. As a result, random effects models (REM) are becoming popular for patient level inference. However, for very large data sets that are characterized by large sample size, it can be difficult to fit REM using commonly available statistical software such as SAS since they require inordinate amounts of computer time and memory allocations beyond what are available preventing model convergence. For example, in a retrospective cohort study of over 800,000 Veterans with type 2 diabetes with longitudinal data over 5 years, fitting REM via generalized linear mixed modeling using currently available standard procedures in SAS (e.g. PROC GLIMMIX) was very difficult and same problems exist in Stata's gllamm or R's lme packages. Thus, this study proposes and assesses the performance of a meta regression approach and makes comparison with methods based on sampling of the full data.DataWe use both simulated and real data from a national cohort of Veterans with type 2 diabetes (n=890,394) which was created by linking multiple patient and administrative files resulting in a cohort with longitudinal data collected over 5 years.Methods and resultsThe outcome of interest was mean annual HbA1c measured over a 5 years period. Using this outcome, we compared parameter estimates from the proposed random effects meta regression (REMR) with estimates based on simple random sampling and VISN (Veterans Integrated Service Networks) based stratified sampling of the full data. Our results indicate that REMR provides parameter estimates that are less likely to be biased with tighter confidence intervals when the VISN level estimates are homogenous.ConclusionWhen the interest is to fit REM in repeated measures data with very large sample size, REMR can be used as a good alternative. It leads to reasonable inference for both Gaussian and non-Gaussian responses if parameter estimates are homogeneous across VISNs.
| S-EPMC3542162 | biostudies-literature
Project description:Radiomic features are being increasingly studied for clinical applications. We aimed to assess the agreement among radiomic features when computed by several groups by using different software packages under very tightly controlled conditions, which included standardized feature definitions and common image data sets. Ten sites (9 from the NCI's Quantitative Imaging Network] positron emission tomography-computed tomography working group plus one site from outside that group) participated in this project. Nine common quantitative imaging features were selected for comparison including features that describe morphology, intensity, shape, and texture. The common image data sets were: three 3D digital reference objects (DROs) and 10 patient image scans from the Lung Image Database Consortium data set using a specific lesion in each scan. Each object (DRO or lesion) was accompanied by an already-defined volume of interest, from which the features were calculated. Feature values for each object (DRO or lesion) were reported. The coefficient of variation (CV), expressed as a percentage, was calculated across software packages for each feature on each object. Thirteen sets of results were obtained for the DROs and patient data sets. Five of the 9 features showed excellent agreement with CV < 1%; 1 feature had moderate agreement (CV < 10%), and 3 features had larger variations (CV ≥ 10%) even after attempts at harmonization of feature calculations. This work highlights the value of feature definition standardization as well as the need to further clarify definitions for some features.
| S-EPMC7289262 | biostudies-literature
Project description:We present a model-based method for inferring full-brain neural activity at millimeter-scale spatial resolutions and millisecond-scale temporal resolutions using standard human intracranial recordings. Our approach makes the simplifying assumptions that different people's brains exhibit similar correlational structure, and that activity and correlation patterns vary smoothly over space. One can then ask, for an arbitrary individual's brain: given recordings from a limited set of locations in that individual's brain, along with the observed spatial correlations learned from other people's recordings, how much can be inferred about ongoing activity at other locations throughout that individual's brain? We show that our approach generalizes across people and tasks, thereby providing a person- and task-general means of inferring high spatiotemporal resolution full-brain neural dynamics from standard low-density intracranial recordings.
| S-EPMC7472198 | biostudies-literature
Project description:High-dimensional manifold modeling increases the precision and performance of cortical morphometry analysis by densely sampling on the grey matters. But this also brings redundant information and increased computational burden. Gaussian process regression has been used to tackle this problem by learning a mapping to a low-dimensional subspace. However, current methods may not take relevant morphometric properties, usually measured by geometric features, into account, and as a result, may generate morphometrically insignificant selections. In this paper, we propose a morphometric Gaussian process (M-GP) as a novel Bayesian model on the gray matter tetrahedral meshes. We also implement an M-GP regression landmarking algorithm as a manifold learning method for non-linear dimensionality reduction. The definition of M-GP involves a scale-invariant wave kernel signature distance map measuring the local similarities of geometric features, and a heat flow entropy which implicitly embeds the global curvature flow. With such a design, the prior knowledge fully encodes the geometric information so that a posterior predictive inference is morphometrically significant. In experiments, we use 518 grey matter tetrahedral meshes generated from structural magnetic resonance images of a publicly available Alzheimer's disease imaging cohort to empirically and numerically evaluate our method. The results verify that our method is theoretically and experimentally valid in selecting a representative subset from the original massive data. Our work may benefit any studies involving large-scale or iterative computations on extensive manifold-valued data, including morphometry analyses and general medical data processing.
| S-EPMC8112202 | biostudies-literature
Project description:MotivationImproved DNA technology has made it practical to estimate single-nucleotide polymorphism (SNP)-heritability among distantly related individuals with unknown relationships. For growth- and development-related traits, it is meaningful to base SNP-heritability estimation on longitudinal data due to the time-dependency of the process. However, only few statistical methods have been developed so far for estimating dynamic SNP-heritability and quantifying its full uncertainty.ResultsWe introduce a completely tuning-free Bayesian Gaussian process (GP)-based approach for estimating dynamic variance components and heritability as their function. For parameter estimation, we use a modern Markov Chain Monte Carlo method which allows full uncertainty quantification. Several datasets are analysed and our results clearly illustrate that the 95% credible intervals of the proposed joint estimation method (which 'borrows strength' from adjacent time points) are significantly narrower than of a two-stage baseline method that first estimates the variance components at each time point independently and then performs smoothing. We compare the method with a random regression model using MTG2 and BLUPF90 software and quantitative measures indicate superior performance of our method. Results are presented for simulated and real data with up to 1000 time points. Finally, we demonstrate scalability of the proposed method for simulated data with tens of thousands of individuals.Availability and implementationThe C++ implementation dynBGP and simulated data are available in GitHub: https://github.com/aarjas/dynBGP. The programmes can be run in R. Real datasets are available in QTL archive: https://phenome.jax.org/centers/QTLA.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC7672693 | biostudies-literature
Project description:Spatial process models for analyzing geostatistical data entail computations that become prohibitive as the number of spatial locations become large. This article develops a class of highly scalable nearest-neighbor Gaussian process (NNGP) models to provide fully model-based inference for large geostatistical datasets. We establish that the NNGP is a well-defined spatial process providing legitimate finite-dimensional Gaussian densities with sparse precision matrices. We embed the NNGP as a sparsity-inducing prior within a rich hierarchical modeling framework and outline how computationally efficient Markov chain Monte Carlo (MCMC) algorithms can be executed without storing or decomposing large matrices. The floating point operations (flops) per iteration of this algorithm is linear in the number of spatial locations, thereby rendering substantial scalability. We illustrate the computational and inferential benefits of the NNGP over competing methods using simulation studies and also analyze forest biomass from a massive U.S. Forest Inventory dataset at a scale that precludes alternative dimension-reducing methods. Supplementary materials for this article are available online.
| S-EPMC5927603 | biostudies-literature
Project description:This paper examines the use of Dirichlet process (DP) mixtures for curve fitting. An important modelling aspect in this setting is the choice between constant or covariate-dependent weights. By examining the problem of curve fitting from a predictive perspective, we show the advantages of using covariate-dependent weights. These advantages are a result of the incorporation of covariate proximity in the latent partition. However, closer examination of the partition yields further complications, which arise from the vast number of total partitions. To overcome this, we propose to modify the probability law of the random partition to strictly enforce the notion of covariate proximity, while still maintaining certain properties of the DP. This allows the distribution of the partition to depend on the covariate in a simple manner and greatly reduces the total number of possible partitions, resulting in improved curve fitting and faster computations. Numerical illustrations are presented.
| S-EPMC4225571 | biostudies-literature