跟读练习: The Math Behind Recommender Systems - 通过视频学习英语口语
选择练习模式
每种模式都会打开全屏练习室。
89 句
如果句子过短或过长,请点击 Edit 进行调整。
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.
FOR YOU
推荐视频
本课的词汇与口语要点
这节口语课以视频“The Math Behind Recommender Systems”为素材。 视频中反复出现的词有:feature, movie, preference, matrix, user。 这段视频共有 89 个句子、1284 个单词可供跟读。 讲话部分时长为 8:04。 说话人语速自然,每分钟约 159 个词,接近日常对话。 84% 的单词属于英语最常用的 3,000 词,其余的词建议在练习前先学一下。
视频中的重点词汇
视频中 15 个值得学习的单词,附发音和释义:
| 单词 | 发音 | 释义 |
|---|---|---|
| preference 名词 | /ˈpɹɛf(ə)ɹ(ə)ns/ | 優選 /优选, 選擇 /选择 |
| filter 名词 | /ˈfɪltɚ/ | 過濾器 /过滤器, 濾過器 /滤过器 |
| predict 动词 | /pɹɪˈdɪkt/ | 預言 /预言 |
| collaborative 形容词 | /kəˈlæb.ə.ɹə.tɪv/ | 協作的 /协作的 |
| solve 动词 | /sɒlv/ | 解決 /解决 |
| define 动词 | /dɪˈfaɪn/ | 界定 |
| prediction 名词 | /pɹɪˈdɪkʃən/ | 預言 /预言, 預估 /预估 |
| label 名词 | /ˈleɪ.bəl/ | 標籤 /标签, 簽條 /签条 |
| discover 动词 | /dɪˈskʌvə/ | 發現 /发现, 發覺 /发觉 |
| estimate 名词 | /ˈɛs.tɪ.mət/ | 估計 /估计 |
| implement 动词 | /ˈɪmpləmənt/ | 實施 /实施, 執行 /执行 |
| recommendation 名词 | /ˌɹɛkəmɛnˈdeɪʃən/ | 建議 /建议, 勸告 /劝告 |
| extract 名词 | /ˈɛkstɹækt/ | 精 |
| incomplete 形容词 | /ɪn.kəmˈpliːt/ | 不完整的, 不完全的 |
| wage 名词 | /weɪd͡ʒ/ | 工資 /工资, 薪金 |
视频中出现的短语动词
| 单词 | 发音 | 释义 |
|---|---|---|
| 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.
视频中的语法
说话人最常用的结构,并附上视频中的原话:
| 结构 | 视频中的用法 |
|---|---|
| 被动语态 be + 过去分词 — 强调发生了什么,而不是谁做的 | is visually represented · is called · is also mapped |
| 现在完成时 have/has + 过去分词 — 过去发生但与现在仍有关联的事 | you've never seen · have only seen · has also been applied |
| 定语从句 who / which + 从句 — 补充说明人或事物 | 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/
中文母语者容易读错的音:
- /v/ — 不要读成 /w/,上齿轻触下唇: collaborative /kəˈlæb.ə.ɹə.tɪv/, solve /sɒlv/, discover /dɪˈskʌvə/, arrive /əˈɹaɪv/, reverse /ɹɪˈvɝs/
- 词尾辅音 — 要读清楚,后面不要加元音: matrix /ˈmeɪ.tɹɪks/, preference /ˈpɹɛf(ə)ɹ(ə)ns/, predict /pɹɪˈdɪkt/, collaborative /kəˈlæb.ə.ɹə.tɪv/, solve /sɒlv/
- /r/ 和 /l/ 的区别: collaborative /kəˈlæb.ə.ɹə.tɪv/, accurately /ˈæk.jə.ɹɪt.li/, regardless /ɹɪˈɡɑɹd.lɪs/, recall /ɹɪˈkɔl/, neutral /ˈnuː.tɹəl/
如何用这段视频练习
- 先完整听一遍视频,不要开口,记下不认识的单词。
- 先用 0.75 倍速逐句跟读,熟练之后再回到正常速度。
- 录下自己的声音并与原声对比,特别注意 preference, filter, predict 这类单词。
什么是跟读法?
跟读法 (Shadowing) 是一种有科学依据的语言学习技巧,最初开发用于专业口译员的培训,并由多语言者Alexander Arguelles博士普及。这个方法简单而强大:您在听英语母语原声的同时立即大声重复——就像是一个延迟1-2秒紧跟说话者的影子。与被动听力或语法练习不同,跟读法强迫您的大脑和口腔肌肉同时处理并模仿真实的讲话模式。研究表明它能显着提高发音准确性,语调,节奏,连读,听力理解和口语流利度——使其成为雅思口语备考和真实英语交流最有效的方法之一。












