Create a random sample of size 1000 from the diamonds data

Assignment Help C/C++ Programming

Reference no: EM132096067

PLEASE HELP ME WITH SOMEONE WHO KNOWS HOW TO USE R.

Load package gcookbook and type data(diamonds) to load the data set.

1. A diamond's quality can be measured by cut, ordered by Ideal, Premium, Very Good, Good, and Fair. Create dummy D1 to represent Ideal and Premium, and D2 to represent Very Good and Good.

2. Regress price on carat, depth, table, D1 and D2, all interactions terms between dummies and quantitative variables (carat, depth and table). Interpret your result

3. Create a random sample of size 1000 from the diamonds data. Draw the scatterplot of carat vs log(price), color coded by cut.

Please explain in detail. What equations I need to input in R.

Reference no: EM132096067

Questions Cloud

Equivalent to ?tting the decision tree without bagging : Suppose we ?t a decision tree using bagging with B bootstrapped training sets. For each of the following

Show the result of inserting all of the elements : Show the result of inserting all of the elements using quadratic probing to resolve collisions. (Place null in the unused locations.)

How will electromycycle choose vendors and interact : How will ElectroMyCycle acquire, configure, and audit computer systems and networks? How will ElectroMyCycle choose vendors and interact with them?

Technological and Strategical planning in New Ventures : Prepare a Mini Research project on the given topic. Topic: Technological and Strategical planning in New Ventures for solving Business start-up issues

Create a random sample of size 1000 from the diamonds data : Create a random sample of size 1000 from the diamonds data. Draw the scatterplot of carat vs log(price), color coded by cut.

Write the following functions for a linked list program : Write the following functions in C++ for a linked list program. Use separate .cpp main file for calling the functions to show they work.

Suggest a subset selection method and a shrinkage : Suggest a subset selection method and a shrinkage method that could be used here.

Analyze the following algorithm s and provide its worst case : When searching an array with 1,048,576 elements, how many comparisons will there be (at most) using binary search?

How many units on average while holding x2 constant : Suppose a multiple regression model is given by y = 4.44X1 -9.29X2 + 39.67. How do I determine what an interpretation of the coefficient of X1 be if X1

User Account

All Pages