Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Adaptive Estimation for Approximate k-Nearest-Neighbor Computations
Daniel LeJeune, Richard G. Baraniuk, Reinhard Heckel
Algorithms often carry out equally many computations for "easy" and "hard" problem instances. In particular, algorithms for finding nearest neighbors typically have the same runnin…
cs.DS2018
MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
Amirali Aghazadeh, Ryan Spring, Daniel LeJeune +3
Feature selection is an important challenge in machine learning. It plays a crucial role in the explainability of machine-driven decisions that are rapidly permeating throughout mo…