Shadowing Practice: The Math Behind Recommender Systems - Learn English Speaking with Video

בחר מצב תרגול

כל מצב פותח חדר תרגול במסך מלא.

89 משפטים
אם המשפטים קצרים או ארוכים מדי, לחץ על ערוך כדי להתאים אותם.
1
In 2006, Netflix famously offered a prize to solve a simple problem which had been around for years.
2
All online commerce giants are fighting to get better at solving this same problem.
3
Given observations of a user's past behavior, predict which other things that same user will like.
4
For example, based on Alice's viewing history, will she like
5
The Matrix or Grapes of Wrath?
6
We can represent user preferences graphically as connections between people on one side and things on the other, such as movies.
7
Here, the strength of connection is visually represented by the thickness of the lines.
8
So the problem is to fill out all of these missing connections we don't yet know, shown in red.
9
But because of the messy, unpredictable nature of people's taste, we can never perfectly predict what they will like
10
because for one it involves a guess about the future based on something you've never seen
11
and two the answer is always in flux
12
because people's tastes change over time what we can do is try to estimate those values as best
13
we can using whatever data we have access to
14
so regardless of the context we can describe the problem in the following mathematical form we use a matrix
15
which is a collection of numbers organized into rows and columns, where the rows are users and the columns are items, in this case movies.
16
And each cell in this matrix contains a number that describes how much each individual likes each movie.
17
For example, we could use a scale from 0 to 4, where 0 would represent I hate it,
18
2 is neutral, and 4 is I love it.
19
At any given moment, there will be some set of preference data for users and movies.
20
But it will be incomplete because users have only seen and rated a few movies each.
21
And so the problem boils down to trying to predict these missing values.
22
How should we make these predictions?
23
There are two general approaches to this problem.
24
The first is called content filtering, which is to use information we know about people and things as connective tissue for recommendations.
25
It's like asking Alice questions about what kinds of movies she likes to figure out if she will like The Matrix.
26
It begins by labeling each person and movies with some known attributes, or what we call features, for example, action and comedy.
27
That means if Alice likes comedy and hates action, we can represent her as 3 -0.
28
Each movie is also mapped to each feature in the same way.
29
For example, the matrix has no comedy and lots of action, so we could represent it as 0, 4.
30
And to determine whether someone will like a movie, we need to multiply these factors together.
31
So we could represent the strength of connection between Alice
32
and the matrix as 3 times 0 plus 0 times 4 equals 0.
33
So our estimation is that she will hate the movie.
34
So to make our predictions, we first need to gather this feature data for every user and movie.
35
To simplify, let's return to a matrix representation.
36
We can store this information in two matrices.
37
One defines the mapping between people and features.
38
The other defines the mapping between movies and features.
39
And by multiplying these two matrices together, using matrix multiplication, we get an estimated strength of connection between every person and movie.
40
And if we'd like, we can normalize our data to make sure the scale stays between 0
41
and 4 by dividing all values by 8 and rounding to the nearest 0 .5.
42
That's one way to solve this problem, known as content filtering.
43
The problem is, it's overly simplistic and not very accurate it.
44
That's because there are obviously more relevant features of a movie than just comedy or action.
45
The obvious way to improve this is just to include more features.
46
If you recall when Netflix started, it did just this.
47
It would ask new users to fill out a laundry list of questions about their preferences before presenting them with suggested movies.
48
And this leads to the problem of having to collect all of this preference data on users.
49
Not only is it a burden for users, it's also prone to failure, as we aren't always great at describing our own preferences.
50
Sometimes we simply can't explain why we like things.
51
We just do.
52
Which brings us to the other approach, called collaborative filtering.
53
The motivation for collaborative filtering comes from the idea that you will probably like things people with similar viewing habits also like.
54
This idea was popularized in this 2009 paper by Cohen, Bell, and Walensky.
55
So to begin, we can throw away the idea of dreaming up features used to connect peoples in movies.
56
Instead, we flip things around and use the user preference data we do have to generate the features.
57
For example, we might have this incomplete set of preference data,
58
and we will instead learn or discover the relevant features based on patterns in this data.
59
And this is done by simply reversing the problem.
60
We first perform an approximate factorization into two matrices, and we can do this using a machine learning approach.
61
The job of the machine learning algorithm is to guess values for those matrices,
62
which will match the existing data in the preference matrix as closely as possible.
63
The simplest approach is to simply guess numbers over
64
and over until you arrive at a set of numbers which predict the data with the lowest error overall.
65
Once this estimation is finished, we can multiply the matrices as before to fill in all of the missing values.
66
And it's important to note that we won't know exactly what to label these discovered features, so we call them latent features,
67
because they arise out of the underlying patterns in the data.
68
You can think of them as an average or weighted sum of the patterns in the data.
69
They are not based on a human -defined feature, such as comedy.
70
And that's the key insight behind this method.
71
With content filtering, the features come from the human mind,
72
whereas with collaborative filtering, the features are extracted directly from the patterns in the data.
73
And this will predict the data in the same way but more accurately.
74
It's also important to notice that this kind of prediction is actually a form of compression
75
because we can represent a huge matrix of preference data by two smaller matrices of feature data.
76
And once our feature data is determined or learned, we can throw away the original data we started with,
77
because we can simply multiply the features together to recreate that data.
78
And the reason this is possible is because the preference data we started with is not random, but follow patterns which exist across people.
79
If instead the preference data was filled with random numbers,
80
we would not be able to compress it accurately because there would be no patterns to extract.
81
This collaborative filtering approach has also been applied to a wide range of contexts,
82
such as evaluating policy outcomes before they are implemented in the real world, known as synthetic control.
83
For example, if we wanted to understand the effect of gun control or minimum wage increases in some city,
84
we could look at the effect in similar cities first
85
which have implemented those policies to approximate the outcome using the same mechanism.
86
So it is the patterns we share that allow this method to work.
87
Recommendation systems based on these ideas are in widespread use today, whether it's movies, music, news articles, or anything else you search for online.
88
The things
89
that are recommended to you are based on patterns the machine has observed in other people who are similar to yourself.

הורד אפליקציה

כל מה שאתה צריך כדי לדבר בשטף

הגיית AIציון לכל משפט
תרגול IPAשלוט בכל צליל
אוצר מיליםבנה את מאגר המילים שלך
משחק אוצר מיליםלמד תוך כדי משחק
FOR YOU

המלץ על סרטון

אוצר מילים והערות הגייה לשיעור הזה

שיעור הדיבור הזה מבוסס על הסרטון “The Math Behind Recommender Systems”. המילים שחוזרות הכי הרבה: feature, movie, preference, matrix, user. בסרטון הזה יש 89 משפטים ו-1284 מילים לתרגול Shadowing. הדיבור נמשך 8:04. הדובר מדבר בקצב טבעי של כ-159 מילים בדקה, קרוב לשיחה יומיומית. 84% מהמילים נמצאות בין 3,000 המילים הנפוצות ביותר באנגלית; כדאי ללמוד את השאר לפני שמתחילים.

אוצר מילים מרכזי בסרטון הזה

15 מילים מהסרטון שכדאי ללמוד, עם ההגייה והמשמעות שלהן:

מילההגייהמשמעות
preference שם עצם/ˈpɹɛf(ə)ɹ(ə)ns/הַעֲדָפָה
filter שם עצם/ˈfɪltɚ/מַסנֵן
solve פועל/sɒlv/פָּתַר
define פועל/dɪˈfaɪn/הגדיר
prediction שם עצם/pɹɪˈdɪkʃən/תַּחֲזִית
label שם עצם/ˈleɪ.bəl/תָּגִית
discover פועל/dɪˈskʌvə/גִּלָּה
implement פועל/ˈɪmpləmənt/יישם, מימש
recommendation שם עצם/ˌɹɛkəmɛnˈdeɪʃən/הַמְלָצָה
extract שם עצם/ˈɛkstɹækt/תַּמְצִית
wage שם עצם/weɪd͡ʒ/מַשְׂכֹּרֶת, שָׂכָר
whereas/(h)wɛɹˈæz/הוֹאִיל
arrive פועל/əˈɹaɪv/הִגִּיעַ
connect פועל/kəˈnɛkt/חיבר
collect פועל/ˈkɑlɪkt/אסף

Phrasal verbs שתשמעו

מילההגייהמשמעות
fill out פועל/fɪl ˈaʊt/הִשְׁלִים
throw away פועלהִשְׁלִיךְ
figure out פועלהֵבִין, מצא תשובה

משפטים שכדאי לחזור עליהם

משפטים קצרים ושלמים מהסרטון שאפשר להשתמש בהם בשיחה יומיומית:

  • How should we make these predictions?
  • To simplify, let's return to a matrix representation.
  • Sometimes we simply can't explain why we like things.

דקדוק בסרטון הזה

המבנים שהדובר משתמש בהם הכי הרבה, עם המילים המדויקות מהסרטון:

מבנהבסרטון
סביל (Passive voice) be + past participle — הדגש הוא על מה שקורה, לא על מי שעושה את הפעולהis visually represented · is called · is also mapped
הווה מושלם (Present perfect) have/has + past participle — פעולה שקרתה בעבר ועדיין יש לה חשיבות או השפעה עכשיוyou've never seen · have only seen · has also been applied
משפטי זיקה (Relative clauses) who / which + clause — מידע נוסף על אדם או דברfiltering, which is · people who are

הגייה ששווה לשים לב אליה

הדובר משתמש ב-6 קיצורים וצורות מקוצרות, כמו aren't, can't, don't. אמרו אותם בצורה הקצרה, כפי שאתם שומעים אותם.

  • הצלילים של “th”: gather /ˈɡæðɚ/, mathematical /ˌmæθ(.ə)ˈmæt.ɪ.kəl/, algorithm /ˈælɡəɹɪðm̩/, synthetic /sɪnˈθɛtɪk/, thickness /ˈθɪknəs/
  • הצלילים של “sh” ו-“zh”: prediction /pɹɪˈdɪkʃən/, recommendation /ˌɹɛkəmɛnˈdeɪʃən/, representation /ˌɹɛp.ɹə.zɛnˈteɪ.ʃən/, tissue /ˈtɪʃ.(j)u/, motivation /ˈmoʊ.tə.veɪ.ʃən/
  • מילים ארוכות — שימו לב להטעמה: collaborative /kəˈlæb.ə.ɹə.tɪv/, recommendation /ˌɹɛkəmɛnˈdeɪʃən/, accurately /ˈæk.jə.ɹɪt.li/, approximate /əˈpɹɑk.sə.mət/, representation /ˌɹɛp.ɹə.zɛnˈteɪ.ʃən/

צלילים שדוברי עברית מתקשים בהם:

  • /w/ — שפתיים מעוגלות, לא /v/: wage /weɪd͡ʒ/, whereas /(h)wɛɹˈæz/, widespread /ˌwaɪdˈspɹɛd/
  • /æ/ — פתוח יותר מה-“אֶ” העברית, לא כמו “a” ב-“cup”: collaborative /kəˈlæb.ə.ɹə.tɪv/, extract /ˈɛkstɹækt/, accurately /ˈæk.jə.ɹɪt.li/, whereas /(h)wɛɹˈæz/, gather /ˈɡæðɚ/
  • /r/ — הלשון לא נוגעת בשום מקום, לא ה-“ר” הגרונית: matrix /ˈmeɪ.tɹɪks/, preference /ˈpɹɛf(ə)ɹ(ə)ns/, predict /pɹɪˈdɪkt/, collaborative /kəˈlæb.ə.ɹə.tɪv/, prediction /pɹɪˈdɪkʃən/

איך לתרגל עם הסרטון הזה

  1. הקשיבו לכל הסרטון פעם אחת בלי לדבר, ורשמו את המילים שאתם לא מכירים.
  2. התחילו במהירות 0.75×, תרגלו Shadowing משפט אחר משפט, וחזרו למהירות רגילה כשזה מרגיש קל.
  3. הקליטו את עצמכם והשוו למקור, תוך תשומת לב למילים כמו preference, filter, solve.

מהי טכניקת השאדואינג?

שאדואינג היא טכניקת למידת שפה מבוססת מדע שפותחה במקור להכשרת מתורגמנים מקצועיים ופופולרית על ידי הפוליגלוט ד"ר אלכסנדר ארגואלס. השיטה פשוטה אך עוצמתית: אתה מקשיב לאודיו באנגלית ילידית וחוזר עליו בקול רם מיד — כמו צל העוקב אחרי הדובר עם עיכוב של 1–2 שניות בלבד. בניגוד להאזנה פסיבית או תרגילי דקדוק, שאדואינג מכריח את המוח והשרירים בפה לעבד ולשחזר דפוסי דיבור אמיתיים בו זמנית. מחקרים מראים שזה משפר משמעותית את דיוק ההגייה, האינטונציה, הקצב, הדיבור המחובר, הבנת השמיעה ושטף הדיבור — מה שהופך אותו לאחת השיטות היעילות ביותר להכנה לIELTS Speaking ולתקשורת באנגלית בעולם האמיתי.

טכניקת Shadowing: קרא את המדריך המלא שלב אחר שלב →