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

In this assignment, you will do a series of tutorials followed by a data mining task. You will apply the CRISP-DM data mining technique to your selected domain

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Data Pre-processing and Decision Trees

In this assignment, you will do a series of tutorials followed by a data mining task. You will apply the CRISP-DM data mining technique to your selected domain. Specifically, gain insights into the data, formulate a set of hypothesizes, preprocess your data, and build a decision tree model. This assignment is graded on a scale of 100. For reference, when discussing the data mining process please reference CRISP-DM (shown below). You should submit the final Rapid Miner models. You will also include an analysis document

Step 1: Data preprocessing tutorials

 

Analysis Task: After you have installed RapidMiner, please complete the following data preprocessing tutorials (please note, the datasets you need for the tutorials are included in the RapidMiner download).

 

https://rapidminer.com/data-prep-data-exploration/

 

https://rapidminer.com/many-tools-data-prep-data-quality/

 

Upon completing each tutorial, briefly summarize what you did and discuss how it relates to what we have discussed in class.

 

Step 2: Decision Tree tutorial

 

Analysis Task: Read the following documentation and complete the example at the end of this document: https://docs.rapidminer.com/studio/operators/modeling/predictive/trees/parallel_decision_tree.html

Again, briefly summarize what you did and discuss how it relates to what we have discussed in class.

 

Step 3: Data Understanding

 

Analysis Task: Download and open the Supermarket Transactions dataset. You should go through the dataset and think about each attribute. Then in your analysis document, for each attribute you should give its name, a description, its type (numeric or categorical), if you notice any outliers or missing values, and any other interesting things you notice. You should also address data reduction & attribute reduction. You should also describe the class labels and explain what they mean.

 

 

Step 3: Building your Model – Preprocessing

 

RapidMiner Task: Import your data into Rapid Miner. For each attribute, you should perform appropriate data pre-processing.

 

Analysis Question: For each attribute, describe what sort of data preprocessing that you performed. For each attribute, you should describe and justify your decisions on handling missing data, anomalies, and normalization. (Feel free to explore other operators not demoed in class.) You should also mention if you chose to perform any data reduction. You should include screenshots in your explanation.

 

 

Step 4: Modeling

 

RapidMiner Task: Select and build at least 2 models (e.g. variations of a decision tree). You can build different decision trees by modifying operators/parameters (e.g. changing the splitting criterion, applying or not applying pruning, etc. While it is up to you to decide how you want to build your models, you need to demonstrate that you went through a non-trivial modeling process to receive full credit.

 

Analysis Question: Identify and explain all the work you did in the modeling task. You should justify your decisions. Be sure to include screenshots.

 

Step 6: Reflection

Analysis Question: What did you learn from doing this assignment? Did it impact your perception of how BI techniques can be applied to data? If faced with a similar challenge in the future, how would you change your approach?

(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

896 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

600 Answers

Hire Me
expert
Husnain SaeedComputer science

993 Answers

Hire Me
expert
Atharva PatilComputer science

575 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