A fast algorithm for non-negativity model selection

An efficient optimization algorithm for identifying the best least squares regression model under the condition of non-negative coefficients is proposed. The algorithm exposits an innovative solution via the unrestricted least squares and is based on the regression tree and branch-and-bound techniqu...

Full description

Saved in:

Bibliographic Details
Published in:	Statistics and computing Vol. 23; no. 3; pp. 403 - 411
Main Authors:	Gatu, Cristian, Kontoghiorghes, Erricos John
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.05.2013
Subjects:	Algorithms Artificial Intelligence Computation Effectiveness Least squares method Mathematical models Mathematics and Statistics Probability and Statistics in Computer Science Regression Statistical Theory and Methods Statistics Statistics and Computing/Statistics Programs Strategy Non-negative least squares Subset selection Branch-and-bound algorithms
ISSN:	0960-3174, 1573-1375
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!