Maximum a posteriori - Maximum a posteriori, usually abbreviated MAP, selects a value or hypothesis that maximizes its posterior probability after evidence is observed.
Maximum expected utility - Maximum expected utility, or MEU, is the principle of choosing the available action or policy with the highest probability-weighted utility across its...
Maximum Flow - Maximum flow is the largest feasible amount of a single commodity that can move from a designated source to a designated sink through a capacitated network.
Maximum margin separator - A maximum margin separator is a decision boundary that separates labeled classes while maximizing its distance from the nearest training examples.
Mechanism design - Mechanism design studies how to choose rules for interactions among participants so that their strategic behavior produces desired outcomes.
Mel-frequency cepstral coefficient - A mel-frequency cepstral coefficient, or MFCC, is one value in a compact representation of an audio frame's spectral shape.
Membership function (mathematics) - A membership function assigns each element of a specified domain a degree of membership in a fuzzy set, usually between 0 and 1.
Memoization - Memoization is an optimization that stores a function's previously computed results and reuses them when the same relevant inputs occur again.
Metalevel learning - Metalevel learning is learning how to control a problem-solving process from experience.
Metaphor - A metaphor describes or understands one thing in terms of another, transferring selected features or relationships between them.
Metareasoning - Metareasoning is reasoning about how to reason.
Metropolis-Hastings - Metropolis - Hastings is a Markov chain Monte Carlo algorithm that generates a sequence of samples using proposals followed by acceptance or rejection.
Min-conflicts - Min-conflicts is a local-search method for constraint satisfaction that repeatedly repairs a complete assignment.
Minimal mappings - Minimal mappings are compact, nonredundant sets of semantic relationships between two lightweight ontologies from which the remaining relationships can be...
Minimax - Minimax is a decision principle for choosing actions against an adversary who can respond in the least favorable way.
Minimax decision - A minimax decision is an action selected because it leads to the best value the player can secure against optimal opposing play.
Minimax search - Minimax search is a game-tree search procedure that evaluates possible continuations by alternating maximizing and minimizing choices.
Minimax value - The minimax value of a game state is the utility obtained from that state when both players make optimal opposing choices in the specified game model.
Minimum description length - Minimum description length, or MDL, is a principle for choosing models by how compactly they describe observed data.
Minimum-remaining-values - Minimum-remaining-values, usually abbreviated MRV, is a variable-selection heuristic for constraint satisfaction.
Minimum slack - Minimum slack is a scheduling priority rule that favors the eligible activity or job with the least remaining timing flexibility.
Minors - A graph minor is a graph obtainable from another graph by deleting vertices, deleting edges, and contracting edges.
Missing effect - A missing effect is a real consequence of an action that is absent from the agent's action model.
Missing precondition - A missing precondition is a necessary condition for an action that has been left out of the action's model.
Missing state variable - A missing state variable is a relevant aspect of the world that an agent's state representation does not include.
Mixed strategy - A mixed strategy is a probability distribution over a player's pure strategies in a game.
Mixing rate - Mixing rate describes how quickly a stochastic process loses the influence of its initial state and approaches its long-run distribution, under conditions...
Mixing time - Mixing time is the number of steps a Markov chain needs to bring its distribution sufficiently close to its stationary distribution, according to a...
Mixture density - A mixture density is a probability density formed by adding component densities with nonnegative weights that sum to one.
Mixture of Gaussians - A mixture of Gaussians is a probability distribution built from a weighted combination of Gaussian, or normal, distributions.
Modal logic - Modal logic is a family of formal systems that extends ordinary logical statements with ways to express qualifications such as necessity, possibility...
Modal operators - Modal operators are logical symbols that qualify a statement with a meaning such as “necessarily,” “possibly,” “knows,” or “believes.
Model-based reasoning - Model-based reasoning draws conclusions by using an explicit representation of how a system is structured or behaves.
Modularity-based communities - Modularity-based communities are groups of graph nodes identified by seeking a partition with a high modularity score.
Modus ponens - Modus ponens is a rule of logical inference: from “if P, then Q” and “P,” infer “Q. It is a truth-preserving pattern of deduction in classical logic.
Monoidal t-norm logic - Monoidal t-norm logic, usually abbreviated MTL, is a formal system of mathematical fuzzy logic associated with all left-continuous triangular norms and...
Monotonic preference - A monotonic preference is a preference that moves consistently in a specified direction as an attribute increases, with other relevant conditions held fixed.
Monotonicity - In logical reasoning, monotonicity is the property that adding premises cannot remove conclusions already entailed by the original premises.
Monte Carlo - Monte Carlo refers to a family of computational methods that use random sampling to estimate quantities or study the behavior of a model.
Monte Carlo planning - Monte Carlo planning uses sampled possible futures to help choose actions.
Monte Carlo tree search - Monte Carlo tree search, or MCTS, is a search method that grows a decision tree through repeated sampled simulations and uses their results to guide further...
Mosaic effect - The mosaic effect occurs when combining separate pieces of information reveals something that the pieces did not clearly reveal on their own.
Most general unifier - A most general unifier, or MGU, is a substitution that makes two symbolic expressions identical while imposing no unnecessary restrictions on their variables.
Most likely state - The most likely state is a state assigned the greatest probability by an agent's current probability distribution over possible states.
Most probable explanation - A most probable explanation, or MPE, is a joint assignment to all unobserved variables that has the highest probability given the observed evidence in a...
Motion blur - Motion blur is the smearing of image detail caused by movement during the time an image sensor collects light.
Move generation - Move generation is the process of producing the candidate or legal actions available from a game position or search state.
MTD(f) - MTD(f) is a minimax search algorithm that repeatedly calls a memory-enhanced alpha-beta search with a narrow, zero-window test until lower and upper bounds...