Sparseness and a reduction from Totally Nonnegative Least Squares to SVM
Lists
Only you see this
Abstract
Nonnegative Least Squares (NNLS) is a general form for many important problems. We consider a special case of NNLS where the input is nonnegative. It is called Totally Nonnegative Least Squares (TNNLS) in the literature. We show a reduction of TNNLS to a single class Support Vector Machine (SVM), thus relating the sparsity of a TNNLS solution to the sparsity of supports in a SVM. This allows us to apply any SVM solver to the TNNLS problem. We get an order of magnitude improvement in running time by first obtaining a smaller version of our original problem with the same solution using a fast approximate SVM solver. Second, we use an exact NNLS solver to obtain the solution. We present experimental evidence that this approach improves the performance of state-of-the-art NNLS solvers by applying it to both randomly generated problems as well as to real datasets, calculating radiation therapy dosages for cancer patients.
BibTeX
@inproceedings{potluru2011sparseness,
author = {Vamsi K. Potluru and Sergey M. Plis and Shuang Luan and Vince D. Calhoun and Thomas P. Hayes},
title = {{Sparseness and a reduction from Totally Nonnegative Least Squares to SVM}},
booktitle = {IJCNN},
year = {2011},
doi = {10.1109/ijcnn.2011.6033459},
}Loading related content...