Decision Rules Under Uncertainty

← Back to Domain-Specific Families

Abstractions about making optimal decisions from uncertain or imprecise probabilistic information, covering classification and loss-based decision rules (Bayes classifier, loss function, decision-theoretic rough sets), robust and belief-based inference (gamma-minimax inference, pignistic probability), and a self-organizing map for unsupervised pattern discovery.

6 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Bayes classifier — The decision rule that assigns each feature vector to the class with greatest posterior probability, minimizing expected classification loss when the true class distributions and loss function are known.
• Decision-theoretic rough sets — A probabilistic rough-set framework that derives lower, boundary and negative decision regions by minimizing expected loss under conditional class probabilities.
• Gamma-minimax inference — A robust statistical decision rule that minimizes worst-case risk over a specified class Gamma of plausible prior distributions rather than committing to one prior.
• Loss Function — A real-valued rule assigning penalty to an action or prediction under a realized state or target, whose expectation or sample aggregate defines the risk to minimize.
• Pignistic probability — A decision probability obtained from a belief function by distributing each focal set's mass equally among its members when a single probabilistic choice is required.
• Self-organizing map — Train prototype vectors arranged on a low-dimensional lattice by repeatedly moving a best-matching unit and its lattice neighbors toward input samples, producing a topology-oriented representation of high-dimensional data.