| 1. (20 pts] Consider the following document-term matrix containing raw term frequencies (download in CSV or as Excel Spreadsheet). T1 T2 T3 T4 T5 T6 T7 T8 Doc1 2 0 4 3 0 1 0 2 Doc2 0 2 4 0 2 3 0 0 Doc3 4 0 1 3 0 1 0 1 Doc4 0 1 0 2 0 0 1 0 Doc5 0 0 2 0 0 4 0 0 1 1 0 2 1 3 Doc7 2 1 3 4 0 2 0 2 CI Doch a. Construct a term-term distance matrix using Euclidean distance as the measure. b. Determine the binary term relationship matrix using a distance threshold of 4.00, and then construct the graph corresponding to this matrix. Note: there should be an edge between each pair of nodes whose Euclidean distance is less than or equal to 4.00. c. Using the above graph, perform clustering based on the Clique algorithm. d. Using the above graph, perform clustering based on the Single Link algorithm. | 1. (20 pts] Consider the following document-term matrix containing raw term frequencies (download in CSV or as Excel Spreadsheet). T1 T2 T3 T4 T5 T6 T7 T8 Doc1 2 0 4 3 0 1 0 2 Doc2 0 2 4 0 2 3 0 0 Doc3 4 0 1 3 0 1 0 1 Doc4 0 1 0 2 0 0 1 0 Doc5 0 0 2 0 0 4 0 0 1 1 0 2 1 3 Doc7 2 1 3 4 0 2 0 2 CI Doch a. Construct a term-term distance matrix using Euclidean distance as the measure. b. Determine the binary term relationship matrix using a distance threshold of 4.00, and then construct the graph corresponding to this matrix. Note: there should be an edge between each pair of nodes whose Euclidean distance is less than or equal to 4.00. c. Using the above graph, perform clustering based on the Clique algorithm. d. Using the above graph, perform clustering based on the Single Link algorithm