Parity learning - Parity learning is the task of learning which input bits are combined by an exclusive-or rule to produce a binary output.
Park test - The Park test is a regression-based diagnostic for heteroscedasticity, using an auxiliary relationship between the logarithm of squared residuals and the...
Parse tree - A parse tree is a tree-shaped representation of a grammatical analysis.
PARSEVAL - PARSEVAL is a family of measures for evaluating constituency parses by comparing their constituent boundaries, and commonly their labels, with a reference...
Parsimony - Parsimony is the principle of using no more model complexity than is needed for the task and the evidence.
Parsing - Parsing is the process of analyzing an expression's structure according to a grammar or structural model.
Part of speech - A part of speech is a grammatical category used to describe a word's characteristic behavior, such as noun, verb, adjective, or adverb.
Part-of-speech tagging - Part-of-speech tagging is the task of assigning grammatical category labels to words in context, using a defined tagset.
Partial Area Under the ROC Curve - Partial area under the ROC curve, or partial AUC, summarizes a classifier's ranking performance over a specified portion of the receiver operating...
Partial assignment - A partial assignment gives values to some of the variables in a problem while leaving others unassigned.
Partial autocorrelation - Partial autocorrelation at lag k measures the linear relationship between a time-series value and its value k periods earlier after accounting for the...
Partial autocorrelation function - The partial autocorrelation function, or PACF, describes the linear association between a time series and its lagged values after accounting for the...
Partial correlation - Partial correlation measures the association between two variables after accounting for their relationships with one or more specified control variables.
Partial Dependency - A partial dependency is a functional dependency in which an attribute depends on a proper subset of a larger determinant, commonly part of a composite...
Partial derivative - A partial derivative measures how a function changes as one input variable changes while its other input coordinates are held fixed.
Partial information - Partial information means that an agent's available evidence does not determine every relevant aspect of the situation.
Partial least squares path modeling - Partial least squares path modeling is a structural-modeling approach that estimates relationships among constructs using weighted combinations of observed...
Partial least squares regression - Partial least squares regression, or PLS regression, predicts one or more responses using a smaller set of components constructed from the predictors with...
Partial-order planning - Partial-order planning is an approach to automated planning that specifies only the action orderings needed to support a valid plan.
Partial program - A partial program is a program specification that deliberately leaves some choices unresolved.
Partial regression - Partial regression examines the linear relationship between an outcome and a predictor after removing the linear contributions of other specified predictors.
Partial solution - A partial solution is an intermediate candidate that specifies some, but not all, of what is needed to solve a problem.
Partialing - Partialing, also spelled partialling, is statistically adjusting for one or more variables when examining relationships among other variables.
Partially open question - A partially open question is a survey question that combines structured response options with an opportunity to answer in the respondent's own words.
Particle - A particle is a grammatical term for certain small function words whose interpretation depends on association with another word, phrase, or construction.
Particle MCMC - Particle MCMC is a family of Monte Carlo methods that combines particle-based sequential simulation with Markov chain Monte Carlo to sample from difficult...
Particle path degeneracy - Particle path degeneracy is the loss of diversity in the earlier parts of trajectories represented by a particle filter.
Partition - In data engineering, a partition is a defined subdivision of a larger dataset or storage structure.
Partitioned global address space - Partitioned global address space, or PGAS, is a parallel programming model that provides a global view of addressable data while retaining a distinction...
Partitioning strategy - A partitioning strategy is the plan for dividing a dataset into manageable parts and maintaining those parts over time.
Pass at k (pass@k) - Pass at k, written pass@k, measures the chance or observed rate that at least one of k generated attempts solves a task under a specified correctness test.
Passive-aggressive learning - Passive-aggressive learning is a family of online learning methods that update a predictor as labeled examples arrive.
Passive learning - Passive learning, in the reinforcement-learning sense used here, means learning about the value or consequences of following a fixed policy.
Password fatigue - Password fatigue is the frustration, strain or exhaustion associated with managing repeated password and authentication demands.
Path - A path is an ordered sequence of connected locations, nodes or states. In AI search, it describes successive states linked by available actions.
Path analysis (statistics) - Path analysis is a statistical method for estimating a specified network of relationships among observed variables.
Path consistency learning - Path consistency learning, abbreviated PCL, is a reinforcement-learning approach that jointly trains policy and value estimates to satisfy...
Path finding - Path finding is the process of finding a sequence of valid connections from a starting state to a destination.
Path planning - Path planning is the process of finding a feasible route from a starting configuration to a goal configuration while respecting obstacles and relevant...
PATR-II - PATR-II is a declarative formalism for representing linguistic information in computer-processable grammars.
Pattern grammar - A pattern grammar is a set of rules describing how simpler components can combine into structured patterns.
Pattern matching - Pattern matching is the process of checking whether data fit a specified form and, where supported, extracting values from matching parts.
Pattern recognition - Pattern recognition is the broad discipline of getting machines to spot regularities in data and act on them: classifying images, reading handwriting...
Pattern search (optimization) - Pattern search is a family of derivative-free optimization methods that look for better solutions by evaluating an objective function at a structured set of...
Pattern theory - Pattern theory is a mathematical framework, associated with Ulf Grenander, for describing complex patterns through simpler elements, their relationships...
Payoff function - A payoff function assigns a numerical value to an outcome or combination of players' actions, representing how desirable it is to a particular player.
PD controller - A PD controller is a feedback controller that combines a proportional response to the current error with a derivative response to how that error is changing.
PDDL - PDDL stands for Planning Domain Definition Language.