AI terms starting with C

669 terms

# A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

  • 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.
  • Cherry-Picking - Cherry-picking is the selective use or presentation of evidence that favors a desired conclusion while leaving out relevant evidence that would weaken...
  • Chi-square automatic interaction detection - Chi-square automatic interaction detection, usually called CHAID, is a method for building decision trees.
  • Chi-square test - A chi-square test is a statistical hypothesis test that compares a calculated statistic with a chi-squared reference distribution.
  • Chi-squared distribution - The chi-squared distribution is a family of continuous probability distributions used to describe certain sums of squared standardized quantities.
  • Child node - A child node is a node directly below another node, its parent, in a rooted tree.
  • Chinese wall - A Chinese wall is an information barrier intended to prevent inappropriate sharing between activities or parties with conflicting interests.
  • Choice set - A choice set is the collection of alternatives available to a decision-maker for a particular decision.
  • Chomsky-adjunction - Chomsky-adjunction, in the context-free grammar sense used here, is a recursive way of extending a constituent while retaining its category.
  • Chomsky normal form - Chomsky normal form is a restricted form of a context-free grammar in which rules expand one nonterminal into either two nonterminals or one terminal.
  • Chordal - Chordal describes an undirected graph in which every cycle of four or more vertices has a chord: an edge connecting two vertices that are not consecutive on...
  • Choreography - Choreography is a description or coordination pattern for how multiple participants interact through messages and agreed behavior.
  • Chow - Liu tree - A Chow - Liu tree is a tree-structured probability model that approximates a joint distribution using relationships between pairs of variables.
  • Chroma keying - Chroma keying is a compositing technique that separates a subject from a background using color information, commonly from a green or blue screen.
  • Chroma subsampling - Chroma subsampling reduces the spatial resolution of an image's color-difference components while retaining a more detailed luma component.
  • Chronological backtracking - Chronological backtracking is a search method that responds to a dead end by undoing the most recent decision that still has an untried alternative.
  • Chunked transfer encoding - Chunked transfer encoding is an HTTP/1.1 message-framing mechanism that sends a message body as a sequence of length-prefixed chunks.
  • CICD or CI/CD - CI/CD means continuous integration combined with continuous delivery or continuous deployment.
  • Circuit (neural network) - In neural-network interpretability, a circuit is a collection of internal components and connections that work together to produce a particular behavior.
  • Circuit verification - Circuit verification checks whether a circuit design satisfies a stated specification.
  • Circular analysis - Circular analysis occurs when information used to select a pattern also enters the analysis presented as independent evidence for that pattern, without a...
  • Circular convolution - Circular convolution combines two finite sequences while treating their indices as periodic, so values that pass one end wrap around to the other.
  • Circumscription - Circumscription is a formal approach to nonmonotonic reasoning that prefers models in which selected properties hold for as few entities as possible...
  • Citation precision - Citation precision measures how well the citations an AI system supplies support the statements to which they are attached, under a specified evaluation rule.
  • Citation recall - Citation recall measures how much of an answer's evaluated content is supported by the citations provided, under a defined claim or statement-level protocol.
  • Clarification - Clarification is a conversational act that seeks to resolve uncertainty about what another participant said or meant.
  • Class - In classification, a class is one of the categories a model can assign to an item, such as spam, billing or delivery for incoming emails.
  • Class activation mapping - Class activation mapping, or CAM, is a technique that highlights image regions contributing to a particular class score in certain convolutional neural...
  • Class-based n-gram - A class-based n-gram is a language model that predicts words using groups of words called classes.
  • Class incremental learning - Class incremental learning is a continual-learning setting in which a model learns additional classes over time while remaining able to distinguish the...
  • Class interval - A class interval is a defined range of numerical values used to group observations in a frequency table or histogram.
  • Classical decomposition method - The classical decomposition method separates a time series into estimated trend-cycle, seasonal and remainder components using moving averages and seasonal...

Previous page Page 3 of 14 Next page

  • Home
  • Daily AI Updates
  • Blog
  • AIFBL Academy
  • AI Glossary
  • Products and Tools
  • Store
  • Free CFO AI Prompt Pack
  • About Shihan Sheriff
  • Privacy Policy
  • Terms of Use
  • Refund Policy
  • Cookie Policy
  • Earnings Disclaimer