if someone like myself is thinking how to find the value of k, so here it is: K should be the square root of n (number of data points in the training dataset). K should be chosen as the odd so that there are no ties. If the square root is even, then add or subtract 1 to it.
Thank you very much Sir! i am a student of you but still saying Sirji aapke method of Teaching mein Quality, Effectiveness aur Time Efficiency teeno hai. Aapke Efforts ke liye bahot bahot Dhanyavad.
This is good. Can you tell me how to calculate distance if the indicator variables are numerical and categorical. For e.g P1={4,6,f,8,v} & P2={8,2,y,7,p}
You need to convert all those categories into numbers like if you have 3 categories v,p,y so it will be converted into 0,1,2. So all the v's in data will get converted to 0, p's to 1 and so on 🤟
important observation 1. if k is not given in the question , always take k as a odd number to avoid tie. 2. for guessing take square root of n , and if it comes out to be a even number , then add or subtract +1 .
Love the pace of your videos, I was finally able to watch a video in which the instructor maintained his pace and I could skip through and understand everything
Your all videos in ML are good. For this particular one you have not explain that to have decision we must always K as ODD number and how to arrive at best K value , also what if the label is numeric instead of boolean.
We use odd values for k just to avoid tie situation and there is no hard & fast rule for finding value of k and it can be taken experimentally. Few methods are there like elbow method etc
I have few questions 1. Why did you take k=3 2. Why wasn't 3.16 considered nearest to 3 3. Had we set k=2 and result as 1 Fail and 1 Pass, what would have been the conclusion?
1. K is the number of nearest neighbours that have to be acknowledged. K is provided in the question usually. 2. 3 is not the comparison value. That is just the number of neighbours you have to figure out. you have to compare the values to zero. Consider x to be on the origin and you are figuring out the distances of it's nearest neighbours. 3. k=2 here will give two pass. If it was one pass and one fail then you would have to consider one more neighbour to give you some probable answer.
@@019_deepdas2 That just means the question didn't choose an appropriate value of k. It will have to be adjusted to include less or more neighbors to consider. I don't think an exam would include such a question unless they want you to explain what should be done to remedy this.
5:33 Correction: The point is in fact the farthest from x. We are not comparing the distances with k, it just represents the number of nearest points we will consider. We are actually comparing the distance with 0, the smaller the distance the closer it is to 0 and the nearer it is to x! Great video nonetheless!
3 is not the comparison value. That is just the number of neighbours you have to figure out. you have to compare the values to zero. Consider x to be on the origin and you are figuring out the distances of it's nearest neighbours.
Because of your videos, my professor said: 7:11. Thank you so much!
hahahha Good
gooood
Nice one!👍
Hahahhahahahhaha...😆😆
Hillarious ...
if someone like myself is thinking how to find the value of k, so here it is:
K should be the square root of n (number of data points in the training dataset).
K should be chosen as the odd so that there are no ties. If the square root is even, then add or subtract 1 to it.
Thanks man
thanks bro
Thank you very much Sir! i am a student of you but still saying Sirji aapke method of Teaching mein Quality, Effectiveness aur Time Efficiency teeno hai. Aapke Efforts ke liye bahot bahot Dhanyavad.
Thank u so much sir...aap wo concept 5 min clear krdete ho jo hamare teachers pure semester me nhi kr pate
Thank you , very very much.
मैंने कितना वीडियो देखा पर यह सबसे अच्छा हैं.
Please also tell how to choose or select "K".
Sir , Great explanation , thanks a lot , am having zero knowledge on this,but learnt because of you
thought my 2nd name was complicated to spell
The bestest channel for last minute preparations in machine learning 💯💯💯
Thanku sir we are very fortunate to have this UA-cam channel as well as your way of teaching and skills got to you
Has anyone noticed that we can directly conclude pass from the second row of the given data :D BTW Nice explanation
yes we can conclude from the 2nd row but if data set is large then difficult to conclude.Thanks
No we can't because we need to see CS marks too
@@alphagamma7662 its 8 more than 7, so technically he is passed 🤟😂
But it is not for us.
It is for computer?
Is it computer has brain like you?
You are such a good explanator! Very well explained
kal meri machine learning ki exam hai or aaj mevideos dekh rhi apke it helpss alot sir thank you so much!!!!!
Pass ho gya?
Thank you very much i cleared many topics because of you .hope my exam goes well.
Really helpful for exam preparation within a short span of time ,thank u for ur effort sir🤩🤩🤩
Brother Thank you so much ! All concepts cleared
thank you so much for creating such videos i am passing my exams just because of you god bless
It was really very helpful for me. Your way of teaching is really very good.
Hi , angel Priya
Hey fake girl
You are more than a teacher , a magicial ,,, thank you so much sir
Congratulations Bhai Pass hogaya, ab mai bhi yeh vimdeo dekh ke paas ho jaunga 😼
Amazing sir , really understood the concept just in 5 min
This is good. Can you tell me how to calculate distance if the indicator variables are numerical and categorical. For e.g P1={4,6,f,8,v} & P2={8,2,y,7,p}
You need to convert all those categories into numbers like if you have 3 categories v,p,y so it will be converted into 0,1,2. So all the v's in data will get converted to 0, p's to 1 and so on 🤟
Sir, this is high quality stuff.
guys dont waste your time on youtube , just watch this video , best video on whole youtube
Tomorrow is my exam and your short Video are really helpful ❤
best channel to study at last night ....Thank you !!
important observation
1. if k is not given in the question , always take k as a odd number to avoid tie.
2. for guessing take square root of n , and if it comes out to be a even number , then add or subtract +1 .
wah..keya simple explanation sir...aap kamal kah teacher ho
I am very happy sir
This topic very help my final exam
hamare coaching centre vale sir aapke videos dekte aur hume padate hain, aapke example ka screenshot lete hain aur itne ache se explain tak nahi kiya.
Thank you so much Sir, it's my best channel ever😇
kdk explaination sir.....Its really the 5 minute engineering.....
Thanks a lot sir. Am from Bangladesh and thankful for video.
Thanks sir paper aacha gaya aapki vagase!!!!🙏🙏🙏
Finally I got it after coming from the previous semester.
Sir, you explained the whole concept in an easy way. Thank you so much!
Love the pace of your videos, I was finally able to watch a video in which the instructor maintained his pace and I could skip through and understand everything
Easiest explanation ever.
Bhai I just love your style and effort. Awesome video bro.
Bhai case based reasoning par big bana de ek video......exam hai pls
sir bahot acche padathe he ....video chota banane ke liya app chota solving part skip kare to be achha hoga
Thanks for this video......your teaching method is toooooo good please give also another example of this point
Kya teacher hai 🙌🏼
Super this is how you teach no jargons; thanks
Its very Cleared and in short thanks a lot
such a good explanation, Thank you so much!!
Excellent sir. Please also make practical with python..............
Awesome explaination of algo in short time, great video sir!!👍
Greate sir learn so much within less tjme
Great teaching Sir Ji, keep it up & GOD blessed Uhhh😃👌✌🤟👍👏
Excellent explaination. thank you sir🙏🙏
Very nice way of teaching sir!!
Your all videos in ML are good. For this particular one you have not explain that to have decision we must always K as ODD number and how to arrive at best K value , also what if the label is numeric instead of boolean.
We use odd values for k just to avoid tie situation and there is no hard & fast rule for finding value of k and it can be taken experimentally. Few methods are there like elbow method etc
hi brother. good videos, could you make a video explaining svm ?
extremely good teaching
Awesome explanation.....very simple and easy yet effective.....great job...:)
I have few questions
1. Why did you take k=3
2. Why wasn't 3.16 considered nearest to 3
3. Had we set k=2 and result as 1 Fail and 1 Pass, what would have been the conclusion?
1. K is the number of nearest neighbours that have to be acknowledged. K is provided in the question usually.
2. 3 is not the comparison value. That is just the number of neighbours you have to figure out. you have to compare the values to zero. Consider x to be on the origin and you are figuring out the distances of it's nearest neighbours.
3. k=2 here will give two pass. If it was one pass and one fail then you would have to consider one more neighbour to give you some probable answer.
@@kartikchoudhary6195 thankyou for the 3rd point 👍🏻
@@kartikchoudhary6195 If the number of pass fail is equal and there is no more neighbour then what will be the answer ?
@@019_deepdas2 That just means the question didn't choose an appropriate value of k. It will have to be adjusted to include less or more neighbors to consider. I don't think an exam would include such a question unless they want you to explain what should be done to remedy this.
k should be taken as odd number only
Thank you so much for save my time sir
Another awesome video...Thanks
What if the Pass Probability = Fail Probability ?
Go for anyone
That is the reason we should take k an odd number, so that you'll never endup getting a tie
@@vivektomar4208 that would be a biased result
Zabr10 Explanation is real good
Very nice explanation. Thank you!
Clearly Explanation....
wow, it's like you gotta kidding with me, jsy sir g ap ny hr chz explain ki mza a gya, thanks a lot sir
You are the best.
Thank you Brother!! Are u mechanical Engg. Background?
very well explained thank you sir
Sir u are dam amazing trust me.. the way u explain topics in so amazing and wonderful..🔥🔥🔥🌟⭐
u explained very well sir , thank you so much !
Very nice and clear explanation, thank you so much Sir.
very good sir
5:33 Correction: The point is in fact the farthest from x. We are not comparing the distances with k, it just represents the number of nearest points we will consider. We are actually comparing the distance with 0, the smaller the distance the closer it is to 0 and the nearer it is to x! Great video nonetheless!
thanks, actually i confused at that point
yeah l was also confused why he didn't took 3.16
3 is not the comparison value. That is just the number of neighbours you have to figure out. you have to compare the values to zero. Consider x to be on the origin and you are figuring out the distances of it's nearest neighbours.
what if k is equal to 4 and we get 2 pass and 2 fail from euclidean distance
Very good explanation.
Very well explained. Thank You :)
you are the BEST SIR
bhai bhot mast short and sweet explain kiyay....
Wow! Amazing explanation!
We can not take k as even no as you said. Because if we will take then there will be a tie possibility.
So k should be odd no.
Can anybody explain that how the actual algorithm works becoz everyone teachs about problems but not on algorithms😑
😂😂
you save my day
You are Just brilliant!!! Amazing explanation
Sir your Vedio was fantastic
very well explained sir
Thanks u sir... Also make videos on Theory of computation...
Zabardast👏👏👏👏👏
We likes your all videos... We require haversine algorithm with simple example.. Please request you to make it for us..
Very well explained. 😊
Thankyou
thanks for saving time.
Thank you Sir..well explained..
why we have selected 3 why not 2 or any even number?
OR SIRF EK EXAMPLE SE KYA HOGA
😇😇😇 NICE EXPLAINATION
Nice Explanation
What if K=4 and 2 nearest point are pass and other 2 nearest point are fail, what will be the result then?
Awesome explanation keep it up
Bro tu Kamal hai yaar
7:57 mins worth it :)
Thank you sir for this videos🎉
Very helpful, subscribed for your help
thank you....from karachi
Thank you so much sir for your assistance..
Good Explanation👍
amazing explaination