Back to Multiple and logistic regression

Exercise 23

Avg difficulty 3.0

Spam filtering, Part II. In Exercise 9.21, we encountered a data set where we applied logistic regression to aid in spam classification for individual emails. In this exercise, we’ve taken a small set of these variables and fit a formal model with the following output:

Estimate Std. Error z value Pr(>>∣|z∣|)
(Intercept) -0.8124 0.0870 -9.34 0.0000
to_ multiple -2.6351 0.3036 -8.68 0.0000
winner 1.6272 0.3185 5.11 0.0000
format -1.5881 0.1196 -13.28 0.0000
re_ subj -3.0467 0.3625 -8.40 0.0000
  1. Write down the model using the coefficients from the model fit.

  2. Suppose we have an observation where to_multiple=0\texttt{to\_\hskip 0.85358pt{}multiple}=0, winner=1\texttt{winner}=1, format=0\texttt{format}=0, and re_subj=0\texttt{re\_\hskip 0.85358pt{}subj}=0. What is the predicted probability that this message is spam?

  3. Put yourself in the shoes of a data scientist working on a spam filter. For a given message, how high must the probability a message is spam be before you think it would be reasonable to put it in a spambox (which the user is unlikely to check)? What tradeoffs might you consider? Any ideas about how you might make your spam-filtering system even better from the perspective of someone using your email service?

Diez, Barr & Çetinkaya-Rundel, OpenIntro Statistics, Multiple and logistic regression, End-of-Chapter Exercises, Exercise 23

AI Tutor

Adapted from OpenIntro Statistics © 2019 David Diez, Mine Çetinkaya-Rundel & Christopher D. Barr. Licensed under CC BY-SA 3.0. Source: OpenIntro Statistics. Imported at revision fee2509.