Skip to content

Girvan-Newman algorithm for community detection + Page rank algorithm

Notifications You must be signed in to change notification settings

JobinJohan/girvan_newman_cluster

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

34 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Aim:

The aim of this project is to build a tool to identify communities and influencers in a academic network. The tool should be able to:

  • Load social graph
  • Run community detection and centrality methods
  • Visualize the network

Tasks:

1- Load the dataset

2- Implementation

  • Implement Girvan-Newman clustering algorithm till 10th iteration level.
  • Implement Pagerank algorithm.
  • Implement Betweenness centrality measure. Using the previous implementation, perform the following tasks:
  • Use Girvan-Newman algorithm to find clusters of authors.
  • Find the top-10 authors with highest betweenness centrality.

3- Visualization

  • Visualize the output of Girvan-Newman algorithm by coloring nodes according to their assigned groups.
  • Visualize the network and highlight the top 10 authors with the highest betweenness centrality, and top 10 edges with the highest betweenness centrality.

About

Girvan-Newman algorithm for community detection + Page rank algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published