Embeddings Flashcards
1
Q
Short random walks in large graph will decrease training efficiency?
A
False
2
Q
Short random walks in large graph will only encode local structure and ignore global?
A
True
3
Q
Problems coming from short random walks in large graph can be fixed by increasing the nb of walks per node?
A
False
4
Q
What do OR constructions help with in LSH
A
minimizing split
5
Q
What do AND constructions help with in LSH
A
minimizing collision
6
Q
Does OR increase the nb of false negatives?
A
No
7
Q
Does AND increase the nb of false positives?
A
No
