logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Download the dataset datamining.xlsx from LMS. This dataset contains 2,000 cases. This dataset is to be used to predict whether a person in an MIS program will like a data mining course or not.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Problem 1. Download the dataset datamining.xlsx from LMS. This dataset contains 2,000 cases. This dataset is to be used to predict whether a person in an MIS program will like a data mining course or not. The fields for each of the 2000 records are as below:

  • GMAT: GMAT score of a student
  • Bachelor: Field of BS degree (A: Arts, S: Science, E: Engineering)
  • Quant, Stats, HBO, Acct: Course rating of the student for each of the courses from 1 (lowest) to 5 (highest)
  • E-comm: Flag that is T if student intends to specialize in e-commerce, F otherwise
  • Datamine: Course rating of the student for Data Mining
  • LikeDM: Flag that is T if course rating for Data Mining is 4 or 5; F otherwise (note that this attribute is derived from “Datamine” attribute, so you should eliminate “Datamine” from exploration and modeling).

Using RapidMiner, please answer the following questions. A sample process is provided as a starter.

  1. [20 points] Use the entire data (datamining.xlsx) and explore the relationship between LikeDM and each individual field. What effect does each field seem to have on LikeDM? You can use scatterplots and histograms to explore the relationships and show only what seems to be important relations.

 

  1. [25 points] Split the data into 65% for training and 35% for testing using Split Validation operator. Click on the operator and change random seed value to “12345”. Create a Decision Tree (ModelingàPredictiveàTreeàDecision Tree) and make sure to get 100% accuracy on training To do this, set criterion to gini index, set the tree depth to high number (2000) and uncheck “apply pruning” and “apply prepruning,” then answer the following:

 

  1. What is the depth of the tree?

 

 

  1. How many leaves (decision nodes) does it have?

 

 

  1. What is the accuracy of the testing data, and why is it not 100%?

 

 

  1. [15 points] Now change the settings of the decision tree model as follows, then answer the questions:
    • Click on the decision tree and choose criterion to “information_gain” and set maximum depth to 8.
    • Check “apply prepruning” and set minimal gain to 0.01, minimal leaf size to 2, and minimal size for split to 4 (leave other options as is).

 

  1. What is the accuracy of training and testing?

 

 

  1. Provide two strongest If-Then rules from this decision tree. Please explain why these rules are chosen.

 

 

 

  1. [15 points] Try to improve the performance of the decision tree model by changing the decision tree parameters (you can change tree depth, type of criterion, or minimal size of leaf or split). What is the performance of the tree you created (both training and testing) and what have you changed in the tree settings? Produce at least two (2) different models.

 

 

 

  1. [10 points] Use the models developed above to compare between their performance by filling the table provided. Which model is the best? Why?

 

Configuration

Training

Testing

Difference

Model 1. First (Overfitting) from b)

 

 

 

Model 2. from c)

 

 

 

Model 3. from d)

 

 

 

Model 4. from d)

 

 

 

 

 

 

 

           

 

  1. [15 points] Use the models developed above to compare between their performance by creating gain chart, lift chart, and response chart.
    1. Now, which model is the best? Why?
    2. How can this model (the best model) be used by school officials?
(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

578 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

735 Answers

Hire Me
expert
Husnain SaeedComputer science

763 Answers

Hire Me
expert
Atharva PatilComputer science

891 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30