Artificial Intelligence Course Revision & Terminology

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/59

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering history, evaluation metrics, reinforcement learning, NLP, and computer vision from the Artificial Intelligence course.

60 Terms

1
New cards

Syllogism

A formal deductive reasoning structure introduced by Aristotle that derives valid logical conclusions from two or more propositions.

2
New cards

Turing Test

A test formulated by Alan Turing in 1950 to evaluate machine intelligence by testing whether a human evaluator can distinguish between text responses from a computer and a human.

3
New cards

Artificial Intelligence (John McCarthy)

The science and engineering of making intelligent machines, especially intelligent computer programs, a term coined by John McCarthy around the 1956 Dartmouth conference.

4
New cards

AI Winter

A period characterized by a major decline in research interest, public perception, and funding for artificial intelligence, primarily caused by unrealistic expectations and technical limitations.

5
New cards

Expert System

A knowledge-based system designed to emulate the decision-making and problem-solving process of a human domain expert using formalized rules and facts.

6
New cards

Knowledge Base

A primary component of an expert system that systematically stores formalized expert knowledge, rules, and facts from a specialized application domain.

7
New cards

Inference Engine

The core component of an expert system that processes the knowledge base using logical deduction rules to infer new facts, solutions, and recommendations.

8
New cards

Perceptron

An artificial neuron model invented by Frank Rosenblatt in 1957 that computes a weighted sum of inputs and applies an activation function to generate an output.

<p>An artificial neuron model invented by Frank Rosenblatt in 1957 that computes a weighted sum of inputs and applies an activation function to generate an output.</p>
9
New cards

Backpropagation Algorithm

A mathematical method popularized by Rumelhart et al. in 1986 that allows artificial neural networks to learn by calculating error gradients and updating connection weights backward through layers.

10
New cards

Gartner Hype Cycle

A graphical representation of the life cycle and market maturity of emerging technologies, moving through Innovation Trigger, Peak of Inflated Expectations, Trough of Disillusionment, Slope of Enlightenment, and Plateau of Productivity.

<p>A graphical representation of the life cycle and market maturity of emerging technologies, moving through Innovation Trigger, Peak of Inflated Expectations, Trough of Disillusionment, Slope of Enlightenment, and Plateau of Productivity.</p>
11
New cards

Artificial Narrow Intelligence (ANI)

Also called Weak AI, systems designed to perform specialized problem-solving tasks within a single domain—often faster than humans—without the ability to transfer knowledge to other domains.

12
New cards

Artificial General Intelligence (AGI)

Also called Strong AI, a theoretical system possessing human-level cognitive capabilities across multiple domains, including abstract reasoning and true generalization capabilities.

13
New cards

Artificial Superintelligence

A hypothetical AI system that matches and dramatically exceeds human intellectual and cognitive abilities across all fields, often achieved via recursive self-improvement.

14
New cards

Robotic Process Automation (RPA)

The automated execution of repetitive, manual, rule-based, or time-consuming business workflow tasks by software bots.

15
New cards

Internet of Things (IoT)

A network infrastructure connecting physical and virtual devices to exchange data using information and communication technologies.

16
New cards

Development Set

Also known as a validation set, a dataset separate from the training set used to evaluate an AI model during development and optimize its hyperparameters.

17
New cards

Confusion Matrix

A performance table for classification models on test data with known true values, categorizing outcomes into True Positives, False Positives, True Negatives, and False Negatives.

<p>A performance table for classification models on test data with known true values, categorizing outcomes into True Positives, False Positives, True Negatives, and False Negatives.</p>
18
New cards

Precision

The proportion of positive predictions that are truly correct, calculated as TPTP+FP\frac{TP}{TP + FP} .

19
New cards

Recall

The proportion of actual positive samples that were identified correctly, calculated as Recall=TPTP+FN\text{Recall} = \frac{TP}{TP + FN}.

20
New cards

Accuracy (Classification)

The proportion of all correct predictions relative to the total number of evaluated samples, calculated as Accuracy=TP+TNTP+TN+FP+FN\text{Accuracy} = \frac{TP + TN}{TP + TN + FP + FN}.

21
New cards

F-Score

The harmonic mean of precision and recall, calculated as F=2⋅precision⋅recallprecision+recallF = 2 \cdot \frac{\text{precision} \cdot \text{recall}}{\text{precision} + \text{recall}}.

22
New cards

Reinforcement Learning

A machine learning paradigm where an autonomous agent learns to maximize cumulative reward through iterative trial-and-error interaction with an environment.

<p>A machine learning paradigm where an autonomous agent learns to maximize cumulative reward through iterative trial-and-error interaction with an environment.</p>
23
New cards

Markov Property

The condition of a system where future state transitions depend solely on the present state and action, independent of preceding historical states.

24
New cards

Markov Decision Process (MDP)

A mathematical framework for modeling sequential decision-making composed of states SS, actions AA, transition probabilities Pa(s,s′)P_a(s, s'), rewards R(s,a,s′)R(s, a, s'), and a policy π\pi.

25
New cards

Policy (π\pi)

A decision-making strategy in reinforcement learning, formalized as π(s,a)=p(at=a∣st=s)\pi(s, a) = p(a_t = a \mid s_t = s), specifying the action to take in a given state.

26
New cards

Value Function (RL)

A function that estimates the expected long-term cumulative discounted return of being in a given state under a specified policy.

27
New cards

Discount Rate (γ\gamma)

A factor 0≤γ≤10 \le \gamma \le 1 in reinforcement learning that weights the present value of future rewards, ensuring convergence over infinite horizons.

28
New cards

Temporal Difference (TD) Learning

A model-free reinforcement learning approach that updates value estimates based on the differences between consecutive predictions rather than waiting for terminal outcomes.

29
New cards

Q-Learning

A model-free temporal difference algorithm that iteratively optimizes the quality function Q(s,a)=r+γmax⁡a′Q(s′,a′)Q(s, a) = r + \gamma \max_{a'} Q(s', a') using the Bellman equation.

30
New cards

Exploration vs. Exploitation

The trade-off between trying random actions to discover new information about an environment (exploration) and leveraging known actions to maximize rewards (exploitation).

31
New cards

Tokenization

The natural language processing step that splits raw text into discrete smaller units, such as words, punctuation, or sub-words.

32
New cards

Lemmatization

An NLP preprocessing technique that uses grammatical vocabulary and morphological analysis to return words to their canonical dictionary base form (lemma).

33
New cards

Stemming

A rule-based text preprocessing technique that chops off suffixes and word endings to produce a base stem, sometimes yielding non-dictionary words.

34
New cards

Part-of-Speech (POS) Tagging

The process of marking words in a text with corresponding grammatical classes and syntactic categories such as nouns, verbs, adjectives, and pronouns.

35
New cards

Named Entity Recognition (NER)

The subfield of NLP focused on identifying and classifying specific entities in unstructured text into predefined categories such as person names, company names, locations, and dates.

36
New cards

Sentiment Analysis

The automated extraction and classification of subjective aspects from text, such as determining an author's emotional state, opinion, or sentiment polarities.

37
New cards

Pivot Machine Translation

A machine translation technique used for under-resourced language pairs where text is first translated into an intermediate bridge language before reaching the target language.

38
New cards

Bag-of-Words (BoW)

A text vectorization technique representing documents by word frequencies, ignoring word order, grammar, and semantic context.

39
New cards

Continuous Bag-of-Words (CBOW)

A Word2Vec neural architecture that predicts a missing target word using the surrounding context words within a sliding window.

<p>A Word2Vec neural architecture that predicts a missing target word using the surrounding context words within a sliding window.</p>
40
New cards

Skip-Gram

A Word2Vec model variant that uses a single input word to predict the surrounding context words within a defined window.

41
New cards

TF-IDF

A statistical weighting measure in information retrieval that reflects the importance of a term tt in a document dd relative to a corpus DD, calculated as TFIDF(t,d)=TF(t,d)×IDF(t)\text{TFIDF}(t, d) = \text{TF}(t, d) \times \text{IDF}(t).

42
New cards

GloVe (Global Vectors)

An unsupervised word vectorization algorithm combining global matrix factorization with local context window statistics using a word co-occurrence matrix.

43
New cards

Self-Attention Mechanism

A core transformer mechanism that calculates the relative significance and contextual relationships between all token positions in a sequence simultaneously.

44
New cards

BERT

Bidirectional Encoder Representations from Transformers; a pre-trained model developed by Google that learns contextual representations bidirectionally using Masked Language Modeling and Next Sentence Prediction.

45
New cards

Pixel

The smallest discrete element of a digital image array representing an individual intensity or color value.

46
New cards

2D Image Convolution

An image filtering method where a sliding matrix kernel is multiplied element-wise across local pixel neighborhoods to generate a modified output image.

47
New cards

Padding (Computer Vision)

Techniques such as constant, replication, or reflection padding used to add artificial pixel borders to input images to allow full kernel convolution operations.

48
New cards

Radial Distortion

An optical aberration causing straight lines in real-world scenes to curve near lens boundaries, encompassing barrel, pincushion, mustache, and fisheye types.

<p>An optical aberration causing straight lines in real-world scenes to curve near lens boundaries, encompassing barrel, pincushion, mustache, and fisheye types.</p>
49
New cards

Tangential Distortion

An optical distortion occurring when a camera lens is not mounted perfectly parallel to the image sensor plane.

50
New cards

Intrinsic Camera Parameters

Internal optical parameters of a camera—such as focal length, optical center, and lens distortion coefficients—used to map 3D camera coordinates to 2D image coordinates.

51
New cards

Extrinsic Camera Parameters

Parameters describing the camera's external position and orientation (rotation and translation) in 3D real-world space.

52
New cards

Harris Corner Detection

A feature detection technique that shifts a small sliding window in all directions to find corners, identified where pixel intensity changes significantly in both horizontal and vertical directions.

<p>A feature detection technique that shifts a small sliding window in all directions to find corners, identified where pixel intensity changes significantly in both horizontal and vertical directions.</p>
53
New cards

BRIEF (Binary Robust Independent Elementary Features)

A computationally efficient local feature descriptor that encodes patch information into a binary string based on simple pixel intensity pairwise comparisons.

54
New cards

Semantic Segmentation

A computer vision task that assigns a class label to every individual pixel in an image to partition regions into semantic categories.

<p>A computer vision task that assigns a class label to every individual pixel in an image to partition regions into semantic categories.</p>
55
New cards

Variational Autoencoder (VAE)

A generative model composed of an encoder and decoder that maps inputs into a continuous, probabilistic latent space by optimizing the evidence lower bound (ELBO).

56
New cards

Generative Adversarial Network (GAN)

A generative framework introduced by Ian Goodfellow in 2014 where a generator neural network synthesizes data while a discriminator network evaluates whether data are real or synthetic.

<p>A generative framework introduced by Ian Goodfellow in 2014 where a generator neural network synthesizes data while a discriminator network evaluates whether data are real or synthetic.</p>
57
New cards

Mode Collapse

A common challenge in training GANs where the generator produces only a very narrow variety of outputs, failing to capture the full distribution of the training data.

58
New cards

Diffusion Model

A class of generative models that synthesizes high-quality images through an iterative reverse denoising process, progressively refining pure noise into coherent images.

59
New cards

U-Net

A symmetric convolutional encoder-decoder architecture with skip connections between corresponding layers, primarily responsible for iterative noise removal in diffusion models.

60
New cards

CLIP (Contrastive Language-Image Pre-training)

A multimodal model developed by OpenAI that jointly trains image and text encoders on image-caption pairs to align visual and textual representations.