Similarity Flashcards

(11 cards)

1
Q

r-NNS problem

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

What are the performance indicators for similarity

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

RR problem

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

What is a kd-tree

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

Pseudo code of the kd-tree search/query algorithm

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

General performance of the kd-tree in R^D

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

Describe briefly how the r-NNS can be solved using the RR method

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

Define the (c,r)-ANNS

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

Define LSH

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

Describe how LSH is used to solve (c,r)-ANNS + performances

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

bit sampling (describe the famility of hash function, the prob of collision and derive the p1 and p2)

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