18
views
0
recommends
+1 Recommend
1 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      High-Dimensional Density Estimation via SCA: An Example in the Modelling of Hurricane Tracks

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We present nonparametric techniques for constructing and verifying density estimates from high-dimensional data whose irregular dependence structure cannot be modelled by parametric multivariate distributions. A low-dimensional representation of the data is critical in such situations because of the curse of dimensionality. Our proposed methodology consists of three main parts: (1) data reparameterization via dimensionality reduction, wherein the data are mapped into a space where standard techniques can be used for density estimation and simulation; (2) inverse mapping, in which simulated points are mapped back to the high-dimensional input space; and (3) verification, in which the quality of the estimate is assessed by comparing simulated samples with the observed data. These approaches are illustrated via an exploration of the spatial variability of tropical cyclones in the North Atlantic; each datum in this case is an entire hurricane trajectory. We conclude the paper with a discussion of extending the methods to model the relationship between TC variability and climatic variables.

          Related collections

          Most cited references6

          • Record: found
          • Abstract: not found
          • Article: not found

          Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning, and data set parameterization.

            B. Lee, S Lafon (2006)
            We provide evidence that nonlinear dimensionality reduction, clustering, and data set parameterization can be solved within one and the same framework. The main idea is to define a system of coordinates with an explicit metric that reflects the connectivity of a given data set and that is robust to noise. Our construction, which is based on a Markov random walk on the data, offers a general scheme of simultaneously reorganizing and subsampling graphs and arbitrarily shaped data sets in high dimensions using intrinsic geometry. We show that clustering in embedding spaces is equivalent to compressing operators. The objective of data partitioning and clustering is to coarse-grain the random walk on the data while at the same time preserving a diffusion operator for the intrinsic geometry or connectivity of the data set up to some accuracy. We show that the quantization distortion in diffusion space bounds the error of compression of the operator, thus giving a rigorous justification for k-means clustering in diffusion space and a precise measure of the performance of general clustering algorithms.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Simulation of Hurricane Risk in the U.S. Using Empirical Track Model

                Bookmark

                Author and article information

                Journal
                2009-07-01
                Article
                0907.0199
                ea04551e-735b-4408-a6a3-2a65e3378e71

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                13 pages, 5 figures
                stat.AP

                Applications
                Applications

                Comments

                Comment on this article