Adaptive classifier 2026-11-05
An adaptive classifier updates its decision rule or parameters using information acquired while processing further data. In statistical classification, this can specialize an initially broad model to the conditions of a particular stream or document. The update may use supplied labels or examples accepted under a stated trust rule; adaptation is not evidence that every accepted label is correct.
In the 2007 description of Tesseract, satisfactory first-pass words provide examples for a more document-sensitive classifier. The paper motivates this by the limited collection of fonts within a document and describes normalization differences between static and adaptive classification. It explicitly does not describe the adaptive classifier as a simple template matcher.[ref]
A separate toy calculation illustrates parameter adaptation without claiming to reproduce that implementation. Suppose a class is represented by the mean of one measured feature from trusted examples. Accepting another value gives
With , and , the updated mean is . A classifier using that class mean can change its later decisions as a result.
The trust rule matters as much as the arithmetic. If a wrong prediction is accepted as a label, its update can make related wrong predictions more likely. A confidence score can help select examples, but a numerical score is not automatically a calibrated probability of correctness. A useful evaluation compares a frozen baseline and the adaptive system on checked data, including the possibility of degradation as well as improvement.
Statistical classification of emotion categories using measurements of the autonomic nervous system. It requires an independently justified target label, appropriate cross-validation, and evaluation in the population and context where the classifier will be used. Predictive success does not imply that every instance of a category has one invariant physiological pattern.
Confidence score 2026-11-05
A confidence score is a numerical output used to express how strongly a system supports a prediction, particularly in statistical classification. Its meaning depends on the system: it may be an estimated probability, a distance from a decision boundary, or another score whose ordering is useful. A number between zero and one does not by itself establish a probability interpretation. Probability calibration concerns whether predicted probabilities agree with observed frequencies.[ref]
Consider a synthetic binary statistical classification example. Among independent test cases assigned a positive-class score near , suppose actually belong to that class. Their observed fraction agrees with the average predicted probability. If only belong to the positive class, the same scores overstate the observed positive frequency in this group. A reliability diagram groups predictions by their estimated probability and compares each group's mean prediction with its observed positive fraction. Finite groups have sampling variation, so agreement in one group is evidence to assess with its sample size, rather than a guarantee about each case.[ref]
Ordering and probability calibration answer different questions. For scores in , replacing every score by preserves their order but changes to . Thus an unchanged ranking can accompany very different probability statements. Conversely, a system assigning the overall positive fraction to every case can have useful aggregate probability calibration while failing to distinguish cases.
A confidence score can support a threshold for accepting a prediction or passing it to another process. Select and assess that threshold using examples separate from model fitting and representative of the intended inputs. A threshold does not establish its own error rate; observations on suitable test data supply that evidence. Distinguish a positive-class probability from the score of whichever class was selected: they are different quantities when the selected class changes.
Expected calibration error summarizes how reported confidence differs from observed correctness. For top-label statistical classification, the population quantity compares correctness probability conditional on confidence with that confidence. A commonly reported finite-sample estimate groups predictions into confidence intervals and compares the mean confidence and accuracy in each interval.[ref]
For a nonempty bin among predictions, define
Here is confidence in the selected class, not its numerical label. The empirical statistic is
Empty bins have zero weight and need no undefined bin average. The cited paper uses equal-width bins.[ref]
A synthetic example shows why the partition matters. Four predictions have confidences and correctness indicators . With one bin, accuracy and mean confidence are both , so the estimate is zero. With four equal-width bins on , only the last two are populated. Their accuracy/confidence pairs are and , each with half the observations. Thus
This is ten percentage points, despite unchanged predictions and labels.
A zero coarse-bin result can conceal opposing gaps; it does not establish perfect probability calibration or agreement within every subgroup. Report bin boundaries, sample size, confidence convention and scale. Reliability diagrams reveal where the gaps occur, while a scalar expected calibration error supplies their sample-weighted summary. It is distinct from the fraction of incorrect classifications.
Joann G. Elmore 2026-11-05
Joann G. Elmore is a physician whose research examines variability in cancer diagnosis, including how consistently pathologists classify biopsy material. Her research group's description connects that work with statistics and machine learning for evaluating diagnostic decisions.[ref]
In a 2017 primary study, Elmore and colleagues assembled 240 skin biopsy cases and gave participating pathologists sets of 36 or 48 cases. The design included a second interpretation of the same cases at least eight months later; 187 pathologists completed 8,976 interpretations in the first phase. Comparing an observer with their own later reading, with other observers and with a reference panel answers three different questions about statistical classification.[ref]
The distinction is within-observer agreement versus reference agreement. In an illustrative set of 20 cases, an observer might repeat 18 of their earlier classifications but agree with a reference classification on only 14: the two proportions are and . Repeating the same erroneous category increases the first proportion without improving the second. These are invented counts to explain the design, not results from Elmore's study. A consensus reference is an explicitly defined comparison standard; it does not make a panel infallible, and the diagnostic mix of a selected test set must be considered before interpreting an overall agreement percentage.
Figure 1.
Joann G. Elmore. UCLA research-group website, explicitly identified as a headshot of Dr. Elmore.
Machine learning Created 2026-10-18 Updated 2026-11-05
Machine learning develops algorithms that use data or experience to improve performance on a specified task. The task, the experience available to the algorithm and the performance criterion must all be stated. A statistical classification system might learn from labelled training data; an unsupervised learning method instead looks for structure without those labels.[ref]
For example, a linear regression model can learn coefficients predicting a numerical outcome from measured inputs. Minimizing its error on the training data determines a fitted model, but does not establish how well it predicts new observations. A separate test set estimates performance on data withheld from fitting. Overfitting occurs when fitting peculiarities of the training data impairs this generalization; data leakage can make the evaluation misleading.[ref]
Statistical learning supplies tools for reasoning about these prediction and uncertainty questions. A useful learned model is therefore assessed through an explicit task and evaluation, alongside the running time and other resources needed to train and use it.
Use calibrated multispectral imaging of reflected sunlight, with visible, near-infrared and short-wave-infrared bands. A satellite records radiance in several passbands for each ground pixel. Perform geometric registration and atmospheric correction to estimate spectral reflectance, then account for illumination differences on slopes and mask cloud, water and dense vegetation. A false-colour composite, diagnostic band ratios or a trained statistical classification can separate surface lithologies; field observations and representative spectra validate any mapped contact.
Different minerals have different absorption features: iron-bearing materials affect visible/near-infrared spectral reflectance, while hydroxyl-bearing clay minerals and carbonate-bearing rocks can differ in short-wave-infrared bands. Adjacent patches with reproducibly different spectra and coherent geological boundaries are candidates for lithological contacts. This is particularly useful in dry, exposed terrain. Vegetation, soil cover, similar rock compositions, weathering and topographic shadow can hide or mimic a contact; a colour boundary alone is insufficient.
Choose spatial resolution appreciably finer than the narrowest unit being mapped, with several pixels across that unit. Approximately – is suitable for regional contacts separated by hundreds of metres; metre-scale units require finer imagery or field work. Sentinel-2 provides – bands useful for this purpose, while the reflected-light multispectral bands of Landsat are typically . Broad multispectral passbands distinguish many rock assemblages but cannot resolve every narrow mineral absorption feature; hyperspectral imaging is preferable when those features are essential.
Within-observer agreement versus reference agreement distinguishes consistency of an observer's repeated labels from concordance with a separately defined reference. The first asks whether the observer repeats a decision; the second asks whether that decision matches the comparison standard. In statistical classification, neither quantity can replace the other.
For cases, let and be one observer's labels at two readings, and the reference label. Define the two empirical agreement fractions
An original binary example has 100 cases, half reference-positive and half reference-negative. An observer reverses every reference label and repeats that reversal on the second reading. Then while . Perfect repeat agreement can coexist with complete reference disagreement. An observer always assigning the negative label also has perfect repeat agreement, but only 50 percent reference agreement in this balanced example.
A confusion matrix shows which categories contribute to disagreement, whereas a single overall percentage can conceal systematic shifts or an imbalanced case mix. Reference agreement is classification accuracy relative to that reference, not proof that the reference is infallible. A consensus panel, a later outcome and an independent molecular test answer different validation questions.
A primary 2017 study made this distinction experimentally by having pathologists interpret skin-biopsy sets twice, at least eight months apart, and comparing their interpretations with an experienced consensus reference. The study started with 240 cases and reported reproducibility separately from reference concordance.[ref] The delayed repeat reduced immediate recall, but did not transform repeated judgments into independent biological truths.
A useful evaluation preserves case identity, reading order and the exact reference procedure. If a machine learning classifier learns an observer's systematically shifted labels, it may reproduce that observer well while disagreeing with the external reference. Reporting both comparisons makes that limitation visible. Uncertainty estimates should also account for repeated cases and multiple readings rather than counting every label as an independent subject.