Adaptive Sparse Grids (2001) [8 citations — 2 self]
http://anziamj.austms.org.au/V44/CTAC2001/Hegl/Heg
ftp://discus.anu.edu.au/pub/dm/papers/ctac2001.ps.
CACHED:
Abstract:
Sparse grids, as studied by Zenger and Griebel in the last 10 years have been very successful in the solution of partial di#erential equations, integral equations and classification problems. Adaptive sparse grid functions are elements of a function space lattice. Such lattices allow the generalisation of sparse grid techniques to the fitting of very high-dimensional functions with categorical and continuous variables. We have observed in first tests that these general adaptive sparse grids allow the identification of the anova structure and thus provide comprehensible models. This is very important for data mining applications. Perhaps the main advantage of these models is that they do not include any spurious interaction terms and thus can deal with very high dimensional data.
Citations
| 3356 | C4.5: Programs for Machine Learning – Quinlan - 1993 |
| 2573 | Classification and Regression Trees – Breiman, Friedman, et al. - 1984 |
| 769 | Spline Models for Observational Data – WAHBA - 1990 |
| 691 | Generalized Additive Models – Hastie, Tibshirani - 1990 |
| 237 | Adaptive Control Processes: A Guided Tour – Bellman - 1961 |
| 78 | Multivatiate adaptive regression splines. The Annals of Statistics – Friedman - 1991 |
| 59 | A combination technique for the solution of sparse grid problems – Griebel, Schneider, et al. - 1992 |
| 42 | Sparse grids. In Parallel Algorithms for Partial Differential Equations – Zenger - 1990 |
| 16 | Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences – Griebel - 1998 |
| 9 | Finite element thin plate splines for surface fitting – Hegland, Roberts, et al. - 1997 |
| 4 | Additive models in high dimensions – Hegland, Pestov - 1999 |
| 3 | Parallel MARS algorithm based on B-splines – Bakin, Hegland, et al. - 2000 |

