Girvan Newman Algorithm Solved Example 2 | PYQs | Finding Communities | | Big Data Analytics
Вставка
- Опубліковано 22 гру 2023
- Join us on an exciting journey into the world of network communities with our comprehensive guide to the Girvan-Newman algorithm. In this captivating UA-cam video, we delve into the concept of communities, their significance, and how the Girvan-Newman algorithm uncovers them.
In this video frequently asked previous year question is solved step by step with great explanation!
Discover the step-by-step process of the Girvan-Newman algorithm as we break it down in a clear and concise manner. We'll explore how this powerful algorithm identifies communities by iteratively removing edges based on their betweenness centrality, ultimately revealing the underlying structure within complex networks.
But that's not all! Prepare to be amazed as we solve a practical example, demonstrating the algorithm's application with captivating animations and visualizations. Our detailed solution will ensure you grasp each stage of the algorithm and its impact on network communities.
Whether you're a data enthusiast, researcher, or simply curious about network analysis, this video is a must-watch. Unlock the secrets of network communities and gain a deep understanding of the Girvan-Newman algorithm's transformative capabilities.
__________________________________________
🔀 Sorting: • Sorting Algorithms | A...
🔍 Searching Algorithms: • Searching Algorithms |...
🔢 Arrays in Python: • Arrays | At A Glance!
🧮 White Box Testing Numerical: • White Box Testing | At...
📈 Big Data Analytics: • Big Data Analytics | A...
🤖 Deep Learning: • Deep Learning | At A G...
🔗 Blockchain and DLT: • Blockchain and DLT | A...
❤️Heart Disease Prediction using Machine Learning Project: • Heart Disease Predicti...
🐍 Python Small Projects: • Python Small Projects!...
Subscribe to At A Glance!
Buy me a coffee: www.buymeacoffee.com/ataglanc...
Join Telegram: t.me/ataglanceofficial
Official Website: ataglanceofficial.netlify.com/
Follow me on Instagram: / at_a_glance_official
__________________________________________
this comes for 10 marks in the Mumbai University BDA ppr (which is tmrw 🙃) so for 10 marks... do we go ahead and find more communities? Also, if we do go ahead we have to repeat the BFS steps for each node? . Btw, thanks for solving this example , you've uploaded this video at the perfect time, just a God-sent angel for all the MU peeps here...thanks a ton!!
Yes
It doesn't matter if it's for 5,10 or 20
If the question says to find Betweeness centrality, then there is no need to find communities just to get better marks😂👍
obviously!! However, MU has always asked to find communities & not just betweenness centrality, hence I have asked the question :)@@valorantclips3572
Heyyy... If MU asks for 10 marks then yes you need to find communities repeatedly (yes every time you will have to find the bfs for every node). I know it's time consuming but MU wants that🥹
Thanks a lot for your appreciation ♥️ You guys made my day
Please Share it with your friends too ♥️
Best wishes for your exams 💞
Pls can u add the community part its confusing how to solve
your channel us pure goldmine , great explanation and quality of video 🔥
😭😭Thankyou so much for this much appreciation🙏🙏 Please Share it with your friends ♥️ Best wishes for your exams 💞
Amazing cleared all my doubt❤️
Great to hear that♥️😊
Perfect explaination. Thankyou so much🥹
Thanks a ton ☺️
Please Share it with your friends and juniors too 😁
Best wishes for your exams 💞
Thanks! ✨ great explanation
Glad to hear that it helped you ☺️
Please Share it with your friends and juniors too 😁
Best wishes for your exams 💞
We had our bda exam today, my friends and i studied from this playlist and our exams went well! Thank you so much!
Woww! I am really glad that your exams went well☺️
Please Share it with your friends and juniors♥️
great work man!
Thankyou so muchhhh ☺️
Please Share it with your friends and juniors too 😁
Best wishes for your exams 💞
Please make videos like this for NLP
super explanation
Thankyou so much for appreciating ❤️ Please share it with your friends 🤗
Thanks man❤️
You are welcome 😁
so, we can directly give the communities after removing the highest valued edge or do we need to again repeat the steps and find out more communities
See if you have watched previous video on girvan newman there I have mentioned that you need to repeat the steps but as per the questions and marks..
Now two communities are formed so now in each again do the method and try to find the communities in them.. but for this particular video specifically it was asked to find the edge betweenness centralities only..
If you are asked to find communities in the question then look at the marks and find communities, if weightage of marks is higher then go deeper in finding communities
Hope it helps
Do Share it with your friends too ♥️
Best wishes for your exams 💞
@@ataglanceofficial this comes for 10 marks in the Mumbai University BDA ppr (which is tmrw 🙃) so for 10 marks... do we go ahead and find more communities? Also, if we do go ahead we have to repeat the BFS steps for each node? . Btw, thanks for solving this example , you've uploaded this video at the perfect time, just a God-sent angel for all the MU peeps here...thanks a ton!!
in mu question paper it asked like determine communities for a given social graph using Girvan Newman Algorithm for 10 marks , we have to solve exactly same as you did in this video?
Yeahh.. you need to solve that in this way🥂
@@ataglanceofficial thank you
thank you
You are most welcome 🤗
Helpful for tomorrow exam💗
Glad to hear that it's helpful ☺️
Please Share it with your friends and juniors too 😁
Best wishes for your exams 💞
What in the situation if graph is not bidirectional. Will it be divided by 2 or not ?
If the graph is not bidirectional then don't divide by 2, keep it as it is😉
Bahut "particular" bolta hai
the speech will sound more natural with a smooth flow of concepts.
Thank you for pointing out 🙏☺️ I will try to improve it❤️
E,F,G have two ways to reach A.
How could it be? Make sure you are choosing the shortest path only✨
@@ataglanceofficial is it so? Ok got it. Thanks brother.
Yeahh 😉 You are welcome 🤗 Please Share it with your friends too ♥️ Best wishes for your exams 💞
Same question aaya tha yeh aaj exam mai bas community tak find karna tha ...... kya aap iske aage ka bata saktey hai kya step kya tha
Ooh that's great..
See in this video I already have shown how communities will get formed, you have to eliminate edge B-D and then two communities in left and right part will get formed
Now in left part since (A-B-C) since every single node is connected to two neighbouring nodes in closed manner that's why further communities won't be formed in (A-B-C)
Now do the same step of finding BFS by keeping every node as the root node in right part and check whether you get communities in the right part
Hope you understand
@@ataglanceofficial I had created total 4 community
1. A-B-C
2. D-F
3. E
4. G
Is it correct?
Heyyyy yess it is correct ✅
Yessss