Commutation matrix - A commutation matrix is a permutation matrix that rearranges a vectorized matrix into the vectorized form of its transpose.
Commutativity - Commutativity means that changing the order of specified operations does not change their result.
Compact letter display - A compact letter display is a concise way to encode the outcomes of a set of pairwise statistical comparisons using letters beside group estimates.
Compact model - A compact model is a small machine-learning model designed to operate on devices with limited computational resources, such as phones, tablets or embedded...
Compact quasi-Newton representation - A compact quasi-Newton representation expresses a curvature-approximation matrix as a simple starting matrix plus a correction assembled from a small...
Compact-support kernel - A compact-support kernel is a kernel that is exactly zero outside a bounded neighborhood.
Compactly supported kernel - A compactly supported kernel is a kernel whose nonzero values are confined to a bounded neighborhood.
Companding - Companding combines compression and expansion of a signal's amplitude range.
Comparative trial - A comparative trial is a study that compares two or more treatment or intervention groups to evaluate differences in outcomes.
Competitive learning - Competitive learning is a learning approach in which processing units compete to respond to an input, and the selected unit or units receive the main...
Competitive ratio - A competitive ratio measures an online algorithm's performance against an optimal offline algorithm that knows the entire input sequence in advance.
Compiled Query - A compiled query is a database query translated into a form that a particular system can execute.
Complement Naive Bayes - Complement Naive Bayes, or CNB, is a classification method derived from multinomial naive Bayes that estimates each class's weights using examples outside...
Complement Of An Event - The complement of an event is the set of all outcomes in the specified sample space for which that event does not occur.
Complementary literals - Complementary literals are a pair consisting of an atom and its negation, such as P and NOT P.
Complementation Rule - The complementation rule is an inference rule for multivalued dependencies in relational databases.
Complementizers - Complementizers are words that mark an embedded clause, especially a clause functioning as the complement of another expression.
Complete assignment - A complete assignment gives a value to every variable in a specified problem.
Complete data - Complete data contain observed values for every variable in the probability model for every example being used to learn that model.
Complete Join - In the terminology used by this glossary's source list, a complete join is a natural join in which every input tuple from both relations participates in at...
Complete-state formulation - A complete-state formulation represents every search state as a fully specified candidate, rather than a partially constructed candidate.
Completely randomized design - A completely randomized design is an experimental design in which treatments are assigned to experimental units using a random allocation procedure without...
Completeness - Completeness is a guarantee that a method can find every kind of result it is intended to find within a specified formal scope.
Completion - Completion, in the logical database and rule-program sense, makes explicit that the listed facts or defining rules provide all the ways a specified relation...
Complex inverse Wishart distribution - The complex inverse Wishart distribution is a probability distribution over complex-valued Hermitian positive-definite matrices.
Complex sentences - Complex sentences in formal logic are built from simpler logical expressions using connectives such as NOT, AND, OR, and implication, and, in predicate...
Complex steerable pyramid - A complex steerable pyramid is a multiscale image representation that separates image structure into orientation-selective bands with complex-valued...
Complex Wishart distribution - The complex Wishart distribution describes random matrices formed from sums of outer products of suitable complex Gaussian observation vectors.
Complexity analysis - Complexity analysis studies the computational resources required by an algorithm or problem as a function of input size.
Compliant motion - Compliant motion is robot movement that accommodates contact forces and physical constraints rather than rigidly insisting on an exact free-space trajectory.
Component analysis (statistics) - Component analysis, in the treatment-evaluation sense used here, systematically investigates the elements of an intervention package to understand their...
Componential analysis - Componential analysis is an approach to word meaning that describes lexical items through smaller semantic features or components.
Composite index (database) - A composite index is a database index whose search key contains more than one column or expression.
Composite key - A composite key identifies a database record using a combination of two or more attributes.
Compositing equation - The compositing equation describes how foreground color, background color and a mixing value combine into an observed pixel.
Composition - Composition of substitutions combines successive variable replacements into one substitution with the same overall effect.
Compositional pattern-producing network - A compositional pattern-producing network, or CPPN, is a network that combines mathematical functions to generate patterns from coordinates or other...
Compositional semantics - Compositional semantics builds the meaning of a complex expression from the meanings of its parts and the structure that combines them.
Compound Events - Compound events are events formed from combinations of simpler events, often using and, or, and not.
Compound symmetry - Compound symmetry is a covariance structure in which all measurements have the same variance and every distinct pair has the same covariance.
Compound-term processing - Compound-term processing is an information-retrieval approach that recognizes and uses combinations of words as meaningful units instead of relying only on...
Compressed data structure - A compressed data structure stores information in a space-efficient representation while supporting useful operations without first expanding the entire...
Compressed pattern matching - Compressed pattern matching searches for a pattern in data represented in compressed form, using the compression structure or a suitable index to avoid...
Compressed suffix array - A compressed suffix array is a space-efficient representation supporting operations associated with a suffix array, such as searching a text for a pattern...
Compression artifact - A compression artifact is an unwanted change in reconstructed media caused by a compression process, especially lossy coding.