← Indietro
EsameEsame completoTesto d’esame

2014 02 14

Esame completo di Data Mining and Text Mining per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Data Mining and Text MiningEsame completo

Informazioni sul documento

Cosa trovi in questo materiale

Esame completo di Data Mining and Text Mining per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Qualità dell’importazione: il testo è stato estratto direttamente dal documento originale.

Contenuti estratti dal documento

Passaggi rappresentativi riconosciuti nelle diverse parti del materiale. Il testo completo resta presente nella pagina per la ricerca, mentre l’anteprima compatta rende più semplice la lettura.

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 February 14, 2014 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 4 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 k-means clustering with k=3 to the following dataset: Income Seniority 145 9 152 11 57 21 54 20 147 32 144 33 82 31 feel free to use the distance you prefer. Do you think it would be reasonable to apply any kind of preprocessing to this dataset? If no, why not. If yes, which one do you think it would be better? Problem 2. Build the decision tree for the following dataset using information gain: True or False: Two different decision trees that both correctly classify a set of training examples, will also classify any other testing example in the same way…

Anteprima

Prima pagina del documento.

Prima pagina: 2014 02 14