Optimal Grouping, Spacing, Stratification, and Piecewise Constant Approximation

DOI10.1137/1030092zbMath0668.62019OpenAlexW2053721714MaRDI QIDQ3821413

No author found.

Publication date: 1988

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1969.1/183187

zbMATH Keywords

stratificationcomputational algorithmexistence and uniqueness of solutionspiecewise polynomial approximationspacingoptimal knotsoptimal groupingpopulation quantile functionoptimal breakpoint selection

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Parametric hypothesis testing (62F03) Point estimation (62F10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (13)

Two principal points of symmetric, strongly unimodal distributions ⋮ Uniqueness of principal points for univariate distributions ⋮ Minimum-error classes for matching parts ⋮ A principal subspace theorem for 2-principal points of general location mixtures of spherically symmetric distributions ⋮ Principal points of a multivariate mixture distribution ⋮ An application of Cheng's lemma for minimizing the asymptotic variance of best asymptotically normal estimators based on sample quantiles ⋮ Estimation of the Generalized Lambda Distribution Parameters for Grouped Data ⋮ Kernel density estimators from quantized data ⋮ A note on the use of kernel functions in weighted estimators ⋮ A parametric \(k\)-means algorithm ⋮ Impartial trimmed \(k\)-means for functional data ⋮ On the relationship between functions with the same optimal knots in spline and piecewise polynomial approximation ⋮ Self-consistency: A fundamental concept in statistics

This page was built for publication: Optimal Grouping, Spacing, Stratification, and Piecewise Constant Approximation