{"id":16323,"date":"2019-10-13T13:42:29","date_gmt":"2019-10-13T17:42:29","guid":{"rendered":"https:\/\/bangla.salearningschool.com\/recent-posts\/graph-mining-louvian-modularity-learn-by-finding-answers-to-the-following-questions-can-you-answer-the-following-questions\/"},"modified":"2019-10-17T17:08:48","modified_gmt":"2019-10-17T21:08:48","slug":"graph-mining-louvian-modularity-learn-by-finding-answers-to-the-following-questions-can-you-answer-the-following-questions","status":"publish","type":"post","link":"http:\/\/bangla.sitestree.com\/?p=16323","title":{"rendered":"Graph Mining: Louvian Modularity: Learn by finding answers to the following questions. Can you answer the following questions?"},"content":{"rendered":"

Graph Mining: Louvian\/Louvain Modularity: Learn by finding answers to the following questions. Can you answer the following questions?<\/strong><\/p>\n

I have seen both: Louvian Modularity and Louvain Modularity. I will use Louvain Modularity<\/p>\n

What is the primary problem that Louvain Modularity solved?<\/p>\n

Is Louvain good at detecting small communities?<\/p>\n

What is modularity in Graphs?<\/p>\n

What is the range of values used to show the modularity of a Graph?<\/p>\n

What is the equation for Modularity? You can just only explain conceptually – what are the parameters\/parts – how do the parameters work?<\/p>\n

Give the algorithm for Louvain Modularity? You can just describe or you can show the steps.<\/p>\n

Give the Pseudo-code for Louvain Modularity and implement in Python or R or C\/C++?<\/p>\n

Is Louvain Modularity easily parallelize-able or it is more sequential?<\/p>\n

Investigate if any other algorithm is there that works like Louvain (i.e. can be an extension\/modification of Louvain) that are better suited for Parallelization.<\/p>\n

What is the first step in Louvain Algorithm?<\/p>\n

True or False, at first step, all nodes are assigned to one community?<\/p>\n

True or false, at first each node is assigned to it’s own community? i.e. no of vertices = no of communities<\/p>\n

What are the two steps in Louvain Algorithm? What is the name of the steps?<\/p>\n

What can be the terminating condition for the Louvain Algorithm?<\/p>\n

How a node i is merged to a neighbor node\/community to create a community? What is the measure used? Can you use the modularity equation as the measure to see how and to what node\/community node i will merge to? Can it happen that node i will not be merged with anything though initially, you wanted to merge\/assign i to another node\/community?<\/p>\n

When you will leave a node i alone without merging with a neighbor node\/community? In that case, what will be the value of the modularity i.e. modularity change (i alone or i merged with a node\/community)<\/p>\n

when you try to merge node i with a neighbor node\/community, do you try to assign node i to all possible neighbor node\/community and calculate modularity change? If so, to which node\/community i will get assigned to (describe in terms of modularity change)?<\/p>\n

What is Modularity Optimization in Louvain modularity? Describe the steps\/process for this Optimization.<\/p>\n

What is the second step\/phase for the Louvain Algorithm? What it is called? What happens here? what are the steps\/process?<\/p>\n

Is the Louvain Algorithm supervised?<\/p>\n

Is the Louvain Algorithm fast or slow?<\/p>\n

How many passes do the Louvain Algorithm require to create the communities?<\/p>\n

What is the resolution limit for the Louvain Algorithm?<\/p>\n

When the resolution limit is low, do you get more\/smaller communities?<\/p>\n

When the resolution limit is high, do you get less\/larger output communities?<\/p>\n

What is the numerical range used for the resolution limit?<\/p>\n

Resources:<\/strong>
\nLouvain: Fast and Memory efficient. A Parallel Alternative
\nhttps:\/\/phys.org\/news\/2015-01-fast-problems.html<\/a><\/p>\n

Modularity_(networks)
\nhttps:\/\/en.wikipedia.org\/wiki\/Modularity_(networks)<\/a><\/p>\n

Louvain Modularity
\nhttps:\/\/en.wikipedia.org\/wiki\/Louvain_Modularity<\/a><\/p>\n

Fast unfolding of communities in large networks
\nhttps:\/\/arxiv.org\/pdf\/0803.0476.pdf<\/a><\/p>\n

Resolution Limit
\nhttps:\/\/en.wikipedia.org\/wiki\/Modularity_%28networks%29#Resolution_limit<\/a><\/p>\n

By<\/strong><\/p>\n

Sayed Ahmed<\/strong><\/p>\n

Linkedin<\/strong>: https:\/\/ca.linkedin.com\/in\/sayedjustetc<\/a><\/p>\n

Blog<\/strong>: http:\/\/Bangla.SaLearningSchool.com<\/a>, http:\/\/SitesTree.com<\/a>
\nOnline and Offline Training<\/strong>: http:\/\/Training.SitesTree.com<\/a><\/p>\n

Not that this site is doing any great work;<\/strong> However, if you want to contribute to the operation of this site (or charitable\/non-profit work in the education sector), you can financially contribute to: safoundation at salearningschool.com<\/a> (Justetc Social Services) using Paypal.<\/p>\n

Affiliate Links:<\/strong>
\nHottest Deals on Amazon USA: http:\/\/tiny.cc\/38lddz<\/a><\/p>\n

Hottest Deals on Amazon CA: http:\/\/tiny.cc\/bgnddz<\/a><\/p>\n

Hottest Deals on Amazon Europe: http:\/\/tiny.cc\/w4nddz
\n<\/a>
\n
\n<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Graph Mining: Louvian\/Louvain Modularity: Learn by finding answers to the following questions. Can you answer the following questions? I have seen both: Louvian Modularity and Louvain Modularity. I will use Louvain Modularity What is the primary problem that Louvain Modularity solved? Is Louvain good at detecting small communities? What is modularity in Graphs? What is … <\/p>\n

Continue reading<\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[1905,182],"tags":[],"class_list":["post-16323","post","type-post","status-publish","format-standard","hentry","category-graph-mining","category---blog","item-wrap"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[{"id":26233,"url":"http:\/\/bangla.sitestree.com\/?p=26233","url_meta":{"origin":16323,"position":0},"title":"Graph Mining: Louvian Modularity: Learn by finding answers to the following questions. Can you answer the following questions? #Root","author":"Author-Check- Article-or-Video","date":"April 20, 2021","format":false,"excerpt":"Graph Mining: Louvian\/Louvain Modularity: Learn by finding answers to the following questions. Can you answer the following questions? I have seen both: Louvian Modularity and Louvain Modularity. I will use Louvain Modularity What is the primary problem that Louvain Modularity solved? Is Louvain good at detecting small communities? What is\u2026","rel":"","context":"In "FromSitesTree.com"","block_context":{"text":"FromSitesTree.com","link":"http:\/\/bangla.sitestree.com\/?cat=1917"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":22873,"url":"http:\/\/bangla.sitestree.com\/?p=22873","url_meta":{"origin":16323,"position":1},"title":"Graph Mining: Learning Resources","author":"Sayed","date":"March 21, 2021","format":false,"excerpt":"Resources: Public URLs Graph Mining: Introducing Graphs: Learn by finding answers to the following questions?\u00a0http:\/\/bangla.salearningschool.com\/recent-posts\/graph-mining-introducing-graphs-learn-by-finding-answers-to-the-following-questions\/ Graph Mining: What is Graph Mining? Learn by finding answers to the following questions. Can you answer the following questions?\u00a0http:\/\/bangla.salearningschool.com\/recent-posts\/graph-mining-what-is-graph-mining-learn-by-finding-answers-to-the-following-questions-can-you-answer-the-following-questions\/ Graph Mining: Shared Nearest Neighbors : Clustering : Community Detection.\u00a0http:\/\/bangla.salearningschool.com\/recent-posts\/graph-mining-shared-nearest-neighbors-clustering-community-detection\/ Graph Mining: Betweenness Based Clustering:\u2026","rel":"","context":"In "Graph Mining"","block_context":{"text":"Graph Mining","link":"http:\/\/bangla.sitestree.com\/?cat=1905"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":16300,"url":"http:\/\/bangla.sitestree.com\/?p=16300","url_meta":{"origin":16323,"position":2},"title":"Graph Mining: Community Detection: Learn by finding answers to the following questions. Can you answer the following questions on Community Detection?","author":"Sayed","date":"October 7, 2019","format":false,"excerpt":"Graph Mining: Community Detection: Learn by finding answers to the following questions. Can you answer the following questions on Community Detection? What is a community anyway? Describe from your real-world\/social understanding of it? Can you relate it to the Graphs concept in Computer Science? In your daily life do you\u2026","rel":"","context":"In "AI ML DS RL DL NN NLP Data Mining Optimization"","block_context":{"text":"AI ML DS RL DL NN NLP Data Mining Optimization","link":"http:\/\/bangla.sitestree.com\/?cat=1910"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":16302,"url":"http:\/\/bangla.sitestree.com\/?p=16302","url_meta":{"origin":16323,"position":3},"title":"Graph Mining: Shared Nearest Neighbors : Clustering : Community Detection","author":"Sayed","date":"October 7, 2019","format":false,"excerpt":"Graph Mining: Shared Nearest Neighbors : Clustering : Community Detection Graph Mining: Shared Nearest Neighbors (SNN): Clustering : Community Detection: Learn by Finding Answers to the Following Questions. Will use SNN sometimes. What is one another name of the algorithm: Shared Nearest Neighbors? What is the purpose of the Algorithm:\u2026","rel":"","context":"In "Graph Mining"","block_context":{"text":"Graph Mining","link":"http:\/\/bangla.sitestree.com\/?cat=1905"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":22883,"url":"http:\/\/bangla.sitestree.com\/?p=22883","url_meta":{"origin":16323,"position":4},"title":"Graph Mining: Community and Cluster Detection","author":"Sayed","date":"March 21, 2021","format":false,"excerpt":"Resources to Learn From Resources:Defining and identifying communities in networkshttps:\/\/www.pnas.org\/content\/101\/9\/2658Community Structure:https:\/\/en.wikipedia.org\/wiki\/Community_structureGraph Clustering:https:\/\/www.csc2.ncsu.edu\/faculty\/nfsamato\/practical-graph-mining-with-R\/slides\/pdf\/Graph_Cluster_Analysis.pdf Read the resources above to find answers. Community Detection: Learn by finding answers to the following questions. Can you answer the following questions on Community Detection? Graph Mining: Community Detection: Learn by finding answers to the following questions.\u2026","rel":"","context":"In "Graph Mining"","block_context":{"text":"Graph Mining","link":"http:\/\/bangla.sitestree.com\/?cat=1905"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":22885,"url":"http:\/\/bangla.sitestree.com\/?p=22885","url_meta":{"origin":16323,"position":5},"title":"Graph Mining: Shared Nearest Neighbors – Community Detection","author":"Sayed","date":"March 21, 2021","format":false,"excerpt":"Resources to Learn From Resources:Jarvis-Patrick Clusteringhttps:\/\/btluke.com\/jpclust.htmlEmpirical Comparison of Algorithms for Network Community Detectionhttps:\/\/cs.stanford.edu\/~jure\/pubs\/communities-www10.pdf Read the resources above to find answers. Shared Nearest Neighbors : Clustering : Community Detection Graph Mining: Shared Nearest Neighbors : Clustering : Community Detection Graph Mining: Shared Nearest Neighbors (SNN): Clustering : Community Detection: Learn by\u2026","rel":"","context":"In "Graph Mining"","block_context":{"text":"Graph Mining","link":"http:\/\/bangla.sitestree.com\/?cat=1905"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/16323","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=16323"}],"version-history":[{"count":1,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/16323\/revisions"}],"predecessor-version":[{"id":16329,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/16323\/revisions\/16329"}],"wp:attachment":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=16323"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=16323"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=16323"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}