noah/Network-Clustering
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update Readme

Browse Source
This commit is contained in:
Noah L. Schrick 2022-03-21 22:33:54 +00:00
parent 9a0138184f
commit 73b6863e1d
1 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -1,3 +1,11 @@
# CS-7863-HW3 # CS-7863-HW3
Network Clustering using Laplace spectral clustering, Newman modularity, recursive Newman modularity, TOM, dynamic tree cut, and UMAP. Network Clustering using Laplace spectral clustering, Newman modularity, recursive Newman modularity, TOM, dynamic tree cut, and UMAP.
1. Return cluster membership based on the Laplace spectral clustering algorithm for a single split of a network.
2. Implement Newman modularity with a B matrix for a single split of a network.
3. Run the recursive Newman modularity algorithm and discuss the difference between the predicted clusters and the actual Factions.
4. Perform hierachical clustering with Topological Overlap Matrix (TOM) and WGCNA dynamic tree cut.
5. Test UMAP on a network with its distance matrix.
6. Compare the clustering methods.