Sciweavers

6 search results - page 2 / 2
» Data mining with sparse grids using simplicial basis functio...
Sort
View
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
13 years 11 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain