Spamfo

Oct/04

18

DSPAM v3.2 Preview Released

After four months of development DSPAM v3.2 has been released, bringing many new enhancements and filtering technologies…

These include distributed computing support, implementation of Bill Yerazunis’ Sparse Binary Polynomial Hashing algorithm (from CRM114), and v1.2 of Bayesian Noise Reduction. Other enhancements include SQLite support and many significant performance enhancements for PostgreSQL. DSPAM’s official release is next week, but you can download the preview release now. Users of the project have also contributed towards creating a new logo for this release.”

DSPAM Introduction:

DSPAM (as in De-Spam) is an extremely scalable, open-source statistical anti-spam filter. While most commercial solutions only claim a mere 95% accuracy (1 error in 20), a majority of DSPAM users frequently see around 99.95% (1 error in 2000) and can sometimes reach peaks as high as 99.991% (2 errors in 22,786). DSPAM presently functions as both a server-side agent for UNIX email servers and a developer’s library for mail clients, other anti-spam tools, and similar projects requiring drop-in spam filtering. DSPAM has been implemented on many large and small scale systems with the largest being reported at about 350,000 mailboxes.

DSPAM is a dedicated statistical filter and in being such provides higher accuracy levels than commercial “hodge-podge” solutions, and with minimal resources. DSPAM has managed to achieve nearly equal levels of accuracy with present-day Markovian-based filters and other types of filters that employ large feature sets with the added benefit of using a significantly fewer amount of resources. DSPAM’s best recorded levels of accuracy have included 99.991% by one avid user (2 errors in 22,786) and 99.987% by the author(1 error in 7000) , which is ten times more accurate than a human being!  ( According to a study by Bill Yerazunis of CRM114. )

DSPAM Features:


  • System-wide administratively-maintenance free filtering. The DSPAM agent masquerades as the email server’s delivery agent (or proxy agent if necessary) providing filtering at the server level.
  • A simple-to-use learning mechanism. DSPAM allows users to simply forward their spam to their “spam email address” for learning, eliminating any learning curve necessary to make it usable by your customers. The information used in every calculation is temporarily stored on the server, enabling DSPAM to relearn the original message by looking for a small signature in the forwarded spam. As a result, users don’t have to be trained to ‘bounce’ messages around, and administrators don’t have to worry about incompatible mail clients.
  • Support for a variety of storage implementations. DSPAM’s storage driver API allows the administrator to choose how they wish to store data. Currently supported drivers include SQLite, Berkeley DB3, Berkeley DB4, MySQL, PostgrSQL and Oracle.
  • Multi-Algorithm Support. DSPAM presently supports the following combination algorithms: Graham-Bayesian, Burton-Bayesian, Robinson’s Geometric Mean, and Fisher-Robinson’s Chi-Square. The administrator may choose one or more of these algorithms to use when calculating against spam and even combine two or more for extended filtering reach.
  • Written in C for speed, performance, and scalability. Unlike Python or PERL solutions DSPAM is written in a low-level compiled language, meaning there is very little overhead. DSPAM runs fast, efficient, and doesn’t depend on any third-party language interpreters.
  • MTA support. DSPAM works great with Sendmail, Postfix, Qmail, Courier, and Exim, and should work well with any other MTA that supports external agents.

  • Source
    Slashdot

    Download and more
    DSPAM – http://www.nuclearelephant.com/projects/dspam/
    Whats new in 3.2?

    No tags

    Comments are closed.

    <<

    >>