Binary classification¶

Assign observations to exactly two declared classes through a learned or specified decision rule, keeping scores, thresholds, reference labels, asymmetric errors, prevalence, and evaluation population distinct.

Version: v2 · 2026-08-30 · History
Domain-specific #: 1380
Origin domain: statistical learning
Subdomain: supervised classification

Core Idea¶

Binary classification is the supervised or rule-based decision problem of mapping each eligible instance to one of exactly two mutually distinguished class labels, often by thresholding a real-valued score.^[1] A model or explicit rule compresses observed features into evidence for the two alternatives; a decision boundary partitions the feature space, and comparison with reference labels yields true-positive, false-positive, true-negative, and false-negative outcomes.

Its autonomous residual is the two-class decision architecture with its paired error types and score-to-decision boundary, not classification generally, a continuous probability estimate, or any yes-or-no observation. The identity fails when labels are undefined or overlapping, a score is reported without a decision rule, evaluation leaks training data, a one-class anomaly detector is treated as supervised two-class learning, or accuracy alone hides asymmetric errors and prevalence.

Recognition requires an analyst to define both class semantics and the target population, separate score estimation from thresholding, state training and test provenance, construct the full confusion matrix, and evaluate losses or metrics that match the consequences and prevalence of the application. Once established, it supports two-way detection, screening, quality control, information retrieval, risk triage, algorithm comparison, threshold analysis, and diagnosis of class imbalance, calibration, or distribution shift without turning those uses into the definition.

Structural Signature¶

Carrier: a population or dataset of instances, a two-element label space, a feature representation, and a rule that outputs a class or class score
Inputs or antecedent state: instance space, two label meanings, training information, feature map, scoring rule, threshold or direct decision rule, reference labels, sampling design, loss function, and evaluation population
Constitutive operation: A model or explicit rule compresses observed features into evidence for the two alternatives; a decision boundary partitions the feature space, and comparison with reference labels yields true-positive, false-positive, true-negative, and false-negative outcomes
Invariant: the output space contains exactly two declared classes and the classifier implements a reproducible mapping from eligible inputs to one of them under a fixed decision convention
Recognition test: define both class semantics and the target population, separate score estimation from thresholding, state training and test provenance, construct the full confusion matrix, and evaluate losses or metrics that match the consequences and prevalence of the application
Output or consequence: two-way detection, screening, quality control, information retrieval, risk triage, algorithm comparison, threshold analysis, and diagnosis of class imbalance, calibration, or distribution shift
Failure boundary: labels are undefined or overlapping, a score is reported without a decision rule, evaluation leaks training data, a one-class anomaly detector is treated as supervised two-class learning, or accuracy alone hides asymmetric errors and prevalence

What It Is Not¶

It is not the whole field of statistical learning; many objects in that field do not satisfy its constitutive rule.
It is not its canonical example. A classifier outputs a score for class positive and assigns positive when the score exceeds a declared threshold, producing a two-by-two table against held-out reference labels. That is an instance, not a definition.
It is not Quantification (machine learning). Quantification estimates class prevalence in a population; binary classification assigns labels to individual instances, even though aggregation of those assignments can be used as a biased prevalence estimator.
It is not an unrestricted metaphor. A nominally binary label may hide an abstain state, uncertain reference, multilabel membership, changing prevalence, or rejected inputs; those states must be modeled rather than silently forced into one class

Scope of Application¶

Binary classification applies when the analyst can specify a population or dataset of instances, a two-element label space, a feature representation, and a rule that outputs a class or class score and establish that the output space contains exactly two declared classes and the classifier implements a reproducible mapping from eligible inputs to one of them under a fixed decision convention. The entry concerns the mathematical and statistical task. Domain decisions, especially medical, legal, employment, or credit decisions, require independent validation, governance, and applicable professional or legal standards.^[2]

Recognition. define both class semantics and the target population, separate score estimation from thresholding, state training and test provenance, construct the full confusion matrix, and evaluate losses or metrics that match the consequences and prevalence of the application
Comparison. Compare legitimate instances through label definition, population, features, supervision, model family, score scale, threshold, class prevalence, error costs, imbalance, calibration, sampling, and distribution shift.
Boundary. A nominally binary label may hide an abstain state, uncertain reference, multilabel membership, changing prevalence, or rejected inputs; those states must be modeled rather than silently forced into one class
Use. Preserve every assumption when using the identity for two-way detection, screening, quality control, information retrieval, risk triage, algorithm comparison, threshold analysis, and diagnosis of class imbalance, calibration, or distribution shift.

Clarity¶

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because positive and negative are conventional labels rather than value judgments, and their denominators change across sensitivity, precision, false-positive rate, and related metrics. The disciplined statement is that the object counts as Binary classification exactly when the output space contains exactly two declared classes and the classifier implements a reproducible mapping from eligible inputs to one of them under a fixed decision convention

Identity and measurement remain separate. Observed performance is conditional on reference-label quality, sampling, prevalence, threshold, and distribution; confidence intervals and subgroup analyses are needed before generalizing. Approximation or noisy evidence may weaken a classification without changing its definition.

Manages Complexity¶

The abstraction compresses hard and probabilistic classifiers, linear and nonlinear boundaries, generative and discriminative models, cost-sensitive rules, reject options, balanced sampling, and threshold-free ranking evaluation into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares label definition, population, features, supervision, model family, score scale, threshold, class prevalence, error costs, imbalance, calibration, sampling, and distribution shift and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning¶

Type the carrier. Establish a population or dataset of instances, a two-element label space, a feature representation, and a rule that outputs a class or class score and reject examples from a different problem.
Lock the rule. Express that the output space contains exactly two declared classes and the classifier implements a reproducible mapping from eligible inputs to one of them under a fixed decision convention independently of one notation or implementation.
Derive carefully. Infer two-way detection, screening, quality control, information retrieval, risk triage, algorithm comparison, threshold analysis, and diagnosis of class imbalance, calibration, or distribution shift only under the stated assumptions.
Stress-test. Contrast the legitimate boundary case—A nominally binary label may hide an abstain state, uncertain reference, multilabel membership, changing prevalence, or rejected inputs; those states must be modeled rather than silently forced into one class—with this counterexample: estimating a continuous probability of default without specifying how it is converted into either class is scoring or risk estimation, not yet a complete binary classifier.

Knowledge Transfer¶

Transfer within statistical learning is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from A classifier outputs a score for class positive and assigns positive when the score exceeds a declared threshold, producing a two-by-two table against held-out reference labels. to A document-filtering system can classify each eligible page as relevant or not relevant to a fixed query and collection policy. demonstrates that continuity.^[3]

Outside the domain, only the skeleton—partition eligible cases into one of two named alternatives using evidence and an explicit boundary—travels automatically. The terms class, label, feature, score, threshold, decision boundary, confusion matrix, sensitivity, specificity, precision, recall, calibration, and prevalence retain domain-specific meanings, so every role and inference must be revalidated.

Examples¶

Canonical¶

A classifier outputs a score for class positive and assigns positive when the score exceeds a declared threshold, producing a two-by-two table against held-out reference labels. Changing the threshold changes sensitivity and false-positive rate without changing the underlying scores, showing that model, score, decision, and evaluation are separate roles. It is canonical because the carrier, rule, invariant, and consequence are all inspectable.^[1]

Mapped back: a population or dataset of instances, a two-element label space, a feature representation, and a rule that outputs a class or class score → A model or explicit rule compresses observed features into evidence for the two alternatives; a decision boundary partitions the feature space, and comparison with reference labels yields true-positive, false-positive, true-negative, and false-negative outcomes → the output space contains exactly two declared classes and the classifier implements a reproducible mapping from eligible inputs to one of them under a fixed decision convention → two-way detection, screening, quality control, information retrieval, risk triage, algorithm comparison, threshold analysis, and diagnosis of class imbalance, calibration, or distribution shift

Applied / In Practice¶

A document-filtering system can classify each eligible page as relevant or not relevant to a fixed query and collection policy. Precision and recall then depend on the reference judgments and candidate population; the same numerical score need not support the same operational threshold in another collection. It qualifies only after the same diagnostic and failure boundary are checked.^[2]

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Exact identity vs. practical recognition. The constitutive condition may be exact while evidence is indirect. Diagnostic: Can the reviewer state both the condition and the warrant?
T2: Canonical form vs. variants. hard and probabilistic classifiers, linear and nonlinear boundaries, generative and discriminative models, cost-sensitive rules, reject options, balanced sampling, and threshold-free ranking evaluation can preserve or change the identity. Diagnostic: Which named role is invariant across the variants?
T3: Compression vs. hidden assumptions. The label is useful only while prerequisites remain visible. Diagnostic: Can each downstream inference be traced to a declared assumption?
T4: Autonomy vs. reduction. The candidate uses broader structures but claims the two-class decision architecture with its paired error types and score-to-decision boundary, not classification generally, a continuous probability estimate, or any yes-or-no observation. Diagnostic: Does that residual still support independent recognition after the parent and neighbors are subtracted?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is partition eligible cases into one of two named alternatives using evidence and an explicit boundary; its identity-bearing terms are class, label, feature, score, threshold, decision boundary, confusion matrix, sensitivity, specificity, precision, recall, calibration, and prevalence. Those terms determine admissible objects, evidence, and consequences inside statistical learning.

Structural Core vs. Domain Accent¶

The structural core is a carrier governed by A model or explicit rule compresses observed features into evidence for the two alternatives; a decision boundary partitions the feature space, and comparison with reference labels yields true-positive, false-positive, true-negative, and false-negative outcomes and tested by define both class semantics and the target population, separate score estimation from thresholding, state training and test provenance, construct the full confusion matrix, and evaluate losses or metrics that match the consequences and prevalence of the application. The domain accent is constitutive rather than decorative, so an analogy that preserves only the skeleton is not another instance of Binary classification.

The proposed strict upward parent is prime:classification. The task literally sorts instances into discrete categories by a rule and is the two-label specialization of the accepted Classification Prime. The edge is proposal-only and points to a frozen prior-baseline Prime.

The entry does not collapse into the parent because the two-class decision architecture with its paired error types and score-to-decision boundary, not classification generally, a continuous probability estimate, or any yes-or-no observation A thematic neighbor is declined whenever it does not literally subsume that rule.

The prospective workspace queue contains one strict upward edge to prime:classification. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Binary classification Domain-specific

Parents (1) — more general patterns this builds on

Binary classification is a kind of Classification Prime

The proposed strict upward parent is prime:classification.

Hierarchy path (1) — routes to 1 parentless root

Binary classification → Classification

Neighborhood in Abstraction Space¶

Binary classification sits in a moderately populated region (53^rd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Concept Learning & Classification (8 abstractions)

Nearest neighbors

Oversampling and undersampling in data analysis — 0.88
Statistical thinking — 0.88
Concept class — 0.88
Error-driven learning — 0.88
Summary statistics — 0.87

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Binary regression. Models a binary response probabilistically and can supply scores, but classification additionally fixes a decision rule.
One-class classification. Learns support or novelty relative to one modeled class rather than two labeled alternatives.
Multilabel classification. Allows several labels to apply simultaneously and is not reduced to binary classification unless each label is treated as a separately declared task.
Hypothesis testing. Controls evidential decisions under a sampling model; its null/alternative structure is not automatically a predictive classifier.

References¶

[1] Richard O. Duda, Peter E. Hart, and David G. Stork, Pattern Classification, 2^nd ed., Wiley, 2001, chapters 2–3, ISBN 978-0-471-05669-0. registry ↩a ↩b

[2] Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The Elements of Statistical Learning, 2^nd ed., Springer, 2009, chapters 2, 4, and 7, DOI 10.1007/978-0-387-84858-7. registry ↩a ↩b

[3] Tom Fawcett, 'An Introduction to ROC Analysis,' Pattern Recognition Letters 27(8), 861–874 (2006), DOI 10.1016/j.patrec.2005.10.010. registry ↩