data 2013 06 24

Pagina 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 June 24, 2013 NAME MATRICOLA Solve the following problems and write the answer inside the problem box. Answers must be clearly written. Pencils are not allowed. The final consists of 5 sheets of paper. It must be returned with all the 5 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. Grades Data Mining and Text Mining Problems 1, 2, and 4 (assigning 7, 7, and 5 points) Tecniche di Apprendimento Automatico per Applicazioni di Data Mining Problems 1, 2, 3, and 4 (assigning 9, 9, 9, and 5 points) 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. Perform hierarchical clustering using Single-Link (MIN) on the following similarity matrix below (values are higher when two items are more similar, so p1 and p1 have a similarity of 1) and show the final dendrogram. P1 P2 P3 P4 P5 P1 1.00 0.10 0.41 0.55 0.35 P2 0.10 1.00 0.64 0.47 0.98 P3 0.41 0.64 1.00 0.44 0.85 P4 0.55 0.47 0.44 1.00 0.76 P5 0.35 0.98 0.85 0.76 1.00 Problem 2. You have run the a-priori algorithm to find association rules in a grocery store transaction database. It takes an unexpectedly…