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

DOI10.1080/03610929608831709MaRDI QIDQ4337135zbMATH OpenOpenAlexFDO

Authors John E. Hinkle, Arnold J. Stromberg

Publication date 11 November 1997

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610929608831709

zbMATH Keywords

Cook's distancedistributed computinggray codejackknife

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99)

Recommendations

• Efficient sorting during repetitive statistical computations: Algorithms and an application
• Distributional and efficiency results for subset selection
• Approximately optimal subset selection for statistical design and modelling
• Computational implications of reducing data to sufficient statistics
• An asymptotic comparison of subset selection procedures

Cites work

• A Gray code for compositions
• Adjacent interchange generation of combinations
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Approximation Theorems of Mathematical Statistics
• Efficient generation of the binary reflected gray code and its applications
• Gray codes with restricted density
• Index system and separability of constant weight Gray codes
• Jackknife, bootstrap and other resampling methods in regression analysis
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Transposition Graphs

Cited in

(2)

• Properties of the number of iterations of a feasible solutions algorithm
• A method of subdividing genetic data into self-contained subsets

This page was built for publication: Efficient computation of statistical procedures based on all subsets of a specified size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337135)