15-826, S'16 - C. Faloutsos Partial-credit grading scheme (by C. Faloutsos and all TAs) [60pts] Experiment with various index options (a) [-20 points]: No time proof. (b) [-10 points]: No analysis about the graphs on which the experiments are running. (c) Index choices: cluster index on source, non-cluster index on dist, composite index on source and dist. Ordering choices: pagerank, coreness, or by the 'slash-N-burn' etc. And there are 5 graphs. Overall there are more than 60 combinations. To get full score, need at least do experiments on 5 combinations. (one-person team: at least 3 combinations) To get 80% of full score, need at least do experiments on 3-4 combinations. (one-person team: 70% of score for 1-2 combinations) To get 50% of full score, need at least do experiments on 1-2 combinations. (d) 50%, 70%, 80%, 90%, 100% based on number of graphs 1,2,3,4,5 respectively. (e) Product of the above two criteria is final score. [40pts] Algorithms and indexing procedures of choice, output of graphminer (a) [-2 points]: for the distribution plots (such as degree distribution), failed to use log scale (b) [-6 points]: Only list the results of running the graph miner, failed to put any observations (such as, which nodes deviate the power-law, which nodes are suspicious, etc.) (c) [-10 points]: No plots. (d) [-10 points]: No analysis on any graphs. (e) Graph results may cover pagerank, k-core values, degree distributions, scatter plots, corner-radius etc. (one-person team: share the same rubrics) To get full score, for each graph, need at least cover 3 of above choices. To get 80% of full score, for each graph, need at least cover 2 of above choices. To get 50% of full score, for each graph, need at least cover 1 of above choices.