E-mail filter employing adaptive ruleset

• US 20050102366A1
• Filed: 11/07/2003
• Published: 05/12/2005
• Est. Priority Date: 11/07/2003
• Status: Abandoned Application

• Current Assignee: Abaca Technology Corp. (Proofpoint Incorporated)
• Original Assignee: Abaca Technology Corp. (Proofpoint Incorporated)
• Inventors: Kirsch, Steven T.
• Application Number:
  US10/703,844
• Publication Number:
  US 20050102366A1
• Time in Patent Office: Days
• US Class Current: 709/207
• CPC Class Codes: G06Q 10/107 Computer-aided management of electronic mailing [e-mailing]

Abstract

An e-mail filter employing an adaptive ruleset for classifying received e-mail messages. The individual rules of the ruleset are applied to all or some received e-mail messages, depending on the configuration of the filter. In some embodiments, an initial rule or filter is applied to the message to obtain an initial rating indicating whether the recipient would want the message. Statistics collected for each rule in the ruleset are used to determine a weighted probability the message is wanted. A different weighted probability is obtained if the rule is satisfied or if the rule is not satisfied. A final probability the message is wanted is obtained after applying the filter'"'"'s adaptive ruleset and using a weighted average to combine that score with any other rules and the message is processed accordingly. Statistics are updated using the machine-generated final probability, so the adaptive ruleset of the filter is constantly updated without requiring user input.

Claims

1. In a communications network, a method for determining whether a received e-mail message is wanted comprising:

a) applying each rule of an adaptive ruleset to the message to obtain for each rule a weighted probability the message is wanted, wherein the weighted probability is based on statistics tracked for each rule;

b) determining a final probability the message is wanted based on the weighted probabilities obtained for each rule; and

c) adjusting statistics for each rule of the adaptive ruleset based on the final probability the message is wanted, wherein the adjustment does not require user input.

2. The method of claim 1 further comprising applying an initial rule to the message to determine an initial rating.

3. The method of claim 2 further comprising combining the initial rating with the final probability to assess whether the message is wanted.

4. The method of claim 3 wherein the initial rating and the final probability are averaged.

5. The method of claim 1 wherein the message receives a first weighted probability if the rule is satisfied and receives a second weighted probability if the rule is not satisfied.

6. The method of claim 1 further comprising storing statistics for each rule at a database.

7. The method of claim 1 further comprising setting a threshold based on the final probability to determine whether a message is wanted.

8. The method of claim 1 further comprising sending the message to the recipient if the message is wanted.

9. The method of claim 1 further comprising sending the message to a spam folder if the message is not wanted.

10. The method of claim 1 further comprising deleting the message if the message is not wanted.

11. The method of claim 2 further comprising applying each rule of the adaptive ruleset when the initial rating is not determinative of whether the message is wanted.

12. The method of claim 3 further comprising tracking statistics about the initial rule.

13. The method of claim 12 further comprising storing statistics at a database.

14. The method of claim 1 wherein the statistics for each rule are tracked for each user in the network.

15. The method of claim 1 further comprising maintaining and using a moving average of statistics tracked for each rule.

16. In a communications network, a method for providing and maintaining an adaptive ruleset used to determine whether received e-mail messages are wanted, the method comprising:

a) creating an adaptive ruleset of a plurality of rules to be applied to a received e-mail message to assess whether the e-mail message is wanted;

b) based on statistics, determining a weight and probability for each rule, the weight and probability to be used when assessing whether the e-mail message is wanted, wherein the weight and probability for each rule have different values when the rule is satisfied and when the rule is not satisfied; and

c) adjusting statistics for each rule of the adaptive ruleset each time the ruleset is applied to any received e-mail message, wherein the adjustment does not require user input.

17. The method of claim 16 further comprising storing statistics at a database.

18. The method of claim 16 wherein the weight for each rule is based on the rule'"'"'s ability to differentiate a wanted message from an unwanted message.

19. The method of claim 16 wherein the adaptive ruleset is applied to every received e-mail message.

20. The method of claim 16 wherein the adaptive ruleset is applied only to those e-mail messages which cannot be classified by an initial rule.

21. The method of claim 16 wherein the statistics for each rule are tracked for each user in the network.

22. The method of claim 16 further comprising maintaining and using a moving average of statistics for each rule.

23. In a communications network, a system for classifying e-mail comprising:

a) a sender of an e-mail message;

b) an intended recipient of the e-mail message in network connection with the sender; and

c) an e-mail filter associated with the intended recipient for determining whether the message is wanted by the recipient and having means for;

i) applying each rule of an adaptive ruleset to the message to obtain for each rule a weighted probability the message is wanted, wherein the weighted probability is based on statistics tracked for each rule;

ii) determining a final probability the message is wanted based on the weighted probabilities obtained for each rule; and

iii) adjusting statistics for each rule of the adaptive ruleset based on the final probability the message is wanted, wherein the adjustment does not require user input.

24. The system of claim 23 further comprising a database associated with the filter for receiving, calculating, and storing statistics for the rules.

25. The system of claim 23 further comprising the filter having means for applying an initial rule to the message to determine an initial rating.

26. The system of claim 25 further comprising the filter having means for combining the initial rating with the final probability to assess whether the message is wanted.

27. The system of claim 26 further comprising the filter having means for averaging the initial rating and the final probability.

28. The system of claim 23 further comprising the filter having means for sending the message to the recipient if the message is wanted.

29. The system of claim 23 further comprising the filter having means for sending the message to a spam folder if the message is not wanted.

30. The system of claim 23 further comprising the filter having means for deleting the message if the message is not wanted.

31. The system of claim 25 further comprising the filter having means for applying each rule of the adaptive ruleset when the initial rating is not determinative of whether the message is wanted.

32. The system of claim 25 further comprising the filter having means for tracking statistics about the initial rule.

33. The system of claim 23 wherein the statistics for each rule are tracked for each recipient in the network.

34. The system of claim 23 further comprising the filter having means for maintaining and using a moving average of statistics for each rule.

35. A software-based adaptive ruleset for determining whether received e-mail messages are wanted comprising a plurality of rules, each of the rules to be applied to a received e-mail message to determine if the message is wanted, wherein, based on statistics collected for each rule, each rule has a weight and probability to be used to assess whether the message is wanted, wherein the weight and probability for each rule have different values when the rule is satisfied and when the rule is not satisfied, and the statistics determining the weight and probability for each rule are adjusted each time a rule is applied to any received e-mail message, wherein the adjustment does not require user input.

36. The adaptive ruleset for claim 35 wherein the weight for each rule is based on the rule'"'"'s ability to differentiate a wanted message from an unwanted message.

37. The adaptive ruleset for claim 35 wherein the adaptive ruleset is applied to every received e-mail message.

38. The adaptive ruleset for claim 35 wherein the adaptive ruleset is applied only to those e-mail messages which cannot be classified by an initial rule.

39. The adaptive ruleset for claim 35 wherein the statistics are tracked for each user in the network.

40. The adaptive ruleset of claim 35 wherein a moving average of statistics is maintained and used.

41. A computer-readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method of determining whether a received e-mail message is wanted comprising:

a) applying each rule of an adaptive ruleset to the message to obtain for each rule a weighted probability the message is wanted, wherein the weighted probability is based on statistics tracked for each rule;

b) determining a final probability the message is wanted based on the weighted probabilities obtained for each rule; and

c) adjusting statistics for each rule of the adaptive ruleset based on the final probability the message is wanted, wherein the adjustment does not require user input.

42. The computer-readable storage medium of claim 41, the method further comprising applying an initial rule to the message to determine an initial rating.

43. The computer-readable storage medium of claim 42, the method further comprising combining the initial rating with the final probability to assess whether the message is wanted.

44. The computer-readable storage medium of claim 43 wherein the initial rating and the final probability are averaged.

45. The computer-readable storage medium of claim 41 wherein the message receives a first weighted probability if the rule is satisfied and receives a second weighted probability if the rule is not satisfied.

46. The computer-readable storage medium of claim 41, the method further comprising storing statistics for each rule at a database.

47. The computer-readable storage medium of claim 41, the method further comprising setting a threshold based on the final probability to determine whether a message is wanted.

48. The computer-readable storage medium of claim 41, the method further comprising sending the message to the recipient if the message is wanted.

49. The computer-readable storage medium of claim 41, the method further comprising sending the message to a spam folder if the message is not wanted.

50. The computer-readable storage medium of claim 41, the method further comprising deleting the message if the message is not wanted.

51. The computer-readable storage medium of claim 42, the method further comprising applying each rule of the adaptive ruleset when the initial rating is not determinative of whether the message is wanted.

52. The computer-readable storage medium of claim 43, the method further comprising tracking statistics about the initial rule.

53. The computer-readable storage medium of claim 52, the method further comprising storing statistics at a database.

54. The computer-readable storage medium of claim 41 wherein the statistics for each rule are tracked for each user in the network.

55. The computer-readable storage medium of claim 41, the method further comprising maintaining and using a moving average of statistics.