Clean and prepare the attached data file for use in Weka as an .arff file. Show your steps. (Make sure that the label is in the last column.) Compare class determination using Random Forest and Random Tree. Compare the value of a hold out set to k-fold cross validation for validating the model. Suggest a filter to be used to improve validation results. Explain your answer.. For one model, find the weakest attribute. Explain how you found it. Submit all answers and screen shots in one Word Document named DMFinal1_yourname.

What are the steps involved in accepting all the changes in a document? arrange these in order click edit. click accept or reject. click changes. click accept all.

Which of the following is not contained on the slide show toolbar? a. next button b. slide button c. close button d. pen too

Write a method named addall that could be placed inside the hashintset class. this method accepts another hashintset as a parameter and adds all elements from that set into the current set, if they are not already present. for example, if a set s1 contains [1, 2, 3] and another set s2 contains [1, 7, 3, 9], the call of s1.addall(s2); would change s1 to store [1, 2, 3, 7, 9] in some order. you are allowed to call methods on your set and/or the other set. do not modify the set passed in. this method should run in o(n) time where n is the number of elements in the parameter set passed in.