An assortment of spam detection system

E-mail communication is indispensable nowadays, but the e-mail spam problem continues growing drastically. In recent years, the notion of collaborative spam filtering with near-duplicate similarity matching scheme has been widely discussed. The primary idea of the similarity matching scheme for spam detection is to maintain a known spam database, to block subsequent near-duplicate spam´s. Keeping a novel e-mail abstraction scheme in mind, which considers e-mail layout structure to represent e-mail´s, we design an assorted spam detection system. We propose a system, which possesses hash value to implement an efficient near-duplicate matching scheme. By this it is possible to achieve less execution time than before. Moreover, we can classify N e-mails at a time as spam or ham which was restricted to a single mail earlier.