Lecture 7 Imputation Flashcards

1
Q

Model- driven imputation

A

Train regression model for jssung values
Retrain it after filling in
Flexible

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Knn imputation

A

Efficient implementation would find nearest neighbors only once
Naive — requires the first 2 always be presen t
Tricky if there is no feature that is always non- misusing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Fan yum pure

A

No fit transform paradigm
Mice is iterative and works well
Nice might be best

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Feature selection

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Unsupervised

A

May discard important information
Variance- based: 0 variance or few unique value

Covariance based: remove correlated features
PCA: remove linear Subspaces

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Univariate selection

A

Examine each feature individually to determine the strength of the relationship of feature with two response variable —> provide a score for each feature

F score, chi2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Mutual information

A

Univariate— doesn’t assume a linear model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Multivariate — model based

A

Get best fit for a model
Exhaustive search — infeasible
Linear model assume linear relation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Interactive model based

A

Fit model find least important feature,remove, iterate —- recursive feature elimination

Or start with with single feature, find most important, add

How well did you know this?
1
Not at all
2
3
4
5
Perfectly