Efficient computation of statistical procedures based on all subsets of a specified size

John E. Hinkle; Arnold J. Stromberg

doi:10.1080/03610929608831709

Efficient computation of statistical procedures based on all subsets of a specified size

John E. Hinkle
, Arnold J. Stromberg

Dr. Bing Zhang Department of Statistics

Producción científica: Article › revisión exhaustiva

1 Cita (Scopus)

Resumen

Many statistical techniques require that computations be done on all subsets of size r in a data set of size n. Typically, this is done lexographically, i.e., with nested for-loops. If an exchange one point update formula is available, then it is used on the inner loop. In this paper we discuss a method of counting through all subsets of size r in a data set of size n by changing only one element between successive subsets. Such methods have been studied in the applied mathematics literature but are mostly unknown to statisticians. The advantage of such methods is that an update formula can be used at every step, thus potentially saving computation time. The method used to compute the next subset in the list requires some computation time, and thus the new method will only be faster if the update formula is sufficiently faster than doing the computation from scratch.

Idioma original	English
Páginas (desde-hasta)	489-500
Número de páginas	12
Publicación	Communications in Statistics - Theory and Methods
Volumen	25
N.º	3
DOI	https://doi.org/10.1080/03610929608831709
Estado	Published - 1996

Nota bibliográfica

Funding Information:
'John Hinkle is a Ph.D. student and Arnold Stromberg is an Assistant Professor in the Department of Statistics at the University of Kentucky, 817 Patterson Office Tower, Lexington, KY 40506-0027. Hinkle was partially supported by the College of Arts and Sciences at the University of Kentucky and initial work on this manuscript by Stromberg was supported by NSF grant DMS-9204380 and NSA grant MDA-904-92-H-3077. The authors thank Carl Brezovcc and Carl Lee for their assistance.

Financiación

'John Hinkle is a Ph.D. student and Arnold Stromberg is an Assistant Professor in the Department of Statistics at the University of Kentucky, 817 Patterson Office Tower, Lexington, KY 40506-0027. Hinkle was partially supported by the College of Arts and Sciences at the University of Kentucky and initial work on this manuscript by Stromberg was supported by NSF grant DMS-9204380 and NSA grant MDA-904-92-H-3077. The authors thank Carl Brezovcc and Carl Lee for their assistance.

Financiadores	Número del financiador
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China	DMS-9204380
University of Kentucky
National Security Agency	MDA-904-92-H-3077
College of Arts and Sciences, Boston University

ASJC Scopus subject areas

Statistics and Probability

Acceder al documento

10.1080/03610929608831709

Otros archivos y enlaces

Citar esto

@article{a7a8d305f0ee4b1293ad646e67a06cd5,

title = "Efficient computation of statistical procedures based on all subsets of a specified size",

abstract = "Many statistical techniques require that computations be done on all subsets of size r in a data set of size n. Typically, this is done lexographically, i.e., with nested for-loops. If an exchange one point update formula is available, then it is used on the inner loop. In this paper we discuss a method of counting through all subsets of size r in a data set of size n by changing only one element between successive subsets. Such methods have been studied in the applied mathematics literature but are mostly unknown to statisticians. The advantage of such methods is that an update formula can be used at every step, thus potentially saving computation time. The method used to compute the next subset in the list requires some computation time, and thus the new method will only be faster if the update formula is sufficiently faster than doing the computation from scratch.",

keywords = "Cook's distance, Distributed computing, Gray code, Jackknife",

author = "Hinkle, \{John E.\} and Stromberg, \{Arnold J.\}",

note = "Funding Information: 'John Hinkle is a Ph.D. student and Arnold Stromberg is an Assistant Professor in the Department of Statistics at the University of Kentucky, 817 Patterson Office Tower, Lexington, KY 40506-0027. Hinkle was partially supported by the College of Arts and Sciences at the University of Kentucky and initial work on this manuscript by Stromberg was supported by NSF grant DMS-9204380 and NSA grant MDA-904-92-H-3077. The authors thank Carl Brezovcc and Carl Lee for their assistance.",

year = "1996",

doi = "10.1080/03610929608831709",

language = "English",

volume = "25",

pages = "489--500",

number = "3",

}

TY - JOUR

T1 - Efficient computation of statistical procedures based on all subsets of a specified size

AU - Hinkle, John E.

AU - Stromberg, Arnold J.

N1 - Funding Information: 'John Hinkle is a Ph.D. student and Arnold Stromberg is an Assistant Professor in the Department of Statistics at the University of Kentucky, 817 Patterson Office Tower, Lexington, KY 40506-0027. Hinkle was partially supported by the College of Arts and Sciences at the University of Kentucky and initial work on this manuscript by Stromberg was supported by NSF grant DMS-9204380 and NSA grant MDA-904-92-H-3077. The authors thank Carl Brezovcc and Carl Lee for their assistance.

PY - 1996

Y1 - 1996

N2 - Many statistical techniques require that computations be done on all subsets of size r in a data set of size n. Typically, this is done lexographically, i.e., with nested for-loops. If an exchange one point update formula is available, then it is used on the inner loop. In this paper we discuss a method of counting through all subsets of size r in a data set of size n by changing only one element between successive subsets. Such methods have been studied in the applied mathematics literature but are mostly unknown to statisticians. The advantage of such methods is that an update formula can be used at every step, thus potentially saving computation time. The method used to compute the next subset in the list requires some computation time, and thus the new method will only be faster if the update formula is sufficiently faster than doing the computation from scratch.

AB - Many statistical techniques require that computations be done on all subsets of size r in a data set of size n. Typically, this is done lexographically, i.e., with nested for-loops. If an exchange one point update formula is available, then it is used on the inner loop. In this paper we discuss a method of counting through all subsets of size r in a data set of size n by changing only one element between successive subsets. Such methods have been studied in the applied mathematics literature but are mostly unknown to statisticians. The advantage of such methods is that an update formula can be used at every step, thus potentially saving computation time. The method used to compute the next subset in the list requires some computation time, and thus the new method will only be faster if the update formula is sufficiently faster than doing the computation from scratch.

KW - Cook's distance

KW - Distributed computing

KW - Gray code

KW - Jackknife

UR - https://www.scopus.com/pages/publications/27844439097

UR - https://www.scopus.com/pages/publications/27844439097#tab=citedBy

U2 - 10.1080/03610929608831709

DO - 10.1080/03610929608831709

M3 - Article

AN - SCOPUS:27844439097

SN - 0361-0926

VL - 25

SP - 489

EP - 500

JO - Communications in Statistics - Theory and Methods

JF - Communications in Statistics - Theory and Methods

IS - 3

ER -

Efficient computation of statistical procedures based on all subsets of a specified size

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto