{"id":16306,"date":"2019-10-08T18:11:56","date_gmt":"2019-10-08T22:11:56","guid":{"rendered":"http:\/\/bangla.salearningschool.com\/recent-posts\/graph-mining-k-spanning-trees-learn-by-finding-answers-to-the-following-questions-can-you-answer-the-questions\/"},"modified":"2019-10-10T14:44:28","modified_gmt":"2019-10-10T18:44:28","slug":"graph-mining-k-spanning-trees-learn-by-finding-answers-to-the-following-questions-can-you-answer-the-questions","status":"publish","type":"post","link":"http:\/\/bangla.sitestree.com\/?p=16306","title":{"rendered":"Graph Mining: K-Spanning Trees: Learn by finding answers to the following questions. Can you answer the questions?"},"content":{"rendered":"

Graph Mining: K-Spanning Trees: Learn by finding answers to the following questions. Can you answer the questions?
\n<\/strong>
\nWhat is a Spanning Tree?<\/p>\n

What is a Minimum Spanning Tree?<\/p>\n

For the undirected Graph below, what is a Spanning Tree? First, draw the Graph, then Try to find the answer, and then check the answer below.
\nEdges with weights: {1, 2, 7} {1, 3, 2} {1, 4, 4} {2, 3, 3} {2, 4, 5} {3, 4, 2} {3, 5, 6} {4, 5, 4}<\/p>\n

What is a minimum spanning tree?<\/p>\n

What is the minimum spanning tree for the graph as provided above?<\/p>\n

What is Prim’s Algorithm for Spanning Trees?<\/p>\n

Describe the steps as used in Prim’s Algorithm?<\/p>\n

Give the Algorithm i.e. Prim’s Algorithm?<\/p>\n

Write pseudo-code for Prim’s Algorithm?<\/p>\n

Implement Prim’s Algorithm in Python, R, Matlab, or in any other language of your choice?<\/p>\n

What is the initialization step in Prim’s Algorithm?<\/p>\n

Can you choose any node to start with Prim’s Algorithm?<\/p>\n

True or False, Prim’s algorithm does not include all nodes in the output?<\/p>\n

How an edge\/path is selected in Prim’s Algorithm?<\/p>\n

True or False, to proceed and when to select an edge, the edge does not need to belong to the already formed Minimum Spanning Tree (MST)?<\/p>\n

True or False, to proceed and to select a new edge, the edge will need to have the highest weight outgoing from the MST or from the vertex under consideration)?<\/p>\n

True or False, to proceed and to select a new edge, the edge will need to have the minimum weight outgoing from the MST (or from the vertex under consideration)?<\/p>\n

True or False? The new edge selection steps are as follows.
\nStep 1. For the new edge, exactly one of its vertices\/edge-points will need to be in the MST already
\nStep 2. The new edge has the minimum weight that satisfies step 1.<\/p>\n

How long will you continue to add new edges to the MST? i.e. terminating condition for your algorithm.<\/p>\n

Apply Prim’s algorithm to find the MST in Graph given above\/below: See the answer after you give it a try
\nEdges with weights: {1, 2, 7} {1, 3, 2} {1, 4, 4} {2, 3, 3} {2, 4, 5} {3, 4, 2} {3, 5, 6} {4, 5, 4}<\/p>\n

What is K-Spanning tree?<\/p>\n

What are the steps in K-Spanning Tree?<\/p>\n

Give the Algorithm for K-Spanning?<\/p>\n

Write pseudo-code for K-Spanning?<\/p>\n

Implement the K-Spanning tree algorithm in Python, R, Matlab, or in any other language of your choice?<\/p>\n

What is K in the K-Spanning Tree algorithms?<\/p>\n

How many edges do you remove to create k Clusters?<\/p>\n

What is the first step in the K-Spanning tree?<\/p>\n

When you remove edges from an MST – which edges do you remove? Edges represent distance. The ones with the highest weights or the lowest weights?<\/p>\n

Some Answers:<\/strong><\/p>\n

What is a Spanning Tree?
\nAns: A connected subgraph with all vertices and no cycles<\/p>\n

For the undirected Graph below, what is a Spanning Tree?
\nEdges with weights: {1, 2, 7} {1, 3, 2} {3, 4, 2} {3, 5, 6}
\nWeight: 17<\/p>\n

What is a minimum spanning tree?
\nAns: Spanning trees with the minimum sum of edge weights where weights indicate distances.<\/p>\n

What is the minimum spanning tree for the graph as provided above?
\nAns: the same spanning tree with weight sum = 17
\ni.e. {1, 2, 7} {1, 3, 2} {3, 4, 2} {3, 5, 6}<\/p>\n

What is Prim’s Algorithm for Spanning Trees?
\nAns: Finds the minimum spanning tree<\/p>\n

Apply Prim’s algorithm to find the MST in Graph given above\/below: See the answer after you give it a try
\nEdges with weights: {1, 2, 7} {1, 3, 2} {1, 4, 4} {2, 3, 3} {2, 4, 5} {3, 4, 2} {3, 5, 6} {4, 5, 4}
\nDraw the graph that will make things easier<\/p>\n

Ans: Select node 5
\nSelect (5, 4, 4) from {3, 5, 6} {4, 5, 4}
\nAdd (5, 4) to the MST
\nselect edge {3, 4, 2} from {3, 5, 6} {2, 4, 5} {3, 4, 2} {1, 4, 4}
\nMST: {5, 4, 4} {3, 4, 2}
\nSimilarly: select (3, 2, 3) {1, 3, 2}
\nFinal Output: {5, 4, 4} {3, 4, 2} (3, 2, 3) {1, 3, 2}<\/p>\n

What is the K-Spanning tree?
\nAns: Community\/Clustering Algorithm<\/p>\n

When you remove edges from an MST – which edges do you remove? Edges represent distance. The ones with the highest weights or the lowest weights?
\nAns: highest<\/p>\n

By<\/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

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>
\nNot 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> using Paypal.<\/p>\n","protected":false},"excerpt":{"rendered":"

Graph Mining: K-Spanning Trees: Learn by finding answers to the following questions. Can you answer the questions? What is a Spanning Tree? What is a Minimum Spanning Tree? For the undirected Graph below, what is a Spanning Tree? First, draw the Graph, then Try to find the answer, and then check the answer below. Edges … <\/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-16306","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":16302,"url":"http:\/\/bangla.sitestree.com\/?p=16302","url_meta":{"origin":16306,"position":0},"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":22873,"url":"http:\/\/bangla.sitestree.com\/?p=22873","url_meta":{"origin":16306,"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":22885,"url":"http:\/\/bangla.sitestree.com\/?p=22885","url_meta":{"origin":16306,"position":2},"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":[]},{"id":22891,"url":"http:\/\/bangla.sitestree.com\/?p=22891","url_meta":{"origin":16306,"position":3},"title":"Graph Mining: Misc. Topics to Learn: Misc. Resources to Learn From","author":"Sayed","date":"March 21, 2021","format":false,"excerpt":"Graph Mining: Misc. Topics to Learn: Misc. Resources to Learn From Influence\/Virus\/Label Propagation Resources to learn fromPage A presentation on Influence\/Virus PropagationURL Big Data Graph Databases Resources to Learn FromPage Graph DatabaseURL Neo4jPage Big Data Graph Processing Resources to Learn FromPage ToolURL Techniques, Tools and Applications of Graph AnalyticURL Graph\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":16322,"url":"http:\/\/bangla.sitestree.com\/?p=16322","url_meta":{"origin":16306,"position":4},"title":"Graph Mining: Hits. Learn by finding Answers to the Following Questions. Can you answer the following questions?","author":"Sayed","date":"October 12, 2019","format":false,"excerpt":"Graph Mining: Hits. Learn by finding Answers to the Following Questions. What is HITS algorithm in Graph Mining esp. for Web? What does HITS stand for? What is another similar Algorithm? What are different between the PageRank algorithm and HITS? What is the PageRank algorithm? What is the purpose? Where\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":16324,"url":"http:\/\/bangla.sitestree.com\/?p=16324","url_meta":{"origin":16306,"position":5},"title":"Graph Mining: Highly Connected Subgraph Clustering: Learn by finding answers to the following questions.","author":"Sayed","date":"October 14, 2019","format":false,"excerpt":"Graph Mining: Highly Connected Subgraph Clustering: Learn by finding answers to the following questions. How do you define: Highly Connected? What is a Cluster? What is Subgraph? Does connectivity indicate the number of edges between clusters? True or false: Highly connected clustering means: within a cluster, connectivity will be low.\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\/16306","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=16306"}],"version-history":[{"count":1,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/16306\/revisions"}],"predecessor-version":[{"id":16315,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/16306\/revisions\/16315"}],"wp:attachment":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=16306"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=16306"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=16306"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}