Data Storage Flashcards
What are hash table collisions?
“If the range of key values is larger than the size of our hash table, which is usually always the case, then we must account for the possibility that two different records with two different keys can hash to the same table index. There are a few different ways to resolve this issue. In hash table vernacular, this solution implemented is referred to as collision resolution.”
What is one way that you would handle an imbalanced data set that’s being used for prediction (i.e., vastly more negative classes than positive classes)?
Answer
How would you validate a model you created to generate a predictive model of a quantitative outcome variable using multiple regression?
Answer
I have two models of comparable accuracy and computational performance. Which one should I choose for production and why?
Answer
How do you deal with sparsity?
Answer
