Cell decomposition - Cell decomposition is a planning technique that divides a space into regions called cells and represents usable connections between them.
Cellular architecture - In parallel-computer architecture, a cellular architecture builds a system from many cooperating computational units, or cells.
Cellular neural network - A cellular neural network is a network of locally connected processing cells whose changing states collectively process information.
Censoring - Censoring occurs when an observation provides only partial information about a value, such as knowing that an event time exceeds a recorded follow-up time.
Census - A census is a statistical collection that seeks information from every unit in a defined population, rather than selecting only a sample of those units.
Center-surround - Center-surround describes a receptive-field or filter arrangement in which a central region and its surrounding neighborhood have opposing influences.
Centered kernel alignment - Centered kernel alignment, or CKA, measures similarity between two sets of representations by comparing their centered similarity structures over the same...
Centering - Centering transforms a variable by subtracting a reference value from each observation, most commonly the variable's mean.
Centering Theory - Centering Theory is a framework for explaining local discourse coherence through the prominence of entities and the referring expressions used for them.
Centerpoint - A centerpoint is an experimental run with quantitative factors set at the middle of their selected low and high settings.
Central composite design - A central composite design (CCD) is an experimental design for fitting a second-order response surface.
Central limit theorem - The central limit theorem explains why suitably standardized sums or averages often have distributions close to a normal distribution.
Central moment - A central moment is a summary of a distribution calculated from deviations around its mean.
Centralized computing - Centralized computing is an arrangement in which a main system or centrally managed computing environment performs a substantial share of processing and...
Centroid - A centroid is the center point of a group of data, found by averaging the group's values on each measure, and used to represent the whole group with one...
Centroid-based clustering - Centroid-based clustering groups data by assigning every point to the nearest center, or centroid, with k-means the best-known method, producing a chosen...
Cepstral coefficients - Cepstral coefficients are numerical values obtained by transforming a logarithmic spectral representation of a signal.
Cepstral mean and variance normalization - Definition: Cepstral mean and variance normalization, usually abbreviated CMVN, standardizes speech-feature coefficients by subtracting an estimated mean...
CERNO test - The CERNO test, short for Coincident Extreme Ranks in Numerical Observations, is a rank-based enrichment test.
Certain answer - A certain answer is a query result that holds in every admissible interpretation or completion of an incomplete database.
Certainty effect - The certainty effect is a pattern in decision making in which a guaranteed outcome receives disproportionate weight compared with outcomes that are merely...
Certainty equivalent - A certainty equivalent is a guaranteed outcome that a decision maker values equally to a specified uncertain prospect.
Certification - Certification is a formal attestation that a specified object meets defined requirements within an identified scope.
Chain graphical model - A chain graphical model represents a probability distribution using a graph that can contain both directed and undirected edges, subject to restrictions...
Chain linking - Chain linking constructs an index or volume series by connecting changes measured between successive periods.
Chain-of-thought prompting - Chain-of-thought prompting is a prompting approach that uses intermediate explanations or worked solution steps to help a language model produce an answer.
Chain of trust - A chain of trust is a sequence of relationships or verification steps through which confidence in one component or claim depends on an accepted starting...
Chain rule - The chain rule of probability expresses a joint probability as a product of successive conditional probabilities.
Chain rule of calculus - The chain rule of calculus gives the derivative of a composite function: a function whose input is the output of another function.
Chaining (vector processing) - Chaining in vector processing lets a dependent vector operation begin using individual results from an earlier operation before the entire earlier vector is...
Chains - Chains, in the graph-algorithm sense used here, are paths or cycles produced by a chain decomposition based on a depth-first search tree.
Chambolle - Pock algorithm - The Chambolle - Pock algorithm is a first-order primal-dual method for structured convex optimization.
Chance nodes - Chance nodes represent uncertain outcomes in a decision tree, game tree, or decision network.
Channel - A channel is a distinct component of a data representation.
Character disjunction - Character disjunction is a regular-expression operation that allows one character position to match any member of a specified set.
Character N-gram F-score - Character N-gram F-score evaluates generated text by combining precision and recall of matching character sequences against reference text.
Characteristic function - In probability theory, the characteristic function of a real-valued random variable X is the function phi_X(t)=E[exp(i×t×X)], where t is real and i is the...
Characteristic samples - A characteristic sample is a set of labeled examples sufficient for a particular learning algorithm to identify a particular target language under a...
Characters - Characters are the written-text elements that a system represents and processes, such as letters, digits, punctuation, and other symbols.
Chart parsing - Chart parsing is a family of parsing methods that store and reuse hypotheses about the structure of portions of an input.
Chatbot - A chatbot is a software application that interacts with people through conversational exchanges, usually text or speech.
Chauvenet's criterion - Chauvenet's criterion is a traditional rule for flagging an unusually distant observation under an assumed normal distribution.
Chebyshev pseudospectral method - The Chebyshev pseudospectral method approximates a continuous function by a polynomial represented through values at Chebyshev nodes, then enforces...
Checkpoint - A checkpoint is a saved representation of a computation's state at a particular point.
Checkpointing - Checkpointing is the process of saving a computation's recoverable state at selected points so that work can resume after interruption.
Chen distribution - The Chen distribution is a continuous probability model for positive lifetimes that can represent either increasing or bathtub-shaped hazard rates.
Chernoff bound - A Chernoff bound is an upper bound on a tail probability obtained by applying Markov's inequality to an exponential transformation of a random variable.
Chernoff's distribution - Chernoff's distribution is the probability distribution of the location at which a two-sided Brownian motion minus a quadratic curve achieves its maximum.