Package-level declarations
Types
Whether a sample is large enough for the number of components to be answerable at all.
Structural facts about a sorted sample that determine which partitions can exist, computed once in O(n) and reused by every partition generator, refiner, and search over that sample.
Which cut positions a run of equal values rules out.
One family successfully fitted to one group, retained as a candidate component.
Why the criterion chose the number of components it chose, and how much that is worth.
A procedure-calibrated test of a hypothesised component count against one more than itself.
Memoizes group fits by index range, so that a group range fitted once is never fitted again for the same sample.
Fits the catalog of candidate families to a contiguous group of sorted observations.
One family that was attempted for a group and rejected, with the estimator's own explanation.
How much data the fitted component count needs, and whether this sample has it.
What a sample says about a component count the analyst proposed.
What moving the cuts revealed about the reported fit.
An immutable contiguous partition of sorted data into k groups, represented by the interior cut positions rather than by copying the data.
What the workflow advises after looking at the data but before fitting anything.
A half-open range of observation indices from which a component is estimated.
Computes estimation windows from assignment groups.
Whether a fitted mixture reproduces the sample it came from.
The real sample against a sample drawn from the fitted density, side by side.
Whether the fitted density is consistent with the data it was fitted to.
One summary of the data set beside the same summary of the fitted density.
What the criterion gained by adding each component, against what it charged for it.
The outcome of fitting every candidate family to one group: those that succeeded, and those that did not together with why.
Assesses how much a mixture recommendation depends on the particular sample it was fitted to.
What repeated refitting on resampled data said about a recommendation.
One assembled mixture: a partition, one fitted component per group, and the mixing weights implied by the group sizes.
How much of a fresh sample a fitted mixture accounts for.
Everything known about a sample before a mixture is fitted to it.
The observed-data log-likelihood of a mixture, together with the diagnostics needed to know whether that number can be compared with another one.
Fits a mixture of continuous distributions to univariate data by partitioning the sorted sample, fitting a component to each part, and ranking the assembled mixtures.
Everything produced by one modeling run.
The sample, with the cuts the method actually made on it.
How far the fitted density moves, and how much of the sample changes hands, when the cuts between the components are nudged.
Fits continuous families to a group by delegating to KSL's continuous distribution modeler.
The component counts a sample does not rule out.
One evaluated candidate: the assembled mixture and its criterion value.
Computes how close a fitted mixture is to the truth.
How well a fitted mixture recovered the mixture that generated the data.
Every observation, as a dot.
How far a k-component mixture is from the nearest mixture with one component fewer, and the sample size that distance implies.
Estimates each component from a window that reaches past its group into the neighbours, while leaving the assignment alone.