Data mining with sparse grids

DOI10.1007/S006070170007MaRDI QIDQ5958909zbMATH OpenOpenAlexFDO

Authors Jochen Garcke, Michael Griebel, Michael Thess

Publication date 30 June 2002

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070170007

zbMATH Keywords

classificationdata miningapproximationsparse gridscombination technique

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical smoothing, curve fitting (65D10) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 2000345
• scientific article; zbMATH DE number 2135236
• Distributed data mining on the grid
• Data mining, rough sets and granular computing

Cited in

(28)

• Random search with k-prototypes algorithm for clustering mixed datasets
• Characterization of discontinuities in high-dimensional stochastic problems on adaptive sparse grids
• New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness
• The combination technique and some generalisations
• Parallelisation of sparse grids for large scale data analysis
• Classification with probability density estimation on sparse grids
• scientific article; zbMATH DE number 2000345 (Why is no real title available?)
• On the stability of the hyperbolic cross discrete Fourier transform
• scientific article; zbMATH DE number 2101400 (Why is no real title available?)
• Constructive representation of functions in low-rank tensor formats
• Deep ReLU neural networks in high-dimensional approximation
• scientific article; zbMATH DE number 2232688 (Why is no real title available?)
• On the influence of robustness measures on shape optimization with stochastic uncertainties
• Spatially adaptive sparse grids for high-dimensional data-driven problems
• Adaptive basis expansion via \(\ell _1\) trend filtering
• Spatially-Dimension-Adaptive Sparse Grids for Online Learning
• On a multilevel preconditioner and its condition numbers for the discretized Laplacian on full and sparse grids in higher dimensions
• \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations
• A dimension adaptive sparse grid combination technique for machine learning
• A novel sparse least squares support vector machines
• Efficient model selection for sparse least-square SVMs
• Efficient shape optimization for certain and uncertain aerodynamic design
• Fitting multidimensional data using gradient penalties and the sparse grid combination technique
• Graphical Lasso and thresholding: equivalence and closed-form solutions
• A new subspace-based algorithm for efficient spatially adaptive sparse grid regression, classification and multi-evaluation
• Smoothly varying regularization
• On the treatment of distributed uncertainties in PDE-constrained optimization
• Fast sparse grid operations using the unidirectional principle: a generalized and unified framework

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Data mining with sparse grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958909)