Average neighbor degree - Average neighbor degree is the mean number of connections held by a node's immediate neighbors.
Axiom - An axiom is a statement accepted as a starting assumption within a formal theory or knowledge system.
B* - B* is a best-first tree-search procedure that seeks to establish which choice at the root is better than its alternatives.
Back-propagation through time - Backpropagation through time, or BPTT, computes training gradients for a recurrent model by treating its successive time steps as an unfolded computational...
Background knowledge - Background knowledge is information already available to an AI system that helps it interpret observations, reason about a domain or learn new relationships.
Backjumping - Backjumping is a constraint-search technique that responds to a dead end by returning to an earlier decision relevant to the conflict, potentially skipping...
Backmarking - Backmarking is a constraint-search technique that remembers information from earlier compatibility checks so that the solver can avoid repeating checks...
Backtracking search - Backtracking search builds a candidate solution through a sequence of tentative choices.
Backward-chaining - Backward chaining is a goal-directed inference method that starts with a question and works backward through rules that could establish its answer.
Balance - Balance, in the fairness sense used by the source glossary, requires a classifier to have approximately equal false-positive rates and false-negative rates...
Bandit superprocess - A bandit superprocess is a sequential decision problem made from several independent Markov decision processes, with a shared restriction that only one...
Baseline - Baseline has two important AI-related meanings in the supplied sources. In model evaluation, it is a reference method or result used for comparison.
Batch inference - Batch inference is the use of a trained model to produce predictions for a collection of inputs together, typically outside an immediate user-request path.
Batch Inference Pipeline - A batch inference pipeline is a repeatable program or workflow that takes a collection of input data and a trained model, produces predictions and delivers...
Beam search - Beam search is a search strategy that keeps only a limited number of promising partial candidates and discards the rest. The limit is called the beam width.
Belief function - A belief function is a mathematical representation of evidential support used in Dempster - Shafer theory.
Belief propagation - Belief propagation is a message-passing method for computing marginal probabilities in a probabilistic graphical model.
Belief state - A belief state represents an agent's information about the situation it may currently be in.
Benchmarking - Benchmarking is the systematic measurement and comparison of algorithms or systems using a defined set of tasks, data, metrics and test conditions.
Bernoulli - A Bernoulli distribution describes a random variable with two possible values: 1 with probability p and 0 with probability 1 − p.
Best bin first - Best Bin First, or BBF, is an approximate nearest-neighbor search method that explores promising regions of a k-d tree in priority order.
Best-first search - Best-first search is a family of search methods that repeatedly expands the most promising waiting node according to an evaluation function.
Best node search - Best Node Search, or BNS, is a game-tree search method that aims to identify the best move without necessarily calculating its exact minimax value.
Biconditional - A biconditional is a logical statement meaning if and only if.
Biconnected components - Biconnected components are maximal connected parts of an undirected graph that have no internal articulation point: removing a single vertex does not split...
Bidirectional search - Bidirectional search looks for a connection by searching forwards from a starting state and backwards from a goal.
Binary constraint - A binary constraint is a restriction involving exactly two variables in a constraint satisfaction problem. It specifies which pairs of values are allowed.
Binary resolution - Binary resolution is a logical inference rule that combines two clauses by eliminating one complementary pair of literals and retaining the remaining...
Binary search - Binary search finds a target or a boundary in an ordered search space by repeatedly examining a middle position and discarding the half that cannot contain...
Binding list - A binding list is a collection of associations between logical variables and the terms or values that replace them.
Bipartite - A bipartite graph is a graph whose vertices can be divided into two disjoint sets so that every edge joins a vertex in one set to a vertex in the other.
BL (logic) - BL, or Basic Fuzzy Logic, is Petr Hájek's formal logical system capturing principles shared by continuous t-norm-based fuzzy logics.
Blank node - A blank node is an RDF node used to describe something without giving it an explicit global name.
Boid - A boid is a simulated bird-like agent in Craig Reynolds's flocking model.
Boundary set - In version-space learning, a boundary set contains the most specific or most general hypotheses still consistent with the observed examples.
Bounded cost search - Bounded cost search is a search problem in which the aim is to find a valid solution whose cost does not exceed a specified absolute limit.
Bounded optimality - Bounded optimality is the property of an agent program that achieves the best expected performance available within a specified machine architecture and...
Bounded rationality - Bounded rationality is decision making shaped by limits on information, time, attention, memory, or computation.
Bounded suboptimal search - Bounded suboptimal search seeks a feasible solution whose cost is guaranteed to stay within a specified amount of the optimal cost.
Bounds consistent - Bounds consistent describes a constraint whose remaining domain endpoints each have a supporting assignment under the chosen definition of bounds consistency.
Bounds propagation - Bounds propagation is the repeated tightening of variables' lower and upper limits using constraints.
Boykov-Kolmogorov - Boykov-Kolmogorov is an algorithm for computing maximum flow between a source and a sink in a capacitated graph.
Branching factor - Branching factor is the number of immediate successor choices available from a node in a search tree. It describes how widely a search can expand at each step.
Breadth First Search - Breadth First Search, usually written breadth-first search or BFS, explores a graph in layers outward from a starting node.
Breadth First Search on Edges - Breadth First Search on Edges is a breadth-first graph traversal that reports encountered edges, including edges leading to nodes already discovered.
Brute-force search - Brute-force search solves a problem by systematically generating candidate answers and checking them directly, with little or no problem-specific guidance...
Business rules engine - A business rules engine is software that evaluates explicitly defined rules against business data and determines which conclusions or actions apply.