Regressions by Leaps and Bounds

Article

Furnival, George M.; Wilson, Robert W., Jr.   (2000, ASQ and American Statistical Association)   Yale University, New Haven, CT; USDA Forest Service

Technometrics    Vol. 42    No. 1
QICID: 13868    February 2000    pp. 69-79
List $10.00
Member $5.00

This article is not available online. Contact us to receive a scan of the archive, in PDF format.
New to ASQ? REGISTER HERE.

Article Abstract

[This abstract is based on the authors' abstract.] Several algorithms are described for computing the residual sums of squares for all possible regressions with what appears to be a minimum of arithmetic (less than six floating-point operations per regression.) It is shown how two of these algorithms can be combined to form a simple leap and bound technique for finding the best subsets without examining all possible subsets. The result is a reduction of several orders of magnitude in the number of operations required to find the best subsets.

Keywords

Linear regression,Statistics


Browse QIC Articles Chronologically:     Previous Article     Next Article

New Search

Featured advertisers





ASQ is a global community of people passionate about quality, who use the tools, their ideas and expertise to make our world work better. ASQ: The Global Voice of Quality.