쉐도잉 연습: Naive Bayes, Clearly Explained!!! - 영상으로 영어 말하기 배우기
연습 모드 선택
각 모드는 전체 화면 연습실로 열립니다.
156 문장
문장이 너무 짧거나 길면 Edit를 눌러 조정하세요.
1
I'm at home during lockdown, working on my StatQuest, yeah!
2
I'm at home during lockdown, working on my StatQuest, yeah!
3
StatQuest!
4
Hello, I'm Josh Starmer and welcome to StatQuest.
5
Today we're going to talk about Naive Bays and it's going to be clearly explained.
6
This StatQuest is sponsored by JadBio.
7
Just add data and their automatic machine learning algorithms will do the rest of the work for you.
8
For more details, follow the link in the pinned comment below.
9
Note, when most people want to learn about Naive Bayes, they want to learn about the multinomial
10
Naive Bayes classifier, and that's what we talk about in this video.
11
However, just know that there is another commonly used version of Naive Bayes called Gaussian Naive Bayes Classification,
12
and I cover that in a follow -up stat quest.
13
So check that one out when you're done with this quest.
14
Bam.
15
Now, imagine we received normal messages from friends and family.
16
And we also received spam, unwanted messages that are usually scams or unsolicited advertisements.
17
And we wanted to filter out the spam messages. So, the first thing we do is make a histogram of all the words
18
that occur in the normal messages from friends and family.
19
We can use the histogram to calculate the probabilities of seeing each word given that it was in a normal message.
20
For example, the probability we see the word deer, given that we saw it in a normal message,
21
is 8, the total number of times dear occurred in normal messages,
22
divided by 17, the total number of words in all of the normal messages.
23
And that gives us 0 .47.
24
So let's put that over the word dear so we don't forget it.
25
Likewise, the probability that we see the word friend, given that we saw it in a normal message,
26
is 5, the total number of times friend occurred in normal messages,
27
divided by 17, the total number of words in all of the normal messages.
28
And that gives us 0 .29.
29
So let's put that over the word friend so we don't forget it.
30
Likewise, the probability that we see the word lunch, given that it is in a normal message, is 0 .18.
31
And the probability that we see the word money, given that it is in a normal message, is 0 .06.
32
Now we make a histogram of all the words that occur in the spam.
33
And calculate the probability of seeing the word deer, given that we saw it in the spam.
34
And that is 2, the number of times we saw deer in the spam, divided by 7, the total number of words in the spam.
35
And that gives us 0 .29.
36
Likewise, we calculate the probability of seeing the remaining words, given that they were in the spam.
37
Bam!
38
Now, because these histograms are taking up a lot of space, let's get rid of them, but keep the probabilities.
39
Oh no!
40
It's the dreaded terminology alert!
41
Because we have calculated the probabilities of discrete, individual words, and not the probability of something continuous,
42
like weight or height, these probabilities are also called likelihoods.
43
I mention this because some tutorials say these are probabilities, and others say they are likelihoods.
44
In this case, the terms are interchangeable, so don't sweat it.
45
We'll talk more about probabilities versus likelihoods when we talk about Gaussian naive bays in the follow -up quest.
46
Now, imagine we got a new message that said,
47
Dear Friend, and we want to decide if it is a normal message or spam down.
48
We start with an initial guess about the probability that any message, regardless of what it says, is a normal message.
49
This guess can be any probability that we want, but a common guess is estimated from the training data.
50
For example, since 8 of the 12 messages are normal messages, our initial guess will be 0 .67.
51
So let's put that under the normal messages so we don't forget it.
52
Oh no!
53
It's another dreaded terminology alert!
54
The initial guess that we observe a normal message is called a prior probability.
55
Now we multiply the initial guess by the probability that the word dear occurs in a normal message,
56
and the probability that the word friend occurs in a normal message.
57
Now we just plug in the values that we worked out earlier and do the math.
58
Beep, boop, beep, boop, beep.
59
And we get 0 .09.
60
We can think of 0 .09 as the score that
61
Dear Friend gets if it is a normal message.
62
However, technically, it is proportional to the probability that the message is normal, given that it says Dear Friend.
63
So let's put that on top of the normal messages so we don't forget.
64
Now, just like we did before, we start with an initial guess about the probability that any message, regardless of what it says, is spam.
65
And just like before, the guess can be any probability we want, but a common guess is estimated from the training data.
66
And since 4 of the 12 messages are spam, our initial guess will be 0 .33.
67
So let's put that under the spam so we don't forget it.
68
Now we multiply that initial guess by the probability that the word dear occurs in spam.
69
And the probability that the word friend occurs in spam.
70
Now we just plugged in the values that we worked out earlier and do the math.
71
Bip, boop, bip, boop, bip.
72
And we get 0 .01.
73
Like before, we can think of 0 .01 as the score that
74
Dear Friend gets if it is spam.
75
However, technically, it is proportional to the probability that the message is spam given that it says Dear Friend.
76
And because the score we got for normal message, 0 .09, is greater than the score we got for spam,
77
0 .01, we will decide that
78
Dear Friend is a normal message.
79
Double bam!
80
Now, before we move on to a slightly more complex situation, let's review what we've done so far.
81
We started with histograms of all the words in the normal messages, and all of the words in the spam.
82
Then we calculated the probabilities of seeing each word, given that we saw the word in either a normal message or spam.
83
Then we made an initial guess about the probability of seeing a normal message.
84
This guess can be anything between 0 and 1, but we based ours on the classifications in the training dataset.
85
Then we made the same sort of guess about the probability of seeing spam.
86
Then we multiplied our initial guess
87
that the message was normal by the probabilities of seeing the words dear and friend given that the message was normal.
88
Then we multiplied our initial guess that the message was spam by the probabilities of seeing the words
89
Dear and Friend given that the message was spam.
90
Then we did the math and decided that
91
Dear Friend was a normal message because 0 .09 is greater than 0 .01.
92
Now that we understand the basics of how
93
Naive Bayes classification works, let's look at a slightly more complicated example.
94
This time, let's try to classify this message, lunch, money, money, money, money.
95
Note, this message contains the word money four times.
96
And since the probability of seeing the word money is much higher in spam than in normal messages,
97
then it seems reasonable to predict that this message will end up being spam.
98
So let's do the math math.
99
Calculating the score for a normal message works just like before.
100
We start with the initial guess, then we multiply it by the probability we see lunch, given that it is in a normal message,
101
and the probability we see money four times, given that it is in a normal message.
102
When we do the math, we get this tiny number.
103
However, when we do the same calculation for spam, we get zero.
104
This is because the probability we see lunch in spam is zero since it was not in the training data.
105
And when we plug in zero for the probability we see lunch given that it was in spam,
106
then it doesn't matter what value we picked for the initial guess that the message was spam,
107
and it doesn't matter what the probability is that we see money given that the message was spam.
108
because anything times zero is zero.
109
In other words, if a message contains the word lunch, it will not be classified as spam.
110
And that means we will always classify the messages with lunch in them as normal,
111
no matter how many times we see the word money. And that's a problem.
112
To work around this problem, people usually add one count, represented by a black box, to each word in the histograms.
113
The number of counts we add to each word is typically referred to with the Greek letter alpha.
114
In this case, alpha equals 1, but we could have set it to anything.
115
Anyway, now when we calculate the probabilities of observing each word, we never get zero.
116
For example, the probability of seeing lunch, given that it is in spam, is 1 divided by 7,
117
the total number of words in spam, plus 4, the extra counts that we added.
118
And that gives us 0 .09.
119
adding counts to each word does not change our initial guess that a message is normal, or the initial guess that the message is spam,
120
because adding a count to each word did not change the number of messages in the training data set that are normal,
121
or the number of messages that are spam.
122
Now when we calculate the scores for this message, we still get a small number for the normal message.
123
But now when we calculate the value for spam, we get a value greater than zero.
124
And since the value for spam is greater than the one for a normal message, we classify the message as spam.
125
Spam!
126
Now let's talk about why
127
Naive Bayes is naive.
128
The thing that makes
129
Naive Bayes so naive is that it treats all word orders the same.
130
For example, the normal message score for the phrase
131
Dear Friend is the exact same for the score for Friend Dear.
132
In other words, regardless of how the words are ordered, we get 0 .08.
133
Treating all word orders equal is very different from how you and I communicate.
134
Every language has grammar rules and common phrases, but Naive Bayes ignores all of that stuff.
135
Instead, Naive Bayes treats language like it is just a bag full of words and each message is a random handful of them.
136
Naive Bayes ignores all the rules because keeping track of every single reasonable phrase in a language would be impossible.
137
That said, even though Naive Bayes is naive, it tends to perform surprisingly well when separating normal messages from spam.
138
In machine learning lingo, we'd say that by ignoring relationships among words, Naive Bayes has high bias.
139
But, because it works well in practice, Naive Bayes has low variance.
140
Shameless Self -Promotion.
141
If you are not already familiar with the terms bias and variance, check out the quest.
142
The link is in the description below.
143
Triple spam!
144
Oh no, it's one last shameless self -promotion.
145
One awesome way to support StatQuest is to purchase the Naive Bayes StatQuest Study Guide.
146
It has everything you need to study for an exam or job interview.
147
It's eight pages of total awesomeness.
148
And while you're there, check out the other StatQuest Study Guides.
149
There's something for everyone.
150
Hooray!
151
We've made it to the end of another exciting StatQuest.
152
If you like this StatQuest and want to see more, please subscribe.
153
And if you want to support StatQuest, consider contributing to my Patreon campaign,
154
becoming a channel member, buying one or two of my original songs or a t -shirt or a hoodie, or just donate.
155
The links are in the description below.
156
Alright, until next time, Quest on!
앱 다운로드
유창하게 말하는 데 필요한 모든 것
AI 발음 평가문장마다 점수 확인
IPA 발음 연습모든 소리 마스터
단어 학습나만의 단어장 만들기
단어 게임놀면서 외우기
같은 채널
C11
The GELU, SiLU and SwiGLU activation functions, clearly explained!!!
Daily ConversationUniversity Students
C17
Gaussian Naive Bayes, Clearly Explained!!!
Daily ConversationUniversity Students
C11
The Essential Main Ideas of Neural Networks
Business EnglishUniversity StudentsWorking Adults
C11
A Gentle Introduction to Machine Learning
Business EnglishUniversity StudentsWorking Adults
FOR YOU
추천 영상
C11
275 문장
Every Networking Concept Explained In 20 Minutes
Daily ConversationUniversity StudentsWorking Adults
C111
93 문장
Naive Bayes
Daily ConversationUniversity Students
C11
137 문장
JUST $1 For Billions of Tokens?! (DeepSeek v4 Pro)
Daily ConversationUniversity StudentsWorking Adults
C11
244 문장
1. Introduction to statistics - Lecture 1
Daily ConversationUniversity Students
C11
154 문장
How do some languages not have tense?
Daily ConversationUniversity Students
C13
279 문장
LET THERE BE... Voltage? | Maxwell's Equation #2 Explained for Beginners
Daily ConversationUniversity Students
C11
712 문장
Master AI in 60 Minutes with Vector Databases!
Daily ConversationUniversity Students
C12
78 문장
Vanishing & Exploding Gradient explained | A problem resulting from backpropagation
Daily ConversationUniversity Students
B11
30 문장
Video
Daily ConversationUniversity Students
C12
582 문장
You've (Likely) Been Playing The Game Of Life Wrong
Daily ConversationUniversity StudentsWorking Adults
이 레슨의 어휘와 말하기 포인트
이 말하기 레슨은 영상 “Naive Bayes, Clearly Explained!!!”을(를) 바탕으로 합니다. 가장 자주 반복되는 단어는 다음과 같습니다: message, word, normal, spam, probability. 이 영상에는 섀도잉할 문장 156개와 단어 1966개가 있습니다. 말하는 구간의 길이는 15:11입니다. 화자는 분당 약 130단어의 일정한 속도로 말해서 섀도잉하기에 편한 속도입니다. 단어의 83%가 영어에서 가장 많이 쓰이는 3,000단어에 속합니다. 나머지는 연습 전에 미리 확인해 두세요.
이 영상의 핵심 어휘
영상에 나오는 익혀 둘 만한 단어 15개를 발음, 뜻과 함께 정리했습니다.
| 단어 | 발음 | 뜻 |
|---|---|---|
| spam 명사 | /spæm/ | 스팸, 스팸 메일 |
| probability 명사 | /ˌpɹɑ.bəˈbɪl.ə.ti/ | 확률 |
| naive 형용사 | /naɪˈiv/ | 순진하다, 우직하다 |
| calculate 동사 | /ˈkælkjʊleɪt/ | 정산하다, 계산하다 |
| occur 동사 | /əˈkɜː/ | 일어나다, 발생하다 |
| mathematics 명사 | /mæθ(.ə)ˈmæt.ɪks/ | 수학 |
| quest 명사 | /kwɛst/ | 탐색, 탐구 |
| divide 동사 | /dɪˈvaɪd/ | 나누다, 가르다 |
| ignore 동사 | /ɪɡˈnɔː/ | 무시하다 |
| phrase 명사 | /ˈfɹeɪ̯z/ | 어구, 구 |
| classification 명사 | /ˌklæsɪfɪˈkeɪʃən/ | 분류 |
| plug 명사 | /plʌɡ/ | 플러그 |
| deer 명사 | /dɪɹ/ | 사슴 |
| likelihood 명사 | /ˈlaɪklihʊd/ | 가능성 |
| promotion 명사 | /pɹəˈmoʊʃn̩/ | 승진, 진급 |
이 영상의 문법
화자가 가장 많이 쓰는 문형을 영상 속 실제 표현과 함께 정리했습니다.
| 문형 | 영상 속 표현 |
|---|---|
| 수동태 be + 과거분사 — 누가 하는지보다 무슨 일이 일어나는지에 초점 | is sponsored · are also called · is estimated |
| 현재완료 have/has + 과거분사 — 과거의 일이 지금도 관련이 있을 때 | have calculated · we've done · We've made |
주의할 발음
화자는 don't, I'm, doesn't 같은 축약형과 약화된 형태를 18번 사용합니다. 들리는 대로 짧게 발음하세요.
- “th” 소리: mathematics /mæθ(.ə)ˈmæt.ɪks/, algorithm /ˈælɡəɹɪðm̩/
- “sh”와 “zh” 소리: classification /ˌklæsɪfɪˈkeɪʃən/, promotion /pɹəˈmoʊʃn̩/, examination /ɪɡˌzæm.ɪˈneɪ.ʃən/, calculation /ˌkælkjuˈleɪʃn̩/, shameless /ˈʃeɪ̯mlɪs/
- 긴 단어 — 강세 위치에 주의: probability /ˌpɹɑ.bəˈbɪl.ə.ti/, mathematics /mæθ(.ə)ˈmæt.ɪks/, classification /ˌklæsɪfɪˈkeɪʃən/, technically /ˈtɛk.nɪˌkəl.i/, terminology /ˌtɝ.məˈnɑ.lə.d͡ʒi/
한국어 화자가 어려워하는 소리:
- /f/ — ㅍ(/p/)으로 바꾸지 말고 윗니를 아랫입술에 대기: phrase /ˈfɹeɪ̯z/, classification /ˌklæsɪfɪˈkeɪʃən/, alpha /ˈæl.fə/, refer /ɹɪˈfɜː/, filter /ˈfɪltɚ/
- /v/ — ㅂ(/b/)과 구별하기: naive /naɪˈiv/, divide /dɪˈvaɪd/, observe /əbˈzɜːv/, versus /ˈvɝsəs/, advertisement /ˈædvɚˌtaɪzmənt/
- /z/ — ㅈ이 아니라 성대를 울리는 /s/: phrase /ˈfɹeɪ̯z/, likewise /ˈlaɪkˌwaɪz/, observe /əbˈzɜːv/, examination /ɪɡˌzæm.ɪˈneɪ.ʃən/, surprisingly /səˈpɹaɪzɪŋli/
이 영상으로 연습하는 방법
- 먼저 말하지 않고 영상을 끝까지 듣고 모르는 단어를 적어 둡니다.
- 보통 속도로 한 문장씩 섀도잉하고, 화자의 리듬과 맞을 때까지 반복합니다.
- 자신의 목소리를 녹음해 원본과 비교하고, spam, probability, naive 같은 단어에 특히 주의합니다.
쉐도잉이란? 영어 실력을 빠르게 키우는 과학적 방법
쉐도잉(Shadowing)은 원래 전문 통역사 훈련을 위해 개발된 언어 학습 기법으로, 다언어 학자인 Dr. Alexander Arguelles에 의해 대중화된 방법입니다. 핵심 원리는 간단하지만 매우 강력합니다: 원어민의 영어를 들으면서 1~2초의 짧은 지연으로 즉시 소리 내어 따라 말하는 것——마치 '그림자(shadow)'처럼 화자를 따라가는 것입니다. 문법 공부나 수동적인 청취와 달리, 쉐도잉은 뇌와 입 근육이 동시에 실시간으로 영어를 처리하고 재현하도록 훈련합니다. 연구에 따르면 이 방법은 발음 정확도, 억양, 리듬, 연음, 청취력, 말하기 유창성을 크게 향상시킵니다. IELTS 스피킹 준비와 자연스러운 영어 소통을 원하는 분들에게 특히 효과적입니다.