LFD Book Forum

LFD Book Forum (http://book.caltech.edu/bookforum/index.php)
-   Chapter 1 - The Learning Problem (http://book.caltech.edu/bookforum/forumdisplay.php?f=108)
-   -   Exercise 1.2 (http://book.caltech.edu/bookforum/showthread.php?t=4655)

ntvy95 02-05-2016 12:39 AM

Exercise 1.2
 
Here is my answer to Exercise 1.2 but I'm not sure if it is correct? My vocabulary is weak so I will express my logic only, I'm sorry about that.

a) Keywords that will end up with a large positive weight are the keywords indicating spam message with large frequency.

b) Keywords that do not indicate spam message will get a negative weight.

c) It's w0 right?

MaciekLeks 02-05-2016 07:58 AM

Re: Exercise 1.2
 
Quote:

Originally Posted by ntvy95 (Post 12256)
a) Keywords that will end up with a large positive weight are the keywords indicating spam message with large frequency.

I wouldn't say that. I would say that a large positive weight is reserved for a spam keyword (e.g. 'buy') which has a low frequency in a message, but should have a big impact on the classifier.

ntvy95 02-05-2016 11:47 PM

Re: Exercise 1.2
 
Quote:

Originally Posted by MaciekLeks (Post 12258)
I wouldn't say that. I would say that a large positive weight is reserved for a spam keyword (e.g. 'buy') which has a low frequency in a message, but should have a big impact on the classifier.

Ah right, thank you very much. :D


All times are GMT -7. The time now is 05:21 PM.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.