BM25 - BM25 is a ranking method for text retrieval that scores documents using query-term matches, term rarity, term frequency and document length.
Boid - A boid is a simulated bird-like agent in Craig Reynolds's flocking model.
Boltzmann exploration - Boltzmann exploration is an action-selection strategy that samples actions with probabilities determined by a softmax of their estimated values.
Boltzmann Machine Network - A Boltzmann machine network is a stochastic neural model that assigns probabilities to configurations through an energy function.
Bonferroni inequality - The Bonferroni inequality, in the sense used here, states that the probability of at least one of several events occurring cannot exceed the sum of their...
Bonferroni test - A Bonferroni test is a multiple-testing procedure that controls the probability of making at least one false rejection across a specified family of...
Boolean - Boolean refers to a logical value or expression with the two truth values true and false.
Boosting - Boosting is an ensemble method that trains models one after another, each new model concentrating on the mistakes the earlier ones made, and combines them...
Bootstrap - The bootstrap is a statistical resampling method used to approximate how an estimate would vary across repeated samples.
Bootstrap confidence interval - A bootstrap confidence interval is an uncertainty interval for a population quantity constructed using repeated resampling and recalculation of a statistic.
Bootstrap error-adjusted single-sample technique - The bootstrap error-adjusted single-sample technique, abbreviated BEST and sometimes BEAST, is a specialized nonparametric method for assessing how a new...
Bootstrap test - A bootstrap test uses resampling to approximate the reference distribution needed for a statistical hypothesis test.
Botnet - A botnet is a network of compromised computers or other connected devices that can be directed to perform activities for an unauthorized operator.
Bottom-up design - Bottom-up design, in the relational database context used here, develops a schema from detailed attributes and their dependency rules.
Bound pronoun - A bound pronoun is a pronoun interpreted as a variable whose value depends on a binding expression, often a quantified noun phrase.
Boundary leakage - In Fourier image analysis, boundary leakage is unwanted spectral energy caused by a mismatch where opposite image edges meet under the discrete Fourier...
Boundary set - In version-space learning, a boundary set contains the most specific or most general hypotheses still consistent with the observed examples.
Boundary tones - Boundary tones are tonal events associated with the edges of prosodic phrases in speech.
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 minimization - Bounded minimization seeks a minimum of an objective while restricting its input to specified lower and upper limits.
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.
Bounding box - A bounding box is a rectangular region used to indicate the location and approximate extent of an object or other area of interest in an image.
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.
Boustrophedon cell decomposition - Boustrophedon cell decomposition divides a robot's free workspace into regions that can be covered with orderly back-and-forth passes.
Box - Behnken design - A Box - Behnken design is a response-surface experimental design used to fit quadratic relationships between quantitative factors and an outcome.
Box-Benkhen experiment - A Box - Behnken experiment uses a response-surface design to study how several controllable factors affect an outcome and to fit a quadratic model.
Box filter - A box filter is an image filter that combines values within a rectangular neighborhood using equal weights.
Box-Jenkins methodology - The Box-Jenkins methodology is an iterative approach to building time-series models, especially ARMA and ARIMA models, through identification, parameter...
Box-Pierce test - The Box-Pierce test is a portmanteau test that assesses whether a sequence has autocorrelation across a chosen set of initial lags.
Box plot - A box plot summarizes the distribution of numerical data using a median, quartiles and whiskers.
Box's M test - Box's M test is a statistical test of whether several populations have the same covariance matrix.
Boyce-Codd Normal Form - Boyce-Codd Normal Form, or BCNF, is a relational database normal form requiring every determinant in a nontrivial functional dependency to be a superkey.
Boykov-Kolmogorov - Boykov-Kolmogorov is an algorithm for computing maximum flow between a source and a sink in a capacitated graph.
Bracketed notation - Bracketed notation represents a hierarchical structure as text by placing each unit and its contents inside matching brackets or parentheses.
Bradley-Terry Model - The Bradley-Terry model is a probabilistic model for pairwise comparisons.
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.
Breach - A breach is a loss of control over, compromise of or unauthorized access to protected information or systems.
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.
Bregman divergence - A Bregman divergence measures the gap between a convex function's value at one point and its first-order linear approximation around another point.
Bregman method - The Bregman method is a family of iterative projection techniques for convex feasibility and related convex optimization problems.
Breusch - Godfrey test - The Breusch - Godfrey test is a regression diagnostic for serial correlation in the model's errors up to a specified lag order.
Breusch - Pagan test - The Breusch - Pagan test is a regression diagnostic for heteroskedasticity: error variance that changes with specified explanatory variables.
Bridging inference - A bridging inference connects new information in a text to information already available by supplying an unstated relationship.