IDE IAT 2 Flashcards

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

1/38

encourage image

There's no tags or description

Looks like no tags are added yet.

39 Terms

1
New cards

Logistic regression models the probability of a categorical outcome using the __________ function.

logistic (sigmoid)

2
New cards

The natural logarithm of the odds is called the __________ of the odds.

logit

3
New cards

The ratio of the probability that an event occurs to the probability that it does not occur is the __________.

odds

4
New cards

Maximum likelihood estimation chooses parameter values that make the observed data most __________.

likely

5
New cards

In binary logistic regression, the response variable has __________ possible categories.

two

6
New cards

The likelihood ratio test compares a fitted model with a __________ model.

null (reduced)

7
New cards

Pseudo R-squared measures provide an approximate indication of model __________; they are not identical to

ordinary least-squares R-squared.

fit (goodness of fit)

8
New cards

The Hosmer–Lemeshow test assesses how well predicted probabilities agree with __________ outcomes.

observed

9
New cards

The Wald test evaluates whether an estimated model __________ differs significantly from a specified value.

coefficient (parameter)

10
New cards

When selecting a model for prediction, both predictive performance and model __________ should be

considered.

interpretability (complexity)

11
New cards

A decision tree predicts a class by following a sequence of __________ from the root to a leaf.

decisions (splits)

12
New cards

In a classification tree, terminal nodes assign a predicted __________.

class

13
New cards

The depth of a tree describes its __________ structure.

hierarchial

14
New cards

Data used to fit a decision tree are called the __________ set.

training

15
New cards

Data held back to evaluate performance are called the __________ set.

test

16
New cards

An induction algorithm selects splits using a criterion such as information gain or __________ impurity.

Gini

17
New cards

Probability estimates in a decision tree can be based on class __________ within a leaf.

proportions

18
New cards

Tree growth may be stopped when a node contains too few observations or when further splits fail a stopping

__________.

criterion (rule)

19
New cards

A confusion matrix compares actual classes with __________ classes.

predicted

20
New cards

A ROC curve plots the true positive rate against the __________ positive rate.

false

21
New cards

A lift curve compares a model’s performance with a __________ selection strategy.

random

22
New cards

McNemar’s test can compare the error patterns of two classifiers on the same __________ cases.

test

23
New cards

In k-fold cross-validation, the data are divided into __________ roughly equal parts.

k

24
New cards

A paired t-test evaluates the mean difference between paired model-performance __________.

scores / metrics / measures

25
New cards

Combining multiple trees is known as a tree __________ method.

ensemble

26
New cards

Kernel methods can represent nonlinear relationships through an implicit mapping into a feature __________.

space

27
New cards

SVM stands for support vector __________.

machine

28
New cards

SVR stands for support vector __________.

regression

29
New cards

The SVM decision boundary is chosen to maximize the __________ between classes.

margin

30
New cards

The separating boundary in an SVM is called a __________ hyperplane.

optimal separating / maximum-margin

31
New cards

In the primal formulation, the model is expressed using the original optimization __________.

variables

32
New cards

The dual formulation expresses the optimization in terms of __________ variables.

Lagrange multiplier

33
New cards

A soft-margin SVM allows some margin violations, controlled by a regularization __________.

parameter

34
New cards

A kernel function computes similarities as if observations had been mapped into a higher-dimensional __________ space.

feature

35
New cards

The linear, polynomial, radial basis, and sigmoid are examples of common __________ functions.

kernel

36
New cards

The radial basis function kernel is often abbreviated __________.

RBF

37
New cards

Unsupervised learning finds patterns in data without using labeled __________ values.

target

38
New cards

Clustering groups observations according to their __________ or dissimilarity.

similarity

39
New cards

Principal component analysis (PCA) transforms data into orthogonal components that capture as much __________ as possible.

variance