naive bayesian spam filter question

I am planning to implement spam filter using Naive Bayesian classification model.

Online I see a lot of info on Naive Bayesian cla开发者_运维问答ssification, but the problem is its a lot of mathematical stuff, than clearly stating how its done. And the problem is I am more of a programmer than a mathematician (yes I had learnt Probability and Bayesian theorem back in school, but out of touch for a long long time, and I don't have luxury of learning it now (Have nearly 3 weeks to come-up with a working prototype)).

So if someone can explain or point me to location where its explained for programmers than a mathematician, it would be a great help.

PS: By the way I have to implement it in C, if you want to know. :(

Regards, Microkernel

The book Programming Collective Intelligence has chapter that covers this and other methods. The chapter (#6) can be understood without reference to previous chapters, is written clearly, and discusses only the minimal mathematics necessary to get the job done.

You could try this website. It's got some source code.

I would highly recommend Andrew Moore's tutorials and I think you should start with this one.

You could also take a look at POPFile, an open source spam filter engine.

Have you looked at dspam?

http://dspam.irontec.com/faq.shtml#1.0

http://www.nuclearelephant.com/