Learning to rank - Learning to rank is the use of machine learning to order items according to relevance, preference or another defined criterion.
Learning vector quantization - Learning vector quantization, or LVQ, is a family of supervised classification methods that represents classes with labeled prototype vectors.
Least absolute deviation regression - Least absolute deviation regression, often called least absolute deviations or LAD regression, estimates a model by minimizing the sum of absolute residuals...
Least Angle Regression - Least Angle Regression, usually abbreviated LARS, is an algorithm that builds a piecewise-linear path of linear regression fits by progressively...
Least commitment - Least commitment is a search and planning principle that delays choices until they are needed, while making the commitments required for progress.
Least-constraining-value - Least-constraining-value is a value-ordering heuristic for constraint satisfaction problems.
Least privilege - Least privilege is the security principle of giving a person, account, or software component only the access and capabilities needed for its function.
Least squares - Least squares is a fitting principle that chooses model parameters to minimize the sum of squared residuals.
Least-squares Analysis - Least-squares analysis estimates model parameters by minimizing the sum of squared residuals: the differences between observed values and the model's fitted...
Least squares estimate - A least squares estimate is a parameter value obtained by minimizing a sum of squared discrepancies between observed data and a specified model.
Least-squares minimization - Least-squares minimization is the process of finding parameters that make a collection of residuals as small as possible under a squared-error objective.
Least squares regression - Least squares regression fits a relationship between predictors and a response by minimizing the sum of squared response residuals.
Least-squares support vector machine - A least-squares support vector machine, or LS-SVM, is a kernel-based learning formulation that uses squared errors and equality constraints in place of the...
Least-squares temporal-difference learning - Least-squares temporal-difference learning, usually abbreviated LSTD, estimates a value function by solving a system of equations built from observed...
Least-to-most prompting - Least-to-most prompting is a language-model prompting strategy that first decomposes a problem into simpler subproblems and then solves them in sequence...
Leave-one-out cross-validation - Leave-one-out cross-validation evaluates a learning procedure by repeatedly training on all observations except one and testing on the single omitted...
Lebesgue integral - The Lebesgue integral is a way to add up a measurable function's values with respect to a measure. The measure specifies how much weight different sets receive.
Legal Extension - A legal extension is a particular state of a relation that satisfies the constraints specified for its schema.
Legendre pseudospectral method - A Legendre pseudospectral method approximates continuous functions with polynomials associated with Legendre-based nodes and enforces governing equations at...
Leiden Community Detection - Leiden community detection is a graph-clustering algorithm that groups nodes by optimizing a chosen measure of community structure.
Lemke's algorithm - Lemke's algorithm is a complementary-pivot method for solving a linear complementarity problem.
Lemma - A lemma is the canonical or dictionary-style form used to represent a set of related word forms.
Lemmatization - Lemmatization is the process of mapping a word form to its dictionary-style base form, called a lemma.
Lempel - Ziv - Oberhumer - Lempel - Ziv - Oberhumer, usually abbreviated LZO, is a family of lossless compression methods and an associated software library designed with fast...
Lempel - Ziv - Stac - Lempel - Ziv - Stac, commonly called Stac LZS, is a lossless dictionary-based compression method that represents repeated byte strings using a sliding...
Lempel - Ziv - Storer - Szymanski - Lempel - Ziv - Storer - Szymanski, usually abbreviated LZSS, is a lossless compression approach that represents data using literal symbols and references to...
Lens-profile correction - Lens-profile correction uses a stored model of a lens and compatible capture conditions to compensate for predictable optical effects in an image.
Lepage test - The Lepage test is a two-sample rank test that combines evidence about location and scale differences.
Leptokurtic - Leptokurtic describes a distribution whose kurtosis exceeds that of a normal distribution: Pearson kurtosis greater than 3, or excess kurtosis greater than...
Lernmatrix - The Lernmatrix, German for learning matrix, is an early associative-learning architecture developed by Karl Steinbuch around 1960.
Lesk algorithm - The Lesk algorithm is a dictionary-based approach to word-sense disambiguation: choosing which meaning of an ambiguous word fits its context.
Level cost - Level cost is a planning-graph heuristic that assigns a goal literal the index of the first proposition level at which it appears.
Level of abstraction - A level of abstraction is a degree of detail at which a system, problem, or action is represented.
Level set - A level set is the collection of points at which a function has the same specified value.
Level set (data structures) - A level-set data structure stores sampled values of a function whose chosen contour, usually the zero contour, represents a curve or surface.
Level-set method - The level-set method represents a moving curve or surface implicitly as a level of a function, usually its zero level, and evolves that function using a...
Level sum - Level sum is a planning-graph heuristic that adds the individual level costs of a set of goal literals.
Levels - Levels is an image-editing adjustment that remaps tonal values using controls for the input black point, input white point, midtones, and output range.
Levenberg - Marquardt algorithm - The Levenberg-Marquardt algorithm is an iterative method for nonlinear least-squares problems.
Levene test - The Levene test assesses whether two or more groups have equal variances by comparing their absolute deviations from a group-specific center.
Levenshtein coding - Levenshtein coding is a variable-length binary code for nonnegative integers.
Levenshtein Distance - Levenshtein distance is the minimum number of single-symbol insertions, deletions, and substitutions needed to transform one sequence into another, when...
Leverage - Leverage is a regression diagnostic that measures how unusual an observation's predictor configuration is relative to the fitted design and how strongly its...
Lewandowski-Kurowicka-Joe distribution - The Lewandowski-Kurowicka-Joe distribution, usually called the LKJ distribution, is a probability distribution over positive-definite correlation matrices.
Lexical ambiguity - Lexical ambiguity occurs when a word or lexical expression has more than one possible interpretation.
Lexical category - A lexical category is a grammatical class associated with a word or lexical item, such as noun, verb, adjective, or adverb.
Lexical choice - Lexical choice is the selection of words or lexical expressions to convey an intended message.
Lexical density - Lexical density measures how much of a text consists of lexical, or content-bearing, material.