Spatially adaptive sparse grids for high-dimensional data-driven problems

Authors:
Dirk Pflüger;Benjamin Peherstorfer;Hans-Joachim Bungartz
Affiliations:
Institut für Informatik, Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany;Institut für Informatik, Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany;Institut für Informatik, Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany
Venue:
Journal of Complexity
Year:
2010

Citing 9
Cited 2

Information-based complexity

Information-based complexity
A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives

Journal of Complexity
Data mining: practical machine learning tools and techniques with Java implementations

ACM SIGMOD Record
Pattern Recognition and Neural Networks

Pattern Recognition and Neural Networks
Data mining with sparse grids

Computing
Improving RBF-DDA Performance on Optical Character Recognition through Parameter Selection

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
Regression with the optimised combination technique

ICML '06 Proceedings of the 23rd international conference on Machine learning
Adaptive Sparse Grid Classification Using Grid Environments

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Fitting multidimensional data using gradient penalties and the sparse grid combination technique

Computing

A sparse-grid-based out-of-sample extension for dimensionality reduction and clustering with laplacian eigenmaps

AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Clustering based on density estimation with sparse grids

KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse grids allow one to employ grid-based discretization methods in data-driven problems. We present an extension of the classical sparse grid approach that allows us to tackle high-dimensional problems by spatially adaptive refinement, modified ansatz functions, and efficient regularization techniques. The competitiveness of this method is shown for typical benchmark problems with up to 166 dimensions for classification in data mining, pointing out properties of sparse grids in this context. To gain insight into the adaptive refinement and to examine the scope for further improvements, the approximation of non-smooth indicator functions with adaptive sparse grids has been studied as a model problem. As an example for an improved adaptive grid refinement, we present results for an edge-detection strategy.