쉐도잉 연습: 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.

앱 다운로드

유창하게 말하는 데 필요한 모든 것

AI 발음 평가문장마다 점수 확인
IPA 발음 연습모든 소리 마스터
단어 학습나만의 단어장 만들기
단어 게임놀면서 외우기
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/예언하다, 예측하다
solve 동사/sɒlv/해결하다
prediction 명사/pɹɪˈdɪkʃən/예언, 예측
label 명사/ˈleɪ.bəl/라벨, 레이블
discover 동사/dɪˈskʌvə/발견하다
recommendation 명사/ˌɹɛkəmɛnˈdeɪʃən/권고, 추천
wage 명사/weɪd͡ʒ/임금, 급료
arrive 동사/əˈɹaɪv/도착하다
connect 동사/kəˈnɛkt/잇다, 연결하다
collect 동사/ˈkɑlɪkt/수집하다
commerce 명사/ˈkɑ.mɚs/무역, 교역
tissue 명사/ˈtɪʃ.(j)u/조직
mechanism 명사/ˈmɛk.ə.nɪ.zəm/기구, 메커니즘

영상에 나오는 구동사

단어발음뜻
fill out 동사/fɪl ˈaʊt/기입하다
throw away 동사버리다

따라 말해 볼 만한 문장

영상에 나오는 짧고 완결된 문장으로, 일상 대화에서 그대로 쓸 수 있습니다:

  • 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

주의할 발음

화자는 aren't, can't, don't 같은 축약형과 약화된 형태를 6번 사용합니다. 들리는 대로 짧게 발음하세요.

  • “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/

한국어 화자가 어려워하는 소리:

  • /f/ — ㅍ(/p/)으로 바꾸지 말고 윗니를 아랫입술에 대기: preference /ˈpɹɛf(ə)ɹ(ə)ns/, filter /ˈfɪltɚ/, define /dɪˈfaɪn/, flip /flɪp/, flux /flʌks/
  • /v/ — ㅂ(/b/)과 구별하기: collaborative /kəˈlæb.ə.ɹə.tɪv/, solve /sɒlv/, discover /dɪˈskʌvə/, arrive /əˈɹaɪv/, reverse /ɹɪˈvɝs/
  • /z/ — ㅈ이 아니라 성대를 울리는 /s/: columns /ˈkɑləmz/, whereas /(h)wɛɹˈæz/, representation /ˌɹɛp.ɹə.zɛnˈteɪ.ʃən/, mechanism /ˈmɛk.ə.nɪ.zəm/, observation /ˌɑbzɚˈveɪʃn̩/

이 영상으로 연습하는 방법

  1. 먼저 말하지 않고 영상을 끝까지 듣고 모르는 단어를 적어 둡니다.
  2. 0.75배속으로 한 문장씩 섀도잉을 시작하고, 익숙해지면 보통 속도로 돌아갑니다.
  3. 자신의 목소리를 녹음해 원본과 비교하고, preference, filter, predict 같은 단어에 특히 주의합니다.

쉐도잉이란? 영어 실력을 빠르게 키우는 과학적 방법

쉐도잉(Shadowing)은 원래 전문 통역사 훈련을 위해 개발된 언어 학습 기법으로, 다언어 학자인 Dr. Alexander Arguelles에 의해 대중화된 방법입니다. 핵심 원리는 간단하지만 매우 강력합니다: 원어민의 영어를 들으면서 1~2초의 짧은 지연으로 즉시 소리 내어 따라 말하는 것——마치 '그림자(shadow)'처럼 화자를 따라가는 것입니다. 문법 공부나 수동적인 청취와 달리, 쉐도잉은 뇌와 입 근육이 동시에 실시간으로 영어를 처리하고 재현하도록 훈련합니다. 연구에 따르면 이 방법은 발음 정확도, 억양, 리듬, 연음, 청취력, 말하기 유창성을 크게 향상시킵니다. IELTS 스피킹 준비와 자연스러운 영어 소통을 원하는 분들에게 특히 효과적입니다.

섀도잉 방법: 단계별 전체 가이드 읽기 →