Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Data mining with sparse grids using simplicial basis functio...
Sort
relevance
views
votes
recent
update
View
thumb
title
118
click to vote
PKDD
2009
Springer
147
views
Data Mining
»
more
PKDD 2009
»
Kernel Polytope Faces Pursuit
15 years 10 months ago
Download
eprints.pascal-network.org
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
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »