A github repository for Master thesis of the University of Queensland
- Louvain Algorithm
- Text clustering by TF-IDF and agglomerative clustering
- Louvain Algorithm on a weighted graph, where the weights are the cosine similarities of TF-IDF
- Create your app on Twitter and get your tokens, then fill in the variables in twitter_client.py
- Install MongoDB, open the terminal, run "mongod" to start the MongoDB server
- Run network/get_list_members.py to collect the informaiton of users (users must be in a list)
- Run network/get_links.py to get the relationship of users
- Run the function louvain_unweighted() in network/Louvain.py
- A csv file for the network is generated and it can be used in Gephi
- Run text/get_timeline.py to collect Tweets
- Run text/text_mining.py
- Run network/get_list_members.py collect the informaiton of users
- Run text/get_timeline.py to collect Tweets
- Run the function louvain_weighted() in network/Louvain.py
- A csv file for the network is generated and it can be used in Gephi
There are several names of lists and the name of MongoDB collections and if you want to apply to your cases you need to change them.