Author:
Gerber S.,Pospisil L.,Navandar M.,Horenko I.
Abstract
AbstractFinding reliable discrete approximations of complex systems is a key prerequisite when applying many of the most popular modeling tools. Common discretization approaches (for example, the very popular K-means clustering) are crucially limited in terms of quality and cost. We introduce a low-cost improved-quality Scalable Probabilistic Approximation (SPA) algorithm, allowing for simultaneous data-driven optimal discretization, feature selection and prediction. Cross-validated applications of SPA to a range of large realistic data classification and prediction problems reveal drastic cost and performance improvements. For example, SPA allows the unsupervised next-day surface temperature predictions for Europe with the mean crossvalidated one-day prediction error of 0.75°C on a common PC (being around 40% better in terms of errors and five to six orders-of-magnitude cheaper than the next-day surface temperature predictions calculated on supercomputers and provided by the weather services).One Sentence SummaryIntroduced computational tool allows obtaining drastic cost and quality gains for a broad range of science applications.
Publisher
Cold Spring Harbor Laboratory
Reference56 articles.
1. A. Stuart , A. Humphries , Dynamical Systems and Numerical Analysis, vol. 8 in Cambridge Monographs on Applied Mathematics (Cambridge University Press, 1998).
2. A. J. Chorin , O. H. Hald , Stochastic Tools in Mathematics and Science, 3rd ed. (Springer, 2013).
3. Bayesian Inference for Causal Effects: The Role of Randomization;Ann. Statis.,1978
4. D. B. Rubin , Bayesian Data Analysis, 3rd ed. (Chapman and Hall/CRC Texts in Statistical Science, 2013).
5. Ch. Schütte , M. Sarich , Metastability and Markov State Models in Molecular Dynamics: Modeling, Analysis, Algorithmic Approaches, (in Courant Lecture Notes In Mathematics, vol. 24, American Mathematical Soc., 2013).