Visualizing Confidence Intervals for Critical Point Probabilities in 2D Scalar Field Ensembles

• URL: http://arxiv.org/abs/2207.13661v1
• Date: Wed, 13 Jul 2022 12:54:27 GMT
• Title: Visualizing Confidence Intervals for Critical Point Probabilities in 2D Scalar Field Ensembles
• Authors: Dominik Vietinghoff, Michael B\"ottinger, Gerik Scheuermann, Christian Heine
• Abstract summary: We present an approach for the computation and visual representation of confidence intervals for the occurrence probabilities of critical points in ensemble data sets. We demonstrate the added value of our approach over existing methods for critical point prediction in uncertain data on a synthetic data set and show its applicability to a data set from climate research.
• Score: 7.484221280249876
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An important task in visualization is the extraction and highlighting of dominant features in data to support users in their analysis process. Topological methods are a well-known means of identifying such features in deterministic fields. However, many real-world phenomena studied today are the result of a chaotic system that cannot be fully described by a single simulation. Instead, the variability of such systems is usually captured with ensemble simulations that produce a variety of possible outcomes of the simulated process. The topological analysis of such ensemble data sets and uncertain data, in general, is less well studied. In this work, we present an approach for the computation and visual representation of confidence intervals for the occurrence probabilities of critical points in ensemble data sets. We demonstrate the added value of our approach over existing methods for critical point prediction in uncertain data on a synthetic data set and show its applicability to a data set from climate research.

Related papers

• Learning from Uncertain Data: From Possible Worlds to Possible Models [13.789554282826835]
  We introduce an efficient method for learning linear models from uncertain data, where uncertainty is represented as a set of possible variations in the data. We compactly represent these dataset variations, enabling the symbolic execution of gradient descent on all possible worlds simultaneously. Our method provides sound over-approximations of all possible optimal models and viable prediction ranges.
  arXiv  Detail & Related papers  (2024-05-28T19:36:55Z)
• Topological Detection of Phenomenological Bifurcations with Unreliable Kernel Densities [0.5874142059884521]
  Phenomenological (P-type) bifurcations are qualitative changes in dynamical systems. Current state of the art for detecting these bifurcations requires reliable kernel density estimates computed from an ensemble of system realizations. This study presents an approach for detecting P-type bifurcations using unreliable density estimates.
  arXiv  Detail & Related papers  (2024-01-29T20:59:25Z)
• Probabilistic Modeling for Sequences of Sets in Continuous-Time [14.423456635520084]
  We develop a general framework for modeling set-valued data in continuous-time. We also develop inference methods that can use such models to answer probabilistic queries.
  arXiv  Detail & Related papers  (2023-12-22T20:16:10Z)
• Towards stable real-world equation discovery with assessing differentiating quality influence [52.2980614912553]
  We propose alternatives to the commonly used finite differences-based method. We evaluate these methods in terms of applicability to problems, similar to the real ones, and their ability to ensure the convergence of equation discovery algorithms.
  arXiv  Detail & Related papers  (2023-11-09T23:32:06Z)
• Approximating Counterfactual Bounds while Fusing Observational, Biased and Randomised Data Sources [64.96984404868411]
  We address the problem of integrating data from multiple, possibly biased, observational and interventional studies. We show that the likelihood of the available data has no local maxima. We then show how the same approach can address the general case of multiple datasets.
  arXiv  Detail & Related papers  (2023-07-31T11:28:24Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• TACTiS: Transformer-Attentional Copulas for Time Series [76.71406465526454]
  estimation of time-varying quantities is a fundamental component of decision making in fields such as healthcare and finance. We propose a versatile method that estimates joint distributions using an attention-based decoder. We show that our model produces state-of-the-art predictions on several real-world datasets.
  arXiv  Detail & Related papers  (2022-02-07T21:37:29Z)
• Scalable Intervention Target Estimation in Linear Models [52.60799340056917]
  Current approaches to causal structure learning either work with known intervention targets or use hypothesis testing to discover the unknown intervention targets. This paper proposes a scalable and efficient algorithm that consistently identifies all intervention targets. The proposed algorithm can be used to also update a given observational Markov equivalence class into the interventional Markov equivalence class.
  arXiv  Detail & Related papers  (2021-11-15T03:16:56Z)
• Approximate Bayesian Computation with Path Signatures [0.5156484100374059]
  We introduce the use of path signatures as a natural candidate feature set for constructing distances between time series data. Our experiments show that such an approach can generate more accurate approximate Bayesian posteriors than existing techniques for time series models.
  arXiv  Detail & Related papers  (2021-06-23T17:25:43Z)
• Bayesian Sparse Factor Analysis with Kernelized Observations [67.60224656603823]
  Multi-view problems can be faced with latent variable models. High-dimensionality and non-linear issues are traditionally handled by kernel methods. We propose merging both approaches into single model.
  arXiv  Detail & Related papers  (2020-06-01T14:25:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.