DATA SCIENCE WITH MACHINE LEARNING:
RETRIEVAL
WFAiS UJ, Informatyka Stosowana I stopień studiów
1
26/01/2021
This lecture is
based on course by E. Fox and C. Guestrin, Univ of Washington
What is retrieval?
26/01/2021
2
What is retrieval?
26/01/2021
3
What is retrieval?
26/01/2021
4
Retrieval applications
26/01/2021
5
26/01/2021
6
Retrieval as
k-nearest neighbor search
1-NN search for retrieval
26/01/2021
7
1-NN search for retrieval
26/01/2021
8
1-NN search for retrieval
26/01/2021
9
1-NN search for retrieval
26/01/2021
10
1-NN algorithm
26/01/2021
11
1-NN algorithm
26/01/2021
12
k-NN algorithm
26/01/2021
13
k-NN algorithm
26/01/2021
14
Critical elements of NN search
26/01/2021
15
Document representation
26/01/2021
16
Document representation
26/01/2021
17
Document representation
26/01/2021
18
Document representation
26/01/2021
19
Distance metrics:
26/01/2021
20
Distance metrics:
26/01/2021
21
Distance metrics:
26/01/2021
22
Distance metrics:
26/01/2021
23
Distance metrics:
26/01/2021
24
Distance metrics:
26/01/2021
25
Distance metrics:
26/01/2021
26
Distance metrics:
26/01/2021
27
Distance metrics:
26/01/2021
28
Distance metrics:
26/01/2021
29
Distance metrics:
26/01/2021
30
Distance metrics
26/01/2021
31
Distance metrics
26/01/2021
32
Distance metrics
26/01/2021
33
Distance metrics
26/01/2021
34
Distance metrics
26/01/2021
35
Distance metrics
26/01/2021
36
Distance metrics
26/01/2021
37
Combining distance metrics
26/01/2021
38
26/01/2021
39
Scaling up k-NN search
by storing data in a KD-tree
Complexity of brute-force search
26/01/2021
40
KD-trees
26/01/2021
41
KD-trees
26/01/2021
42
KD-trees
26/01/2021
43
KD-trees
26/01/2021
44
KD-trees
26/01/2021
45
KD-trees
26/01/2021
46
KD-trees
26/01/2021
47
KD-trees
26/01/2021
48
Nearest neighbor with KD-trees
26/01/2021
49
Nearest neighbor with KD-trees
26/01/2021
50
Nearest neighbor with KD-trees
26/01/2021
51
Nearest neighbor with KD-trees
26/01/2021
52
Nearest neighbor with KD-trees
26/01/2021
53
Nearest neighbor with KD-trees
26/01/2021
54
Nearest neighbor with KD-trees
26/01/2021
55
Nearest neighbor with KD-trees
26/01/2021
56
Nearest neighbor with KD-trees
26/01/2021
57
Nearest neighbor with KD-trees
26/01/2021
58
Nearest neighbor with KD-trees
26/01/2021
59
Nearest neighbor with KD-trees
26/01/2021
60
Complexity for N queries
26/01/2021
61
Complexity for N queries
26/01/2021
62
k-NN with KD-trees
26/01/2021
63
Approximate k-NN with KD-trees
26/01/2021
64
Closing remarks on KD-trees
26/01/2021
65
KD-tree in high dimmensions
26/01/2021
66
Moving away from exact NN search
26/01/2021
67
26/01/2021
68
Locality Sensitive Hashing (LHS)
as alternative to KD-trees
Locality sensitive hashing
26/01/2021
69
Locality sensitive hashing
26/01/2021
70
Locality sensitive hashing
26/01/2021
71
Locality sensitive hashing
26/01/2021
72
Locality sensitive hashing
26/01/2021
73
Locality sensitive hashing
26/01/2021
74
Locality sensitive hashing
26/01/2021
75
Locality sensitive hashing
26/01/2021
76
Locality sensitive hashing
26/01/2021
77
Locality sensitive hashing
26/01/2021
78
LSH: improving efficiency
26/01/2021
79
LSH: improving efficiency
26/01/2021
80
LSH: improving efficiency
26/01/2021
81
LSH: improving efficiency
26/01/2021
82
LSH: improving efficiency
26/01/2021
83
LSH: improving efficiency
26/01/2021
84
LSH recap
26/01/2021
85
LSH: moving to higher dimmensions d
26/01/2021
86
LSH: moving to higher dimmensions d
26/01/2021
87
26/01/2021
88
Wrapping up
Deploing inteligence module
26/01/2021
89
Case studied are about building, evaluating, deploying inteligence in data analysis.
Use pre-specified or develop your own
Prediction: Predicting house prices
26/01/2021
90
Classification: Sentiment analysis
26/01/2021
91
Clustering& Retrieval: Finding documents
26/01/2021
92
