Trivial Functional Dependency - A trivial functional dependency is a dependency X → Y in which every attribute of Y is already included in X.
Trivial MVD - A trivial multivalued dependency, or trivial MVD, is a multivalued dependency X →→ Y that holds automatically because Y is contained in X, or because X...
True negative - A true negative is an outcome in which a classifier predicts the negative class and the reference label is also negative.
True online TD(lambda) - True online TD(lambda) is a temporal-difference prediction algorithm whose efficient backward-view updates exactly match a specified online forward view for...
True positive - A true positive is an outcome in which a classifier predicts the positive class and the reference label confirms that class.
True positive rate - True positive rate is the proportion of actual positive cases that a classifier correctly identifies as positive. It is also called recall or sensitivity.
Truncated Newton method - A truncated Newton method approximately solves the Newton equations inside each optimization iteration, stopping the inner solve before full accuracy when...
Truncated normal distribution - A truncated normal distribution is the distribution of a normally distributed variable conditional on its value lying within specified bounds.
Truncated singular value decomposition - Truncated singular value decomposition is a low-rank representation of a matrix obtained by retaining only its largest singular values and associated left...
Trust - Trust is a person's confidence that an AI system can be relied upon in a particular situation.
Trust region - A trust region is a neighborhood around the current point within which an optimization algorithm uses a local model to propose a step.
Trust region policy optimization - Trust region policy optimization, or TRPO, is a policy-gradient reinforcement-learning method that seeks an improved policy while limiting how much its...
Trustworthiness - Trustworthiness is the extent to which an AI system merits reliance for a specified purpose, supported by relevant evidence about its behavior, limitations...
Trustworthy AI - Trustworthy AI is AI developed and used in ways that provide justified grounds for reliance in its intended context.
Truth - In logic-based AI, truth concerns whether a statement holds under a specified interpretation or model.
Truth discovery - Truth discovery is a family of data-integration methods that estimates which claims are most likely to be correct when multiple sources provide conflicting...
Truth-revealing - Truth-revealing describes a mechanism whose incentives make accurately reporting private information an appropriate strategy under specified assumptions.
Truth value - A truth value is the value assigned to a statement according to a logic's semantics. In classical two-valued logic, the possible values are true and false.
Tsallis entropy - Tsallis entropy is a parameterized entropy measure defined for probabilities pi by Sq=k(1−Σpiᑫ)/(q−1), for q≠1.
Tsetlin machine - A Tsetlin machine is a learning model that uses teams of Tsetlin automata to construct propositional-logic clauses.
Tucker decomposition - Tucker decomposition represents a multiway array, or tensor, using a smaller core tensor and one factor matrix for each mode.
Tukey - Duckworth test - The Tukey-Duckworth test is a simple two-sample test that uses counts of nonoverlapping observations at opposite ends of the combined data.
Tukey's B method - Tukey's B method is a multiple-comparison procedure for comparing group means that combines features of Tukey's honestly significant difference procedure...
Tukey's HSD test - Tukey's HSD test, short for honestly significant difference, is a procedure for comparing every pair of group means while controlling the familywise...
Tukey's range test - Tukey's range test is a common name for Tukey's honestly significant difference procedure, which compares group means using the studentized range distribution.
Tukey's test of additivity - Tukey's test of additivity is a one-degree-of-freedom test for a particular form of nonadditivity in a two-way layout.
Tukey's trend test - Tukey's trend test is an approach to detecting a dose-response trend by examining regression slopes under several prespecified dose scales, commonly...
Tunstall coding - Tunstall coding is a lossless variable-to-fixed-length coding method.
Tuple - A tuple is one structured combination of values.
Tuple Constraint - A tuple constraint is a data integrity rule that can be evaluated on each tuple, or row, independently of other tuples.
Tuple-oriented approach - A tuple-oriented approach handles database records one tuple or row at a time at the application or interface level.
Tuple space - A tuple space is a shared coordination space in which concurrent processes exchange structured collections of values called tuples.
Tuple Type - A tuple type describes the structure of a tuple or record: its component attributes or fields and their associated types.
Tuple-versioning - Tuple-versioning retains multiple versions of a database row, or tuple, to represent changes over time.
Turbo decoding - Turbo decoding is an iterative error-correction method in which component decoders exchange soft information to estimate transmitted bits from noisy...
Turing Test - The Turing Test is a family of conversational evaluations inspired by Alan Turing's 1950 imitation game.
Tweedie's formula - Tweedie's formula relates a Bayesian estimate of an underlying signal to the probability distribution of its noisy observations.
Two-filter smoothing - Two-filter smoothing is a way to infer past hidden states by combining a forward filtering calculation with information propagated backward from later...
Two-image operation - A two-image operation combines corresponding pixel values from two images to produce an output image.
Two-pass verification - Two-pass verification is a data-entry control in which information is entered twice and the resulting values are compared to identify disagreements.
Two-phase commit protocol - The two-phase commit protocol, or 2PC, coordinates an all-or-nothing decision for a transaction involving multiple transactional participants.
Two-phase locking - Two-phase locking, or 2PL, is a database concurrency-control protocol that divides each transaction's lock use into two phases.
Two-proportion Z-test - A two-proportion Z-test is a large-sample hypothesis test comparing two independent population proportions.
Two-sample hypothesis testing - Two-sample hypothesis testing uses observations from two samples to assess a specified claim about their source populations or distributions.
Two-scale (base/detail) decomposition - A two-scale, or base/detail, decomposition separates an image into a base layer describing broader variation and a detail layer describing what remains.
Two-scale blending - Two-scale blending combines images by treating broad tonal variation and fine detail differently.
Two-scale style transfer - Two-scale style transfer changes a photograph's appearance by treating broad tonal structure and local detail separately, using a reference image to guide...