All AI terms, A to Z

7,198 terms

# A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

  • Dunnett's test - Dunnett's test is a multiple-comparison procedure for comparing several treatment means with one designated control mean.
  • Dunning-Kruger Effect Bias - The Dunning - Kruger effect describes a pattern in which people performing poorly on a particular task overestimate their performance or standing relative...
  • Duplicate sample - In the survey terminology used by the OECD glossary, a duplicate sample is an additional sample collected alongside a first sample in the same survey under...
  • Duplicated sample - A duplicated sample, in the OECD glossary's survey terminology, is a sample whose units are investigated twice by different parties of investigators.
  • Durability (database systems) - Durability in database systems is the property that a committed transaction's effects survive the failures covered by the system's guarantee.
  • Duration - Duration is the amount of time an action or activity takes between its start and end.
  • Durbin test - The Durbin test is a rank-based test of treatment effects in a balanced incomplete block design.
  • Durbin-Watson statistic - The Durbin-Watson statistic measures how strongly successive regression residuals differ relative to their overall squared size.
  • Durbin - Wu - Hausman test - The Durbin-Wu-Hausman test is a family of econometric tests used to assess whether specified regressors can be treated as exogenous in a model that also has...
  • Dutch eligibility trace - A Dutch eligibility trace is a recursively updated feature-memory vector used in reinforcement-learning algorithms such as true online TD(lambda).
  • Dyadic distribution - In source coding, a dyadic distribution is a discrete probability distribution whose positive probabilities are integer powers of one half, such as 1/2, 1/4...
  • Dykstra's projection algorithm - Dykstra's projection algorithm finds the point nearest to a given starting point within an intersection of closed convex sets.
  • Dyna-Q - Dyna-Q is a reinforcement-learning approach that integrates direct Q-learning, model learning and planning.
  • Dyna-Q with exploration bonus (Dyna-Q+) - Dyna-Q with exploration bonus, usually called Dyna-Q+, extends Dyna-Q by encouraging the agent to revisit state-action pairs that have gone untried for a...
  • Dynamic backtracking - Dynamic backtracking is a constraint-search method that revises a decision responsible for a conflict while preserving other assignments that need not be...
  • Dynamic Bayesian network - A dynamic Bayesian network is a probabilistic graphical model for variables that evolve across a sequence, commonly over time.
  • Dynamic Conditional Correlation - Dynamic Conditional Correlation, or DCC, is a class of multivariate time-series models that allows correlations to change over time conditional on past...
  • Dynamic epistemic logic - Dynamic epistemic logic studies how knowledge and beliefs change when information is communicated or events are observed.
  • Dynamic factor - A dynamic factor is an unobserved component that evolves over time and helps explain shared movement across several observed time series.
  • Dynamic Markov compression - Dynamic Markov compression, or DMC, is a lossless compression approach that adaptively models the probabilities of incoming bits using a changing state...
  • Dynamic mode decomposition - Dynamic mode decomposition, usually abbreviated DMD, is a data-driven method for representing observed evolution through spatial patterns and associated...
  • Dynamic model - A dynamic model, in the machine-learning usage of the supplied glossary, is a model that is retrained or updated frequently as new data become available.
  • Dynamic perfect hashing - Dynamic perfect hashing is a method for maintaining a changing dictionary of keys while preserving collision-free placement for the currently stored set...
  • Dynamic programming - Dynamic programming is a method for solving a problem by combining solutions to smaller subproblems and reusing their results.
  • Dynamic range - Dynamic range is the ratio between the largest and smallest meaningful signal levels in a specified system or scene.
  • Dynamic search problems - Dynamic search problems are search problems whose relevant description changes over time, such as changing edge costs, newly discovered obstacles, or a...
  • Dynamic SQL - Dynamic SQL is SQL whose statement text or structure is determined at runtime rather than being completely fixed in the program beforehand.
  • Dynamic state - A dynamic state describes the quantities needed to model how a system will evolve under its dynamics.
  • Dynamic time warping - Dynamic time warping, or DTW, aligns two sequences while allowing differences in their local timing.
  • Dynamical system - A dynamical system describes how a state changes over time according to a rule.
  • E-optimal design - E-optimal design chooses an experimental allocation that maximizes the smallest eigenvalue of its information matrix.
  • E-values - E-values are nonnegative statistical evidence values obtained from random variables whose expected value is at most one under every distribution allowed by...
  • Eager learning - Eager learning builds a general predictive model from training examples before new prediction requests arrive.
  • Early-arriving fact - An early-arriving fact is a measured business event that reaches a data warehouse before its full descriptive context is available.
  • Early exit - Early exit is a deep-learning inference strategy that produces a prediction before an input has passed through every layer of a network.
  • Early goal test - An early goal test checks whether a newly generated search node satisfies the goal before the node is later selected from the frontier for expansion.
  • Early playout termination
  • Early stopping - Early stopping is ending a model's training at the point where it performs best on fresh data, before it starts memorizing the training set.
  • Earth mover's distance - Earth mover's distance, or EMD, measures how much work is needed to transform one distribution of mass into another when moving mass has a specified cost.
  • Echo State Network - An echo state network, or ESN, is a recurrent neural-network approach in which a dynamic reservoir transforms input sequences into internal states and a...
  • Ecological Fallacy Bias - The ecological fallacy is the mistake of treating a relationship or characteristic observed for groups as if it necessarily held for individuals within...
  • Ecological study - An ecological study investigates relationships using groups, populations, places, or time periods as the units of analysis.
  • Edge-augmentation - Edge-augmentation is the process of adding edges to a graph to achieve a desired structural property.
  • Edge case - An edge case is an input or situation near the limits of a system's assumptions, rules, or operating conditions, or an unusual combination that challenges...
  • Edge computing - Edge computing places some data processing close to the devices, people or physical processes that produce or use the data.
  • Edge data integration - Edge data integration, in the business-user sense used here, connects data to meet a particular local need alongside centrally provided enterprise...
  • Edge detection - Edge detection identifies locations in an image where intensity, color, or another image quantity changes in a way associated with a boundary.
  • Edge device - An edge device is a computing device operating at or near the part of a network where data is produced or first processed.

Previous page Page 42 of 150 Next page

  • Home
  • Daily AI Updates
  • Blog
  • AIFBL Academy
  • AI Glossary
  • Products and Tools
  • Store
  • Free CFO AI Prompt Pack
  • About Shihan Sheriff
  • Privacy Policy
  • Terms of Use
  • Refund Policy
  • Cookie Policy
  • Earnings Disclaimer