algorithm problem in my thesis!!

Expand Post »

hi guys!

I'm having my thesis right now.. And Im working on my study which is called "SMS-based spam filter".... I dont know if this is really feasible, but im still researching..

But I'm having problems if what algorithm should i use.. I read about Markovian, Willow, and Correlator algorithms... I think Markovian (w/c uses statistical Bayesian approach) is more efficient... But I need some opinion what tools should i use to implement this(like tokenizer???, or language modeler????). And i need advice on what algorithm is suited for implementing this... as I continue to research!!!

-HERTZ-

Similar Threads

help writing pseudocode, PLEASE!!!! in C++
Algorithm problem in Computer Science
dijkstra algorithm problem in c++ in C++
algorithm problem with recursion in Java
recursive algorithm in C++

hertzzz

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

3 posts
since Aug 2007

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Computer Science Forum Timeline: final year project

Next Thread in Computer Science Forum Timeline: IAS computer

DaniWeb Message

Cancel Changes

User Name
Password