Fast high-dimensional approximation with sparse occupancy trees

DOI10.1016/j.cam.2010.10.005zbMath1209.65018OpenAlexW2156566935MaRDI QIDQ629454

Wolfgang Dahmen, Philipp Lamby, Peter Binev

Publication date: 9 March 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.10.005

zbMATH Keywords

numerical examplesscattered data approximationhigh-dimensional approximationnon-linear approximationnon-parametric regressionmultiresolution treepiecewise linear schemessimplex subdivisions

Mathematics Subject Classification ID

Related Items (7)

Learning multivariate functions with low-dimensional structures using polynomial bases ⋮ HARFE: hard-ridge random feature expansion ⋮ Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis ⋮ Approximation of functions over manifolds: a moving least-squares approach ⋮ \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling ⋮ Sparse mixture models inspired by ANOVA decompositions ⋮ Interpretable Approximation of High-Dimensional Data

Uses Software

• p4est
• ElemStatLearn

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Multivariate adaptive regression splines
• p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
• Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
• Multivariate Regression and Machine Learning with Sums of Separable Functions
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• An effective way to represent quadtrees

This page was built for publication: Fast high-dimensional approximation with sparse occupancy trees