skip to main content
article
Free Access

A modification of Efroymson's technique for stepwise regression analysis

Published:01 August 1968Publication History
Skip Abstract Section

Abstract

The computational technique conventionally used for stepwise multiple linear regression requires the storage of an n × n matrix of data. When the number of variables, n, is large, this requirement taxes the storage capacity of presently used machinery. The near symmetry of the matrices involved permits a modification requiring only half the storage and computations of the conventional algorithm and this additional storage allows the analysis of problems containing more variables. Alternatively, it permits the analysis of problems containing the same number of variables but with all computations performed in double precision.

References

  1. 1 EFFROYMSON, M. A. Multiple regression analysis. In Ralston, A., and Wilf, H. S. (Eds.), Mathematical Methods for Digital Computers, Wiley, New York, 1960, pp. 191-203.Google ScholarGoogle Scholar
  2. 2 OOSTERHOFF, J. On the selection of independent variables in a regression equation. Rep. S 319 (VP 23), Mathematisch Centrum, Amsterdam, 1963.Google ScholarGoogle Scholar
  3. 3 LOTTO, G. On the generation of all possible stepwise combinations. Math. Comput. 16 (1962), 241-243.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4 GARSIDE, M. J. The best subset in multiple regression analysis. Appl. Statist. 14 (1965), 195-200.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 BEALE, E. M. L., KENDALL, M. G., AND MANN, D. W. The discarding of variables in multivariate analysis. Unpublished paper delivered at seminar sponsored by C-E-I-R, Inc., Washington, D. C., Apr. 1967.Google ScholarGoogle Scholar
  6. 6 BREAUX, H. J. On stepwise multiple linear regression. Ballistic Res. Labs. Rep. No. 1369, Aberdeen Proving Ground, Md., Aug. 1967.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 11, Issue 8
    Aug. 1968
    48 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/363567
    Issue’s Table of Contents

    Copyright © 1968 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 August 1968

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader