Instance Ranking and Numerosity Reduction Using Matrix Decomposition and Subspace Learning

Code

• github.com/bghojogh/Prototype-Selection-Matrix-Decomposition
  Officialnone★ 0

Abstract

One way to deal with the ever increasing amount of available data for processing is to rank data instances by usefulness and reduce the dataset size. In this work, we introduce a framework to achieve this using matrix decomposition and subspace learning. Our central contribution is a novel similarity measure for data instances that uses the basis obtained from matrix decomposition of the dataset. Using this similarity measure, we propose several related algorithms for ranking data instances and performing numerosity reduction. We then validate the effectiveness of these algorithms for data reduction on several datasets for classification, regression, and clustering tasks.

Tasks

Reproductions