no code implementations • 14 Oct 2021 • Daniel Potts, Michael Schmischke
We demonstrate the applicability of this procedure on the well-known forest fires data set from the UCI machine learning repository.
2 code implementations • 25 Mar 2021 • Daniel Potts, Michael Schmischke
The advantage of this method is the interpretability of the approximation, i. e., the ability to rank the importance of the attribute interactions or the variable couplings.
1 code implementation • 20 Oct 2020 • Felix Bartel, Daniel Potts, Michael Schmischke
From there we propose a fast matrix-vector multiplication, the grouped Fourier transform, for high-dimensional grouped index sets.
Numerical Analysis Numerical Analysis 65T, 42B05
1 code implementation • 6 Dec 2019 • Daniel Potts, Michael Schmischke
In this paper we propose a method for the approximation of high-dimensional functions over finite intervals with respect to complete orthonormal systems of polynomials.
Numerical Analysis Numerical Analysis