Laboratory I:

         

To download additional .arff data sets go to:

http://www.hakank.org/weka/

or search the Internet for .arff files required

· What’s the difference between a “training set” and a “test set”?

· Why might a pruned decision tree that doesn’t fit the data so well be better than an un-pruned one?

· What’s the first thing that 1R does when making a rule based on a numeric attribute?

· How does 1R avoid overfitting when making a rule based on an enumerated and/or numeric attribute?

· What is the difference between Attribute, Instance and Training set? 

• What      is the difference between ID3 and C4.5?

1. Use the following learning      schemes to analyze the iris data (in iris.arff): 

  

OneR

– weka.classifiers.OneR

 

Decision table

– weka.classifiers.DecisionTable -R

 

C4.5

– weka.classifiers.j48.J48

· Do the decisions made by the classifiers make sense to you? Why?

· What can you say about the accuracy of these classifiers? When classifying iris that has not been used for training? 

· How did each one of the methods perform?

1. Use the following learning      schemes to analyze the bolts data (bolts.arff without the TIME attribute):      

  

Decision Tree

– weka.classifiers.j48.J48

 

Decision table

– weka.classifiers.DecisionTable -R

 

Linear regression

– weka.classifiers.LinearRegression

 

M5′ 

– weka.classifiers.M5′

· The dataset describes the time needed by a machine to produce and count 20 bolts. (More details can be found in the file containing the dataset.) 

· Analyze the data. What adjustments have the greatest effect on the time to count 20 bolts? 

· According to each classifier, how would you adjust the machine to get the shortest time to count 20 bolts?

1. Produce      a model for both Weather and Weather.nominal data sets. Which method(s) did you use? What did      the tree(s) look like?

Laboratory II:

 

To download additional .arff data sets go to:

weka data folder for

BreastTumor.arff

http://www.hakank.org/weka/

zoo.arff, wine.arff, bodyfat.arff, sleep.arff, pollution.arff

1. Use the following learning schemes to analyze the zoo      data (in zoo.arff): 

  

OneR

– weka.classifiers.OneR

 

Decision table

– weka.classifiers.DecisionTable -R

 

C4.5

– weka.classifiers.j48.J48

 

K-means

– weka.clusterers.SimpleKMeans

Try using reduced error pruning for the C4.5. Did it change the produced model? Why? 

For K-means, for the first run, set k=10. Adjust as needed. What was the final number of k? Why?

1. Use the following learning schemes to analyze the      breast tumor data. 

  

Linear regression

– weka.classifiers.LinearRegression

 

M5′ 

– weka.classifiers.M5′

 

Regression Tree

– weka.classifiers.M5′

 

K-means clustering

– weka.clusterers.SimpleKMeans

A) How many leaves did the Model tree produce? Regression Tree? What happens if you change the pruning factor? 

How many clusters did you choose for the K-means method? Was that a good choice? Did you try a different value for k?

B) Now perform the same analysis on the bodyfat.arff data set.

1. Use a      k-means clustering technique to analyze the iris data set. What did you      set the k value to be? Try several different values. What was the random seed value?      Experiment with different random seed values. How did changing of these values      influence the produced models?
2. Produce      a hierarchical clustering (COBWEB) model for iris data. How many clusters did it produce? Why?      Does it make sense? What did you expect?

Change the acuity and cutoff parameters in order to produce a model similar to the one obtained in the book. Use the classes to cluster evaluation – what does that tell you?

Laboratory III:

 

To download additional .arff data sets go to:

http://www.hakank.org/weka/

zoo.arff, wine.arff, soybean.arff, zoo2_x.arff, 

sunburn.arff, disease.arff

8. Use the following learning schemes to compare the training set and 10-fold stratified cross-validation scores of the disease data (in disease.arff): 

  

Decision table

– weka.classifiers.DecisionTable -R

 

C4.5

– weka.classifiers.j48.J48

 

Id3

– weka.clusterers.Id3

A) What does the training set evaluation score tell you? 

B) What does the cross-validation score evaluate? 

C) Which one of these models would you say is the best? Why?

9. Use the following learning schemes to analyze the wine data (in wine.arff). 

  

C4.5

– weka.classifiers.j48.J48

 

Decision List

– weka. classifiers.PART

A) What is the most important descriptor (attribute) in wine.arff?

B) How well were these two schemas able to learn the patterns in the dataset? How would you quantify your answer?

C) Compare the training set and 10-fold cross-validations scores of the two schemas.

D) Would you trust these two models? Did they really learn what is important for proper classification of wine?

E) Which one would you trust more, even if just very slightly?

10. Perform the same analysis of sunburn.arff as in 2. Instead of 10-fold cross-validations use 5-fold.

A)-E) Same as in 2.

F) Why could not we use 10-fold evaluation in this example?

11. Choose one of the following three files: soybean.arff, zoo.arff or zoo2_x.arff and use any two schemas of your choice to build and compare the models.

  

Implement a dictionary using a Bag—Project 4.7 in the text (modified)

Use the bag ADT provided to create an array-based implementation for bags. Then use your bag to implement the dictionary ADT provided you. This means you have to implement your dictionary using the bag functions.

Test your bag and dictionary implementations with the bagtestmain.cpp file I’ve provided for you. If you are not able to fully implement all the functions of the dictionary and/or bag, you may modify the tests in bagtestmain.cpp to only exercise those functions you were able to complete.

You will only get credit for those methods you test and display, so be sure you don’t leave any out. 

Also, you cannot add any public functions to your bag and dictionary implementations beyond those specified in the ADTs, though you may add private functions if you want.

Put the following files into a zip file named student_name_Bag_Assignment and submit them to Blackboard:

– ABag.h   // Your bag-array implementation which must inherit the Bag class

– BDictionary.h  // Your Dictionary-bag implementation which must inherit the   // Dictionary class

– bagtestmain.cpp  // The test driver I have provided for you

– bagADT.h // The bag ADT I gave you – it should be unchanged

– dictionaryADT.h // The dictionaryADT I gave you – it should be unchanged

– kvpair.h // The kvpair class I gave you – it should be unchanged

– Screen Shots   // Word document with screen shot(s) and integrity statements showing
 // all of your program’s output.
Approach.doc // This is a Word document where you explain how you implemented
 // your solution and how you tested each required function.

– Any other .cpp and/or .h files that comprise your project (I need all the .cpp and .h files used in your project).

– Your_dictionary.exe //Your executable file.***

Note: If your ABag does not inherit Bag and/or BDictionary does not inherit Dictionary, you will not receive any credit for your work. If you use the templates I’ve provided (ABag.h and BDictionary.h) the inheritance is already done for you.

*** If you completed your assignment using Visual Studios you must use Visual Studios 2017 and I would like you to submit your entire VS project directory.

Your test program must exercise every function of the dictionary. For any function whose functionality is not obvious you must explain in your Word document how your test output demonstrates that function. See me if you have questions.

See Blackboard for the assignment due date and the syllabus for the late policy.

                    Rubrics (for the 70% content portion):

– Program must run in order to get any points. By “run” I mean that you must at least get one or more of the bag methods working (and your program must demonstrate that functionality).

Tips for Success

Start by working on your “Approach” first. Once you are satisfied with your approach, then start building your program incrementally. Start with the bag and increment one feature at a time (you’ll have to stub out the features the ADT requires that you are not ready to implement yet) starting with the constructors and then working your way down the feature list using common sense to figure out which features need to be implemented first. Try your bag out with the various parameter combinations I want you to test with (<int, string> and <string, int>). When you are satisfied the bag is working then move on to the dictionary, again implementing and testing function by function.

Don’t wait until the last minute. You’ll find that many of your problems you will solve while you are away from your computer and have a chance to think about the error you are seeing. This takes time. 

Note: KVpair, which uses the == operator for comparing the key values, will only accept objects that have also implemented the == operator. This class has been tested with the following types:

§ string

§ int

It specifically does not work with the Int type (at least not in the version of C++ I am working with).

Debugging your code

A big part of this assignment is debugging your code, so do not expect your instructor to do this for you. Having completed the pre-requisite courses for this class, you should already have some experience finding coding errors and fixing them. This class will give you plenty of opportunities to further refine those skills and you can only do that by wrestling with the problem. Here are some debugging tips:

· Build a little, test a little. Don’t write all your code before you start debugging it. Break your work into logical chunks that can be compiled and debugged and build them one at a time. For this project, I would start by building the Bag class and implementing the addItem() function first. Once I get that function working properly, then I would move on to another Bag function. The idea is you build and test a function one function at a time. That way, if you run into an error, you know where to look.

· Learn to use the debugger if you haven’t already. The debugger allows you to step through your code one step and a time and see what happens in memory while you’re doing it. When students come to me with problems, I first try to isolate where the problem is logically based on what the program is doing and then I use the debugger to find the actual fault. Here is an excellent video tutorial on the Visual Studios debugger: How to DEBUG C++ in VISUAL STUDIO.

· Be willing to walk away from your computer and give your mind a rest. I find that the solution to a problem often comes to me while I am doing something else. I have never regretted stepping away from my computer to let the problem “percolate” in my mind, but I have often regretted not doing this. This is one of the reasons you should never wait till the last minute to start working on your program; by doing that you are not giving yourself the time to walk away.

  

Implement a dictionary using a Bag—Project 4.7 in the text (modified)

Use the bag ADT provided to create an array-based implementation for bags. Then use your bag to implement the dictionary ADT provided you. This means you have to implement your dictionary using the bag functions.

Test your bag and dictionary implementations with the bagtestmain.cpp file I’ve provided for you. If you are not able to fully implement all the functions of the dictionary and/or bag, you may modify the tests in bagtestmain.cpp to only exercise those functions you were able to complete.

You will only get credit for those methods you test and display, so be sure you don’t leave any out. 

Also, you cannot add any public functions to your bag and dictionary implementations beyond those specified in the ADTs, though you may add private functions if you want.

Put the following files into a zip file named student_name_Bag_Assignment and submit them to Blackboard:

– ABag.h   // Your bag-array implementation which must inherit the Bag class

– BDictionary.h  // Your Dictionary-bag implementation which must inherit the   // Dictionary class

– bagtestmain.cpp  // The test driver I have provided for you

– bagADT.h // The bag ADT I gave you – it should be unchanged

– dictionaryADT.h // The dictionaryADT I gave you – it should be unchanged

– kvpair.h // The kvpair class I gave you – it should be unchanged

– Screen Shots   // Word document with screen shot(s) and integrity statements showing
 // all of your program’s output.
Approach.doc // This is a Word document where you explain how you implemented
 // your solution and how you tested each required function.

– Any other .cpp and/or .h files that comprise your project (I need all the .cpp and .h files used in your project).

– Your_dictionary.exe //Your executable file.***

Note: If your ABag does not inherit Bag and/or BDictionary does not inherit Dictionary, you will not receive any credit for your work. If you use the templates I’ve provided (ABag.h and BDictionary.h) the inheritance is already done for you.

*** If you completed your assignment using Visual Studios you must use Visual Studios 2017 and I would like you to submit your entire VS project directory.

Your test program must exercise every function of the dictionary. For any function whose functionality is not obvious you must explain in your Word document how your test output demonstrates that function. See me if you have questions.

See Blackboard for the assignment due date and the syllabus for the late policy.

                    Rubrics (for the 70% content portion):

– Program must run in order to get any points. By “run” I mean that you must at least get one or more of the bag methods working (and your program must demonstrate that functionality).

Tips for Success

Start by working on your “Approach” first. Once you are satisfied with your approach, then start building your program incrementally. Start with the bag and increment one feature at a time (you’ll have to stub out the features the ADT requires that you are not ready to implement yet) starting with the constructors and then working your way down the feature list using common sense to figure out which features need to be implemented first. Try your bag out with the various parameter combinations I want you to test with (<int, string> and <string, int>). When you are satisfied the bag is working then move on to the dictionary, again implementing and testing function by function.

Don’t wait until the last minute. You’ll find that many of your problems you will solve while you are away from your computer and have a chance to think about the error you are seeing. This takes time. 

Note: KVpair, which uses the == operator for comparing the key values, will only accept objects that have also implemented the == operator. This class has been tested with the following types:

§ string

§ int

It specifically does not work with the Int type (at least not in the version of C++ I am working with).

Debugging your code

A big part of this assignment is debugging your code, so do not expect your instructor to do this for you. Having completed the pre-requisite courses for this class, you should already have some experience finding coding errors and fixing them. This class will give you plenty of opportunities to further refine those skills and you can only do that by wrestling with the problem. Here are some debugging tips:

· Build a little, test a little. Don’t write all your code before you start debugging it. Break your work into logical chunks that can be compiled and debugged and build them one at a time. For this project, I would start by building the Bag class and implementing the addItem() function first. Once I get that function working properly, then I would move on to another Bag function. The idea is you build and test a function one function at a time. That way, if you run into an error, you know where to look.

· Learn to use the debugger if you haven’t already. The debugger allows you to step through your code one step and a time and see what happens in memory while you’re doing it. When students come to me with problems, I first try to isolate where the problem is logically based on what the program is doing and then I use the debugger to find the actual fault. Here is an excellent video tutorial on the Visual Studios debugger: How to DEBUG C++ in VISUAL STUDIO.

· Be willing to walk away from your computer and give your mind a rest. I find that the solution to a problem often comes to me while I am doing something else. I have never regretted stepping away from my computer to let the problem “percolate” in my mind, but I have often regretted not doing this. This is one of the reasons you should never wait till the last minute to start working on your program; by doing that you are not giving yourself the time to walk away.

In your own words Respond to the following in 175 words:

In the last few decades, computers have made significant changes in how people live and work. These advancements have improved multiple industries, such as education and health care.

Identify 1 to 2 significant advancements in computers or computer systems in the last 10 to 15 years. Provide an example of how these advancements support different industries. How have these changes improved the way we work?

NO PLAGIARISM

NO CHAT GPT

NO AI

SITE REFERENCES