ML Coursera Assignments
ML Coursera Assignments
1.Question 1
A computer program is said to learn from experience E with
respect to some task T and some performance measure P if its
performance on T, as measured by P, improves with experience E.
Suppose we feed a learning algorithm a lot of historical weather
data, and have it learn to predict weather. In this setting, what is T?
The process of the algorithm examining a large amount of historical weather data.
The probability of it correctly predicting a future date's weather.
-->>The weather prediction task.
None of these.
2.Question 2
Regression
--->>Classification
3.Question 3
Suppose you are working on stock market prediction, Typically
tens of millions of shares of Microsoft stock are traded
(i.e., bought/sold) each day. You would like to predict the
number of Microsoft shares that will be traded tomorrow.
Would you treat this as a classification or a regression problem?
-->>Regression
Classification
4.Question 4
Some of the problems below are best addressed using a supervised
learning algorithm, and the others with an unsupervised
learning algorithm. Which of the following would you apply
supervised learning to? (Select all that apply.) In each case, assume some
appropriate
dataset is available for your algorithm to learn from.
-->>In farming, given data on crop yields over the last 50 years, learn to predict
next year's crop yields.
Given a large dataset of medical records from patients suffering from heart
disease, try to learn whether there might be different clusters of such patients
for which we might tailor separate treatments.
-->>Examine a web page, and classify whether the content on the web page should be
considered "child friendly" (e.g., non-pornographic, etc.) or "adult."
Given data on how 1000 medical patients respond to an experimental drug (such as
effectiveness of the treatment, side effects, etc.), discover whether there are
different categories or "types" of patients in terms of how they respond to the
drug, and if so what these categories are.
5.Question 5