Statistical modelling constructs, fits, checks, and interprets a statistical model for observed data.
A response variable is the outcome whose variation is described by a statistical model or whose change is compared across treatments. Its unit, measurement procedure and observation time must be specified. An outcome consisting of a feature count is one response per sketch, not one independent experimental response per feature.
Design of experiments chooses experimental units, treatments, replication, blocks in experimental design and randomization so that scientifically useful treatment contrasts can be estimated with meaningful standard errors. Allocation determines which measurements supply independent treatment information.
A split-plot design randomizes one factor to whole plots and another to subplots within each whole plot. Whole-plot treatment effects and subplot treatment effects therefore use different error ANOVA strata. Whole plots provide replication for the first factor; their subplots do not supply extra independent whole-plot replication. Within-whole-plot comparisons can remove a shared additive whole-plot variance component.
A factorial design includes every combination of specified factor levels. Balanced replication permits separate estimation of marginal effects and interaction terms. The factor allocation, not the number of subsamples, determines the appropriate error term for each effect.
A crossover design assigns each subject a sequence of treatments in successive periods. Subject blocking can reduce between-subject variation; balanced sequences can separate treatment from period effects. A carryover effect or irreversible change can invalidate a simple within-subject comparison.
A carryover effect is an effect of a previous treatment on a later response. Balanced transitions help prevent a treatment from being preceded disproportionately by one particular alternative, but do not ensure that carryover effects vanish or are separately identifiable in every model.
A completely randomized design assigns treatments directly to available experimental units using complete randomization, without blocking. Fixed group sizes can be enforced. The residual then includes uncontrolled between-unit variation.
A block groups experimental units expected to have similar background responses. Comparing treatments within blocks can reduce the variance of an estimator. Block allocation must be specified before responses are used to evaluate treatment effects.
A block design assigns treatments to experimental units partitioned into blocks. Its incidence counts record how often treatment occurs in block . Balance and connectedness determine which treatment contrasts are estimable and how much adjustment for blocks costs.
A row-column design has two crossed partitions of experimental units into rows and columns. Equal treatment proportions in every row and every column make treatment contrasts orthogonal to both centered block spaces. A repeated three-treatment arrangement in a six-by-six array can give a balanced example.
A randomized complete block design places every treatment in every block, with a common replication pattern, and uses independent within-block randomization. The usual basic version has one occurrence of each treatment per block; equal repeated occurrences give a replicated complete-block version. Such equal-proportion designs are orthogonal block designs.
An orthogonal block design has centered treatment-indicator vectors orthogonal to centered block-indicator vectors on the experimental units. With treatment replication , block size and total , this is equivalent to . It permits additive block adjustment without changing treatment estimates.
Replication in experimental design assigns a treatment to multiple independently allocated experimental units. Repeated measurements on one unit can improve measurement precision without providing independent treatment replication.
A replicate is an independently allocated instance of a treatment on an experimental unit. Independent replicates permit estimation of response variation; subsamples within one unit do not supply additional independent treatment replication.
An experimental unit is a unit to which a treatment is assigned under the experimental allocation. A whole orchard can be an experimental unit even when responses are recorded separately on its trees. Different factors in a split-plot design can have different experimental units.
An observational unit is the object or occasion supplying a recorded response. Several observational units can belong to one experimental unit; counting them as independent treatment replicates creates pseudoreplication.
A fractional polynomial uses selected real powers of a positive covariate to model a smooth regression effect. Power zero denotes a logarithm, and a repeated power can generate a term . Such terms permit a wider family than ordinary integer-power polynomials, but their selection adds modeling uncertainty and requires validation.
A restricted cubic spline represents a smooth covariate effect by joined cubic pieces, with linear tails beyond the boundary knots. It allows nonlinear regression effects while controlling extrapolation. In a Cox proportional-hazards model, test the nonlinear basis coefficients jointly and report the fitted log-hazard or hazard-ratio curve with uncertainty.
Quantile regression models a conditional quantile of a response, rather than its conditional mean. Fitting by the check loss uses an asymmetric absolute-error penalty, so different values of describe different parts of the response distribution. Nonlinear models may use any identifiable continuous regression function, not only a linear predictor.
If the conditional error distribution function is continuous and strictly increasing with -quantile zero, the conditional expected check loss is uniquely minimized at zero fitted displacement. If every incorrect parameter differs from the true regression function on an event of positive probability, averaging these nonnegative conditional risk differences gives strict identifiability of the true parameter. Integrable errors and bounded regression functions supply finite risks.
The check loss weights positive errors by and negative errors by . It is convex, continuous and Lipschitz with constant . At it is half the absolute error. Its expected value elicits a quantile: asymmetry determines which probability level the fitted location targets.
For an integrable response with continuous strictly increasing distribution function , the population risk for the check loss has derivative . Bounded difference quotients justify differentiation by dominated convergence. Integrating the derivative between the unique quantile and another location proves strict optimality. This proves identifiability without requiring a positive density.
Outcome propensities can vary between individuals because of their measured covariates. A linear regression can describe this variation by allowing its conditional mean to depend on those predictors.
A pairwise comparison model specifies the probability that one alternative beats another. Outcomes can be used to infer latent abilities through maximum likelihood estimation or another statistical method.
The Bradley-Terry model assigns positive abilities and the displayed pairwise winning probabilities. Multiplying all abilities by the same positive scalar leaves the probabilities unchanged, so identifiability requires a normalization. In log abilities , the model has comparison probabilities obtained from the logistic function. Either parametrization induces the same ordering of players.
Let count observed wins and count comparisons of players . Differentiating the log-likelihood with respect to gives observed wins minus model-expected wins. Vanishing derivatives therefore give the displayed equations. One equation is redundant because abilities are identifiable only up to common scaling.
For a connected tree of comparisons with every observed win fraction strictly between zero and one, the Bradley-Terry model can fit every empirical edge probability exactly. Fix one positive strength to remove scaling ambiguity, then propagate strength ratios along tree edges. Edge log-ratios are independent real coordinates and each binomial log-likelihood term is strictly concave, proving existence and uniqueness of the normalized estimate. Cycles would impose extra compatibility relations.
For observed neighbor win fractions on the path graph , the normalized Bradley-Terry model estimate with is . This is backward propagation of empirical odds along the path. Every edge proportion is fitted exactly, and strict concavity in edge log-ratios proves that this is the unique global maximum.
Orient the edges of a comparison tree and set . After anchoring one vertex strength, these edge quantities are unconstrained coordinates. The Bradley-Terry model probability is the logistic function of , and its binomial log-likelihood contribution is . Differentiating gives the fitted odds .
For one win of player 1 over 2, one win of 3 over 1, and wins of 2 over 3, the Bradley-Terry score equations force abilities proportional to , where satisfies the displayed equation. Its left side is strictly increasing on . For , and all three estimates tie. For , , giving the ranking .
In log abilities, the negative Hessian matrix is a weighted Graph Laplacian of the comparison graph. If that comparison graph is a connected graph and the abilities are finite, the quadratic form vanishes only for constant vectors. Thus the log-likelihood is strictly concave after fixing the common additive constant. If the directed graph of observed wins is a strongly connected directed graph, letting contrasts diverge forces at least one observed-win probability to zero, so the log-likelihood tends to negative infinity. A finite maximizer exists and is unique up to common scaling of abilities.
A fixed effect represents an unknown nonrandom coefficient in the specified mean model. In a Gaussian linear mixed model, is the population mean, while random effects are latent draws from a distribution whose parameters are estimated. Treating a group coefficient as fixed or random concerns the modelling and inferential target, not whether its estimate changes across samples.
Geostatistics models spatial dependence for estimation and prediction. A mean or drift describes systematic variation, while a covariogram or semivariogram describes residual dependence. Kriging combines the two for spatial prediction.
Kriging predicts a spatial random field by a linear combination of observations chosen to minimize prediction variance subject to the appropriate mean constraints. Its different forms depend on whether the mean is known, an unknown constant, or an unknown regression drift.
For unknown drift , a full-column-rank design matrix , a known positive-definite matrix observation covariance matrix , and target drift row , universal kriging minimizes prediction variance subject to . Equivalently, with , predict . The first term is the estimated trend alone; the second is a correlated residual prediction.
For an unknown constant mean, ordinary kriging minimizes error variance subject to weights summing to one. This unbiasedness constraint distinguishes it from simple kriging.
For known zero mean, invertible observation covariance , target covariance vector and target variance , simple kriging predicts with error variance . Completing the covariance quadratic form proves optimality. A multivariate normal distribution makes this the exact conditional mean and variance.
The covariogram is the displacement-dependent covariance of a second-order stationary field. It is an even positive-definite kernel. A semivariogram determines differences , but not an arbitrary constant covariance component.
An intrinsically stationary random field has constant mean and finite increment variances depending only on displacement. Its semivariogram is . Second-order stationarity implies this property, but the converse can fail: subtracting the value at a fixed origin from a stationary field preserves increments and makes marginal variance vary with location.
For an intrinsically stationary random field, the semivariogram is . It is even and vanishes at zero. With constant mean, a second-order stationary field has . An isotropic model writes it as a function of nonnegative distance.
For a distance bin , the empirical semivariogram is . A nonconstant drift adds half its squared pairwise differences to the expected raw semivariogram. Residual semivariograms estimate spatial dependence after adjusting for the drift.
The exact range is a separation beyond which the semivariogram reaches its sill. A Gaussian semivariogram with nonzero structured variance approaches its sill asymptotically and therefore has infinite exact range. Software range parameters may instead specify a scale.
A practical range specifies a distance at which a chosen fraction of the structured sill is reached. For the Gaussian semivariogram , the 95-percent practical range is , obtained by solving .
The sill is the large-distance level of a semivariogram when that limit exists. For covariance tending to zero, the sill is the total marginal variance; a nugget plus a structured component has total sill . A nonzero constant covariance component is invisible to the semivariogram.
The nugget is the discontinuity of a distance semivariogram at zero. Independent location-specific noise of variance contributes covariance at zero displacement and zero covariance at nonzero displacement, so its semivariogram is .
If is stationary, then has exactly the same increments and semivariogram, but is generally nonconstant. Thus existence of a stationary covariance model for a semivariogram does not imply stationarity of every process with that semivariogram. Adding an independent random constant also leaves the semivariogram unchanged while changing the covariogram.
For and nonnegative variances, admits covariance . The Gaussian kernel is positive definite because it is the Fourier transform of the density of a Gaussian distribution. Adding independent white noise supplies the nugget effect. Its scale is . For , its exact range of a semivariogram is infinite. If , it is a pure nugget effect with no nontrivial structured range.
A saturated model has enough independently varying mean parameters to match every observed response or response cell. In individual Bernoulli distribution data its fitted probabilities are , and its maximum log-likelihood is zero under . It defines the reference in a binomial deviance.
A hurdle model separately models whether a count is zero and, conditional on being positive, uses a zero-truncated count distribution. Unlike zero inflation, the positive-count component cannot generate zeros.
Zero inflation augments a count distribution with an additional mass at zero. An observed zero can arise either from the structural-zero component or from the ordinary count component; the latent source is not observed.
A structural-zero component in a count mixture produces a count identically equal to zero. If its mixture weight is and the ordinary component also assigns mass to zero, the observed zero probability is . Thus an observed zero does not reveal the latent component membership. A shared component for a repeated count profile makes the whole profile zero and induces dependence between its components.
With structural-zero probability , size and count mean , the model assigns to zero and to positive counts. Its expectation is and its variance is , by the law of total variance. A logarithmic link function can relate the count-component mean to predictors.
If and the distribution of is the same at each observation time with finite positive mean, integrating out adds to the marginal log-mean intercept. The conditional positive- mean ratio and the marginal mean ratio both equal . This is a property of the multiplicative logarithmic link function; it need not hold for nonlinear links such as the logit link.
For known size and , the expectation-maximization algorithm gives structural-zero responsibility for positive counts and for zero counts. This is Bayes theorem. Maximizing the expected complete-data log-likelihood gives and a weighted negative binomial regression with weights . The objective separates into a Bernoulli mixing term and a weighted count term, which proves the update.
An estimator is a function of observed data used to estimate a parameter or a specified function of parameters. Its definition cannot involve the unknown parameter. Its bias, variance, and expected loss describe its performance under repeated sampling.
A U-statistic averages a symmetric function of distinct sample observations over all unordered -tuples. For independent and identically distributed observations it is an unbiased estimator of . Omitting repeated indices can remove diagonal contributions in quadratic plug-in estimators.
A categorical variable takes values in a finite or countable set of labels. A regression model usually represents an unordered categorical predictor by indicator variables relative to a reference level in a regression factor.
A regression factor is a categorical variable encoded by indicator columns or treatment contrasts in a statistical model. A factor with observed levels normally contributes statistical degrees of freedom when an intercept is present. The reference level in a regression factor has coefficient zero under treatment contrasts. Coding a year as a factor permits arbitrary year effects rather than imposing a linear trend.
An ordinal categorical variable has categories with a meaningful order. Replacing its levels by numerical scores imposes a quantitative spacing and can replace several unrelated level effects by one regression coefficient when a linear trend is scientifically reasonable.
An indicator variable of an event is one on and zero outside . Indicator columns encode categorical levels in a design matrix.
A latent variable is an unobserved random quantity introduced to describe dependence, hidden structure, or an indirect data-generating mechanism in a statistical model.
Persistent unmeasured differences between individuals can generate outcome dependence after adjusting for observed covariates. A random intercept is one representation. Conditional independence given that latent variable need not persist after it is integrated out; apparent history dependence can therefore occur without true state dependence.
Factor analysis writes an observation as , where the low-dimensional latent variable describes shared variation. In the isotropic Gaussian model and independently, the observation has covariance .
In factor analysis with one factor and fixed noise variance , let be the current loading vector, , and . The expectation-maximization algorithm update isThe conditional factor means are and their variances are ; maximizing the expected complete-data log-likelihood gives the formula.
A random effect is a latent variable used to describe variation between observational units or dependence among related observations. Its distribution supplements the fixed effects used in statistical modelling. Independent random effects produce extra variability; correlated random effects can produce serial dependence.
Random effects are crossed when an observation can belong to levels of two grouping factors without one grouping factor being nested within the other. Independent location intercepts and incubator slopes, for example, contribute separate terms to the observation covariance matrix.
A random slope multiplies a predictor by a group-specific latent coefficient. With , a contribution induces covariance for two observations in group . A random slope does not necessarily include a random intercept.
When a person's latent slope has normal distribution , its th quantile is . Multiply by an elapsed time to obtain the corresponding latent change quantile. This describes population variation between people; it is distinct from a confidence interval for the mean slope and from a prediction interval that includes measurement error.
The Gaussian model with and independent has marginal law . Its group coefficients are integrated out of the marginal likelihood function. The special random-slope model uses predictor values in the grouping columns of .
The expectation-maximization algorithm alternates an E-step, which takes the conditional expectation of a complete-data log objective over latent variables, and an M-step, which maximizes that expected objective over the parameters.
For a common unconstrained Markov kernel on the edges of a rooted tree, let be the conditional expectation of the number of transitions , given observed leaves and the old Markov kernel. The expectation-maximization algorithm maximizes over row probability distributions, giving . A row with zero total count is unrestricted by this objective. Belief propagation computes the counts exactly on a tree.
In the expectation-maximization algorithm for a stationary autoregressive process of order one, a single missing interior value has a normal distribution conditional on its neighbors. The E-step uses both its conditional mean and its conditional second moment, not just mean imputation. The M-step maximizes the expected stationary complete-data log-likelihood, including the initial-observation density and the conditional-variance contribution to the two adjacent innovation squares.
For , the Jensen inequality givesThus any expectation-maximization algorithm M-step that increases cannot decrease the observed-data likelihood function. Monotonicity does not by itself assert convergence to a global maximum.
Functional data analysis treats each observation as a function or another infinite-dimensional object. Means, covariance operators, spectral coordinates, and regression operators replace their finite-dimensional vector and matrix counterparts.
Functional time warping represents phase variation by composing a function with an increasing endpoint-preserving diffeomorphism of its domain. Registration seeks to separate this phase variation from amplitude variation in the observed functions.
For an absolutely continuous real function , its square-root velocity function is where , with value zero where . Under an increasing reparameterization , it transforms as .
Functional principal component analysis diagonalizes a compact covariance operator. Its eigenfunctions are principal component functions, and projecting a centered observation onto them gives uncorrelated functional principal component scores.
A principal component function is a normalized eigenfunction of a covariance operator, ordered by decreasing eigenvalue .
The functional principal component score of a centered function along is . Its variance is the corresponding covariance eigenvalue .
The Karhunen–Loève expansion writes a centered square-integrable random function as in mean square, where the are principal component functions and the uncorrelated scores satisfy .
The functions give the Brownian covariance eigenbasis on , with eigenvalues . Integrating by parts against gives independent coefficients . Pathwise L2 completeness yields in L2 and the squared-norm series.
A functional mean test tests whether the mean of a Hilbert-space-valued random variable is zero. The squared-norm statistic has a weighted chi-squared limit under the null, while an FPCA test standardizes and truncates the coordinates.
For covariance eigenpairs , the -coordinate FPCA mean statistic is . Under a zero-mean null and standard estimation conditions, its plug-in version converges to a chi-squared distribution with degrees of freedom.
For two independent samples of size with a common covariance eigenbasis, the two-sample FPCA mean statistic isUnder equality of means and consistent pooled eigencomponent estimates, it converges to a chi-squared distribution with degrees of freedom.
A covariance-operator distance compares positive trace-class operators while respecting either their linear embedding in operator space or a chosen factorization geometry.
For covariance operators , their Fréchet mean under the square-root distance isThis follows because taking positive square roots embeds the operators into the Hilbert space of self-adjoint Hilbert-Schmidt operators.
For factorizations , the Procrustes distance is , where ranges over unitary operators on the factor space. Equivalently,
A functional linear model relates functional or scalar responses to functional predictors through a linear operator.
A scalar-on-function linear model has , where the response is scalar and the predictor and slope are functions. Basis truncation turns it into a finite-dimensional linear regression.
For basis functions , the second-derivative roughness penalty has matrix entries . It is positive semidefinite and satisfies .
A function-on-function linear model has . If the centered error is independent of , then is the regression operator applied to .
For centered Hilbert-space random variables and , the cross-covariance operator is . In the functional linear model with independent centered error, .
Goodness of fit describes how closely a fitted statistical model agrees with the observed data in aspects relevant to the model assumptions.
A goodness-of-fit test compares a discrepancy statistic with its distribution under a fitted null model. A small p-value indicates that the observed discrepancy would be unusual if that model were correct.
A contingency table records counts classified by combinations of categorical variables.
A two-by-two contingency table cross-classifies observations by two binary variables, producing four cell counts and two pairs of marginal totals.
A mixture model represents a population distribution as a weighted combination of component distributions.
Articles were limited to the first 100 out of 577 total.
Articles by others on the same topic
Statistical modeling is a mathematical approach used to represent complex real-world processes through the use of statistical techniques. By developing models, researchers and analysts can quantify relationships among variables, make predictions, and infer conclusions about a population based on sample data.