วีดีโอ

Best 👍

precious concepts love you sir💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖

Wouldn't the undirected graph be /7 and a directed graph be /10. Given the undirected edges would be counted up to 7 and for it to be 10 it'll have to include the directional aspect

Thanks so much for the explanation! Excellent video! May I ask a clarifying question？ why is the denominator 5 instead of 6 （7 edges -1)? Thank you for your explanation！

Thanks SiR.

how you could say Burushaski is endangered. It is not.

Great 👍👍👍

👍👍👍

not understtood

in 0/1, how will you get 1?

Thank you

I love you

Muito bom, excelente !

I have a skepticism about the betweenness centrality in this lecture cause the CB(3) in undirected condition would be 6 but you mentioned it as 0.6. I hope you will mend it.

How n=6 and not 7?

Good video, however you should have a double ended arrow between 3 and 4. Thank you

tnx man u saved us

cool

notes??

Why we don"t involve the situation of j>k in the directed graph when we calculate the betweeness centrality? I can understand we ignore these situations in the undirected graph, because the result is double . In this directed graph, if we calculate E→C， the result will be different. I mean E does have an effect on C in the directed graph, which is not reflected in the paths we have already calculated, right?

thanks! it helps a lot!

How calculate f1score?

Thanks a lot 😊

Thanks for the tutorial

Best vedio I've seen so far thank you soo much

hello! can i ask what book are you using ?

Thanks :)

Hold up... isn't the closeness centrality of a node the inverse of the mean of the shortest paths between it and all others? So, wouldn't C(A) be 4/(1 + 2 + 2 + 3)? Meanwhile, the normalized value divides it by (n - 1), effectively making C'(A) = 1/(1 + 2 + 2 + 3), right?

For those wondering the type is actually the normalised closeness centrality measure ie the closeness centrality divided by the total number of nodes -1. Since the pre normalised centrality is the sum raised to the -1 we get the type on screen

Really helpful!! thanks

You’ve saved my life I swear❤️

detailed explanation with multiple example 🔥🔥 great

How to find betweeness of 1000 nodes in undirected graph?? Please do reply for this

thank you

Great explanation. Thank you

Thank you for your presentation. But,in case of many nodes,calculations can be difficult. Based on your video, I show how to calculate prestige in Rstudio. This is the link. th-cam.com/video/LFVLvYMPmaI/w-d-xo.html

Thanks , for this educational contribution.

Thank you sir

BEST TEACHER!!!

why not indegree was considered?and when to consider indegree and outdegree for degree centraility?

Great work sir, really useful stuff and the way you explain it! Awesome!

Sir How can I get complete code that you wrote

how there is 6 in numarator for node 3

Appreciate the videos!

well explained :)

well explained

in directed graph why we consider only A to C distance and not C to A?

Thanks for the video. It was educative but I noticed you did not calculate the degree of centrality for node 2 GREAT VIDEO!!

Made sense

actually really useful, thanks!