2015 04 29

Page 1

Politecnico di Milano Facoltà di Ingegneria dell’Informazione Data Mining and Text Mining Tecniche di Apprendimento Automatico Prof. Pier Luca Lanzi & Ing. Daniele Loiacono April 29, 2015 NAME MATRICOLA Solve the following problems and write the answer inside the problem box. Answers must be clearly written. Pencils are not allowed. The midterm consists of 3 sheets of paper. It must be returned with all the 3 sheets. No any other sheet can be added. No sheet can be removed. This is a closed-book, closed-notes exam. Only non-programmable calculators are allowed. Notes/books/mobile phones are not allowed. If you are caught using forbidden material, the exam will immediately end and an RP grade will be recorded; then, your Data Mining exam will consist of an oral examination from then on. All the answers must be adequately motivated. Grades The image cannot be displayed. Your computer may not have enough memory to open the image, or the image may have been corrupted. Restart your computer, and then open the file again. If the red x still appears, you may have to delete the image and then insert it again. Problem 1. Consider a set of six data points (A, B, C, D, E and F) and the distance matrix computed using the Manhattan distance. A B C D E F A | 0 | B | 2 0 | C | 1 1 0 | D | 7 5 6 0 | E | 8 6 7 1 0 | F | 5 3 4 2 3 0 | 1. Apply hierarchical clustering using the single link (or MIN) approach to measure distance between clusters and show the final dendrogram. 2. What would be a good clustering? Explain why. Problem 1. (continued) Problem 2. Given the data set below and a min support of 3/8 (1) extract all the frequent itemsets using the eclat algorithm and (2) list the closed and maximal frequent itemsets. 238 Itemset Mining Table 8.2.Transaction database for Q1 tid…