Hacker News new | ask | show | jobs
Show HN: Naive Bayes classifier for text categorization in five steps (towardsdatascience.com)
7 points by gchavez2 2665 days ago
3 comments

This is not a bad explanation but when doing this practically it can be useful to take log() of the probabilities so that you work with sums of logs rather than multiplying small floats.

http://getpopfile.org/docs/faq:bayesandlogs

Thank you for the insight John, I have included your remark on the article.
From the article:

    For an English spam classifier that
    considers all the words in the English
    language, the number of the words (n)
    is approximately 171,476.
That's a remarkably precise number to be preceded by the word "approximately".
Agree, that was odd, it now reads:

"the number of the words (n) is approximately 170k"

Thank you for the remark.

Nice article, very glad to read it. Keep up the good work.
Thank you Victor, I enjoyed your JS articles too!