Learning Sparse Combinatorial Representations via Two-stage Submodular MaximizationDownload PDFOpen Website

2016 (modified: 11 Nov 2022)ICML 2016Readers: Everyone
Abstract: We consider the problem of learning sparse representations of data sets, where the goal is to reduce a data set in manner that optimizes multiple objectives. Motivated by applications of data summa...
0 Replies

Loading