This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (b) Compare the algorithms using enron2.txt: i. plot performance vs. density threshold for dierent algorithms ii. plot clustering coecient vs. number of nodes deleted (up to top 10%) for dierent algorithms [Figure 5b in the paper] iii. discuss the relative performance of dierent algorithms 6. Implementation: (a) use one of these programming languages: C, C++, Java, or LISP. (b) input le: a le for vertices and edges (c) two modules: i. BridgeCut: input graph; output: top edge/vertex when it is removed for each cluster, output vertices in the cluster ii. Evaluate: input vertices and cluster membership; output performance 7. Submission: (a) source code (b) your data set (c) report in pdf (d) README.txt (how to compile and run your program on code.t.edu)...
View Full Document
This note was uploaded on 02/10/2012 for the course CSE 5800 taught by Professor Staff during the Fall '09 term at FIT.
- Fall '09