Homework 5 INF 552, Instructor: Mohammad Reza Rajati1. Multi-class and Multi-Label Classification Using Support Vector Machines(a) Download the Anuran Calls (MFCCs) Data Set from: https://archive.ics.uci.edu/ml/datasets/Anuran+Calls+%28MFCCs%29. Choose 70% of the datarandomly as the training set.(b) Each instance has three labels: Families, Genus, and Species. Each of the labelshas multiple classes. We wish to solve a multi-class and multi-label problem.One of the most important approaches to multi-class classification is to train aclassifier for each label. We first try this approach:i. Research exact match and hamming score/ loss methods for evaluating multilabelclassification and use them in evaluating the classifiers in this problem.ii. Train a SVM for each of the labels, using Gaussian kernels and one versusall classifiers. Determine the weight of the SVM penalty and the width ofthe Gaussian Kernel using 10 fold cross validation.1 You are welcome to tryto solve the problem with both standardized 2 and raw attributes and reportthe results.iii. Repeat 1(b)ii with L1-penalized SVMs.3 Remember to standardize4the attributes.Determine the weight of the SVM penalty using 10 fold cross validation.iv. Repeat 1(b)iii by using SMOTE or any other method you know to remedyclass imbalance. Report your conclusions about the classifiers you trained.v. Extra Practice: Study the Classifier Chain method and apply it to the aboveproblem.vi. Extra Practice: Research how confusion matrices, precision, recall, ROC,and AUC are defined for multi-label classification and compute them for theclassifiers you trained in above.2. K-Means Clustering on a Multi-Class and Multi-Label Data SetMonte-Carlo Simulation: Perform the following procedures 50 times, and reportthe average and standard deviation of the 50 Hamming Distances that you calculate.1How to choose parameter ranges for SVMs? One can use wide ranges for the parameters and a finegrid (e.g. 1000 points) for cross validation; however,this method may be computationally expensive. AnaINF 552作業(yè)代做、代寫MFCCs留學(xué)生作業(yè)囚巴、代寫c/c++原在，Java課程作業(yè)、代做Python語(yǔ)言作業(yè) 代做留學(xué)生lternative way is to train the SVM with very large and very small parameters on the whole training dataand find very large and very small parameters for which the training accuracy is not below a threshold (e.g.,70%). Then one can select a fixed number of parameters (e.g., 20) between those points for cross validation.For the penalty parameter, usually one has to consider increments in log(λ). For example, if one found thatthe accuracy of a support vector machine will not be below 70% for λ = 10?3 and λ = 106, one has to chooselog(λ) ∈ {?3, ?2, . . . , 4, 5, 6}. For the Gaussian Kernel parameter, one usually chooses linear increments,e.g. σ ∈ {.1, .2, . . . , 2}. When both σ and λ are to be chosen using cross-validation, combinations of verysmall and very large λ’s and σ’s that keep the accuracy above a threshold (e.g.70%) can be used to determinethe ranges for σ and λ. Please note that these are very rough rules of thumb, not general procedures.2It seems that the data are already normalized.3The convention is to use L1 penalty with linear kernel.4It seems that the data are already normalized.1Homework 5 INF 552, Instructor: Mohammad Reza Rajati(a) Use k-means clustering on the whole Anuran Calls (MFCCs) Data Set (do not splitthe data into train and test, as we are not performing supervised learning in thisexercise). Choose k ∈ {1, 2, . . . , 50} automatically based on one of the methodsprovided in the slides (CH or Gap Statistics or scree plots or Silhouettes) or anyother method you know.(b) In each cluster, determine which family is the majority by reading the true labels.Repeat for genus and species.(c) Now for each cluster you have a majority label triplet (family, genus, species).Calculate the average Hamming distance, Hamming score, and Hamming loss5between the true labels and the labels assigned by clusters.3. ISLR 10.7.24. Extra Practice: The rest of problems in 10.7.5Research what these scores are. For example, see the paper A Literature Survey on Algorithms forMulti-label Learning, by Mohammad Sorower.轉(zhuǎn)自：http://ass.3daixie.com/2019030729243771.html