2013 07 01

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 July 1, 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, 3, 4 and 5 Tecniche di Apprendimento Automatico per Applicazioni di Data Mining Problems 1, 2, 3, 4 and 5 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. Apply the OneRule algorithm to the dataset below. For the sake of brevity don’t take intro account the attribute “Spectacle prescription” and only consider the attributes “Age”, “Astigmatism”, “Tear production rate”, and the class “Recommended lenses”. Problem 2. Suppose we clustered a set of N data points using two different clustering algorithms: k-means and EM. In both cases we obtained 5 clusters and in both cases the centers of the clusters are exactly the same. Can 3 points that are assigned to different clusters in the k- means solution be assigned to the…