Resources to Learn From
A Book.
Nagiza F. Samatova, William Hendrix, John Jenkins, Kanchana Padmanabhan, and Arpan Chakraborty. 2013. Practical Graph Mining with R. Chapman & Hall/CRC.
Read the resources above to find answers. Betweenness Based Clustering: Learn by finding answers to the following questions. Can you answer the following?
Graph Mining: Betweenness Based Clustering: Learn by finding answers to the following questions. Can you answer the following?
What are the types of Betweenness?
What is Vertex Betweenness? i.e. the concept
What is Edge Betweenness? i.e. the concept
Describe Vertex Betweenness? maybe just giving an example
What does Vertex Betweenness clustering achieve? i.e. the output?
Give an Algorithm for Vertex Betweenness Clustering?
What is mu in the Algorithm for Vertex Betweenness Clustering?
Which vertex do you select at each step? i.e. the one with the highest betweenness or the lowest betweenness?
When you select a vertex at each step? Then what do you do (i.e. to create clusters)
Does the selected vertex go to all the clusters created around it?
What is the other name for Edge Betweenness?
Describe Edge Betweenness? maybe just giving an example
What does Edge Betweenness clustering achieve? i.e. the output?
Give an Algorithm for Edge Betweenness Clustering?
What is mu in the Algorithm for Edge Betweenness Clustering?
Which Edge do you select at each step? i.e. the one with the highest betweenness or the lowest betweenness?
When you select an Edge at each step? Then what do you do (i.e. to create clusters)
Does the selected Edge go to all the clusters created around it? or you just cut the graph at that edge and create clusters.
Answers:
Describe Vertex Betweenness? maybe just giving an example
Ans: The total number of shortest paths that pass through the vertex = the Vertex Betweenness for that Vertex. i.e. Among All vertices to all vertices shortest paths.
What is the other name for Edge Betweenness Clustering?
Ans: Girvan & Newman Clustering
What is Edge Betweenness? i.e. the concept
Ans: For a given edge, the number of shortest paths that pass through the edge. (All pairs/nodes to all pairs/nodes shortest paths)
Shop Online: https://www.ShopForSoul.com/
8112223 Canada Inc./JustEtc: http://JustEtc.net
Linkedin: https://ca.linkedin.com/in/sayedjustetc
Courses: http://Training.SitesTree.com (Big Data, Cloud, Security, Machine Learning)
Blog: http://Bangla.SaLearningSchool.com, http://SitesTree.com
