|
|
Assignment 1 : For the given Dataset,fiond the number of frequent itemsets using Minimum support of 0.06, 0.07, 0.08, 0.1, 0.2, 0.4, 0.6, 0.8 and 1.0. Compare the Running times of APRIRORI and FP TREE based Algorithms for generating Frequent Itemsets. Also Find the number of Associations rules that can be formed if the minimum support of the Rule is 0.1, 0.2, 0.4, 0.6, 0.8 and 1.0 Assignment 2 : For the given dataset , Compare the Performance of RANDOM FOREST and ADABOOST Algorithm. Assignment 3 : Study the performance of CLARANS algorithm with respect to the parameters Nt and Nmax.and find out the performance on the 3 Synthetic datasets. Create the dataset using the method as specified in the Bradley's paper on ' Large dataset synthesis' Assignment 4 : Implement the Algorithm given in "FAUL & TIPPING's" paper . And test it on the given dataset. |
