how you import and prepare the data for modeling and prediction, that is, Steps 6.1-6.3, with date and time (Screenshot 3). 6.4. Decision Tree model 6.4.1. Build a decision tree model using the party library and store your tree in DT (you do not need to set the pruning arguments). 6.4.2. Apply the model to the prediction dataset and store it in R_DT. # now apply the decision tree model to the prediction dataset to predict competitive values R_DT <- predict(DT, Exam1_predict) 6.4.3. How many auctions are predicted to attract bids? You may use summary() to quickly get the answer.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

6.1. Import your datasets and save them as Exam1 and Exam1_predict. 6.2. Check the structure of your datasets using str(). 6.3. Select records and deal with missing values. # filter CURRENCY attribute to limit records of US dollars only Exam1_2 <- Exam1[Exam1$Currency!= 'GBP',] # verify if GBP currency records are removed and missing data issue resolved summary(Exam1_2) str(Exam1_2) # remove the attribute, currency, with one level Exam1New <- subset(Exam1_2, select = -Currency) # Check if the attribute is removed str(Exam1New) # replace the missing data in OpenPrice attribute using the minimal ofOpenPrice Exam1New$OpenPrice[which(is.na(Exam1New$OpenPrice))] <- min(Exam1New$OpenPrice, na.rm=T) #check if missing values are replaced summary(Exam1New) Take a screenshot of your R codes with date and time to show how you import and prepare the data for modeling and prediction, that is, Steps 6.1-6.3, with date and time (Screenshot 3). 6.4. Decision Tree model 6.4.1. Build a decision tree model using the party library and store your tree in DT (you do not need to set the pruning arguments). 6.4.2. Apply the model to the prediction dataset and store it in R_DT. # now apply the decision tree model to the prediction dataset to predict competitive values R_DT <- predict(DT, Exam1_predict) 6.4.3. How many auctions are predicted to attract bids? You may use summary() to quickly get the answer.

Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Eight puzzle problem
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education