View source for Machine--learning-TDSM

= Machine Learning =


'''Classification'''

<br>11-1.
Using the Naive Bayes classifier of Figure 1.2, decide whether (Cloudy,High, Normal) and (Sunny,Low,High) are beach days.

[[TDSM 11.1|(Solution 11.1)]]

<br>11-3.
What is regularization, and what kind of problems with machine learning does it solve?

[[TDSM 11.3|(Solution 11.3)]]


'''Decision Trees'''

<br>11-5.
Suppose we are given an \\(n \times d\\) labeled classification data matrix, where each item has an associated label <i>class A</i> or <i>class B</i>. Give a proof or a counterexample to each of the statements below:
<ol type="a">
<li>Does there always exist a decision tree classifier which perfectly separates <i>A</i> from <i>B</i>?</li>
<li>Does there always exist a decision tree classifier which perfectly separates <i>A</i> from <i>B</i> if the <i>n</i> feature vectors are all distinct?</li>
<li>Does there always exist a logistic regression classifier which perfectly separates <i>A</i> from <i>B</i>?</li>
<li>Does there always exist a logistic regression classifier which perfectly separates <i>A</i> from <i>B</i> if the <i>n</i> feature vectors are all distinct?</li>
</ol>

[[TDSM 11.5|(Solution 11.5)]]


'''Support Vector Machines'''

<br>11-7.
Give a linear-time algorithm to find the maximum-width separating line in one dimension.

[[TDSM 11.7|(Solution 11.7)]]

<br>11-9.
Suppose we use support vector machines to find a perfect separating line between a given set of <i>n</i> red and blue points. Now suppose we delete all the points which are not support vectors, and use SVM to find the best separator of what remains. Might this separating line be different than the one before?

[[TDSM 11.9|(Solution 11.9)]]


'''Neural Networks'''

<br>11-11.
Specify the network structure and node activation functions to enable a neural network model to implement logistic  regression.

[[TDSM 11.11|(Solution 11.11)]]


'''Implementation Projects'''

<br>11-13.
Experiment with different discounting methods estimating the frequency of words in English. In particular, evaluate the degree to which frequencies on short text files (1000 words, 10,000 words, 100,000 words, and 1,000,000 words) reflect the frequencies over a large text corpora, say, 10,000,000 words.

[[TDSM 11.13|(Solution 11.13)]]


'''Interview Questions'''

<br>11-15.
What is deep learning? What are some of the characteristics that distinguish it from traditional machine learning

[[TDSM 11.15|(Solution 11.15)]]

<br>11-17.
How would you come up with a program to identify plagiarism in documents?

[[TDSM 11.17|(Solution 11.17)]]


'''Kaggle Challenges'''

<br>11-19.
Did a movie reviewer like or dislike the film?
https://www.kaggle.com/c/sentiment-analysis-on-movie-reviews

[[TDSM 11.19|(Solution 11.19)]]