|Publication number||US7590694 B2|
|Application number||US 10/760,140|
|Publication date||Sep 15, 2009|
|Filing date||Jan 16, 2004|
|Priority date||Jan 16, 2004|
|Also published as||US8032604, US8285806, US20050160148, US20100005149, US20120016945|
|Publication number||10760140, 760140, US 7590694 B2, US 7590694B2, US-B2-7590694, US7590694 B2, US7590694B2|
|Original Assignee||Gozoom.Com, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (40), Non-Patent Citations (2), Referenced by (14), Classifications (11), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
A portion of the disclosure recited in the specification contains material which is subject to copyright protection. Specifically, a Source Code Appendix is provided that includes source code instructions for a process by which the present invention is practiced in a computer system. The copyright owner has no objection to the facsimile reproduction of the specification as filed in the Patent and Trademark Office. Otherwise all copyright rights are reserved.
Although electronic mail, or email, has become immensely popular and is a huge benefit for many users, today's email systems are also plagued by increasing numbers of unwanted mail, referred to as “spam.” Spam email has reached such large proportions with respect to desired email that systems are now sought to defeat the sending and delivery of spam.
For example, one approach is to design “filters” to block spam before it is received in a user's email in-box. The filters use different user-designed criteria such as detecting a sender's name, or a word or phrase used in a subject header. Filters can also be used to sort email into separate folders once the email has been received by a user so that the user can ignore folders into which spam is sorted. These approaches are not without shortcomings since the filters typically work on keyword matching or common and relatively easy to detect syntax or language features. Spam emailers have developed ways to thwart simple filter approaches. Sophisticated spam senders can use processes to modify an original email messages into different variations that each communicate essentially the same message. Typically the message is designed to sell something to a recipient, or is designed to provide other commercial advantage to the spam emailer.
For example, one line in an email message might be “buy this now.” The line can be modified to “you should try this now.” Other properties of the message can be modified such as the order of sentences, addition or removal of words or phrases, changes in spacing or other message formatting, etc. Since the modified spam email messages are different, it is difficult for simple spam detection routines to successfully identify a primary characteristic of spam email, namely, that the email is sent in large number such as thousands, hundreds of thousands or more instances of the same message. Such high-volume email is referred to as “bulk” email. Spam emailers can also use such approaches to change other characteristics of an email message, such as sender identification, routing information and other information that may be associated with an email message that could otherwise help determine that the email message is a bulk emailing and is likely to be spam.
Spam detection is further complicated because all bulk emailings are not necessarily spam. For example, if thousands of users desire to be informed of daily weather from a weather source then the messages are likely to be the same or similar, depending on the regional location of the users. Even though such email would qualify as bulk email it would not be considered spam. Still other users may actually desire to receive certain types of commercial email that would be considered spam by other users. Today's email filter and anti-spam systems often fail to provide for such conditions.
Thus, it is desirable to improve detection of bulk and/or spam email.
A preferred embodiment of the invention provides for detection of “bulk” email by comparing email messages to one another to determine if the email messages should be considered essentially the same message. If a category of “same” messages meets a predetermined criteria, such as the total number of messages in the category exceeding a predefined number, then the messages are considered bulk messages. Once a determination is made that email messages are bulk email messages then further analysis can be performed to determine if the bulk email is unwanted, or “spam.” Depending on the spam determination further action can be taken, such as preventing the messages from delivery.
A determination of “sameness” for purposes of both bulk and spam classifications can use any number and type of evaluation modules. Each module can include one or more rules, tests, processes, algorithms, or other functionality. For example, one type of module may be a word count of email message text. Another module can use a weighting factor based on groups of multiple words and their perceived meanings. In general, any type of module can be used. A preferred embodiment of the invention uses statistical analysis, such as Bayesian analysis, to measure the performance of different modules against a known standard, such as human manual matching. Modules that are performing worse than other modules can be valued less than modules having better performance. In this manner, a high degree of reliability can be achieved. To improve performance, if a message is determined to be the same as a previous message, the previous computations and results for that previous message can be re-used.
In one embodiment, users are provided with options to customize or regulate bulk and spam classification and subsequent actions on how to handle the classified email messages. For example, a user can set parameters to select which modules are used, set the threshold number of “same” messages requirement for classifying a group of messages as bulk, set confidence limits for classifications, set filters based on number of matches of sameness engines, set “hold” times for incoming messages pending a determination of bulk classification, etc. Messages which are already determined to be bulk do not need to be held.
One embodiment of the invention provides for a central server to distribute module performance and module related info data to different servers for use by the servers in sameness determinations. The central server handles the computation on module performance, create module related data, and can assist the servers in switching over from one module, or set of modules, to another. The switchover to a new module set can be performed over time at the direction of the central server to take into account changing characteristics of spam email, or to take into account changing tactics of spam senders.
In one embodiment the invention provides an apparatus for classifying email messages, the apparatus comprising a processor for executing instructions included in a machine-readable medium, the machine-readable medium including one or more instructions for using a plurality of modules to determine a level of sameness of a particular email message with one or more prior email messages, wherein the level of sameness is derived for the particular email message from a weighting of the outputs of the modules; one or more instructions for determining a performance level for each of the modules; one or more instructions for comparing performance levels; one or more instructions for adjusting a weighting of at least one module in response to comparing performance levels; and one or more instructions for using the level of sameness for the particular email message to classify the particular email message into a category.
In another embodiment the invention provides a method for classifying email messages, the method comprising using a plurality of modules to determine a level of sameness of a particular email message with one or more prior email messages, wherein the level of sameness is derived for the particular email message from a weighting of the outputs of the modules; determining a performance level for each of the modules; comparing performance levels; adjusting a weighting of at least one module in response to comparing performance levels; and using the level of sameness for the particular email message to classify the particular email message into a category.
The Internet can include any number of servers, routers, switches and other devices through which the email information travels before reaching an intended recipient or other final destination (i.e., receiver). Although the invention is discussed in connection with a client/server architecture, such nomenclature is for convenience, only, as the roles and functions of any specific processor can be that of a client or server at different times. In some cases, an email server, or other type of server need not be used, or the server functions can be integrated with a client or other processing device.
Any type of processing devices can be used to send and receive email. For example, portable computing devices such as a personal digital assistant (PDA), cell phone, laptop computer, or other devices can be employed. In general, the devices and manner of specific processing (including location and timing) are not critical to practicing important features of the present invention.
A preferred embodiment of the invention uses an email server, or central server. The central server can be either of servers 20 or 40, or it can be another server through which an email message is transferred. For example, an Internet service provider (ISP) or other entity that provides email services may operate one or more email servers (not shown). In most embodiments it is desirable to have one or a few centralized points through which email traffic flows in order to be able to analyze and filter email to eliminate unwanted email, or spam.
Modules 130 are used to produce a value or values that indicate the degree of certainty that the module assigns to an email message to indicate whether the email message is matched to another email message or group of email messages (referred to as a category). In a preferred embodiment, a module can merely produce a “match” or “no match” with a message category. For example, there maybe tens or hundreds or more different categories to which a candidate email message may be compared. Each module can produce a conclusion as to whether the candidate email message is matched to one or more of the categories. Alternatively, the modules can produce a “degree of certainty” value (e.g., from 0 to 100) that indicates the degree to which the module ascertains that the message is the same as the messages in each category. Other types of module comparisons and types of module output are possible. Typically, the checking for sameness is performed against one or more messages, or other information representing message content, obtained from a source such as database 150.
Filter 140 uses the results of the module comparisons to determine whether the email traffic is delivered to a user such as user 160. Messages that are delivered, or “passed,” are considered legitimate, or desired, messages. Messages that are undelivered are said to be blocked, or undesirable, messages. In a preferred embodiment, filter 140 performs a spam check on messages that are considered to be “bulk” messages. Bulk messages are those messages in a category that contains over X messages, where X is a predetermined number. Messages that are not bulk messages are automatically passed through to the intended recipient, or user. Bulk messages, on the other hand, are subjected to further scrutiny and checking to determine whether the messages are spam. Typically, this is a determination as to whether the message is of a commercial nature, i.e., is designed to benefit the sender monetarily or in some other fashion. The spam checking can be by any means as is known in the art.
Ideally, a system would be able to tell with certainty whether a message is bulk or not. In such a case, all non-bulk messages can be considered as not spam. However, since the bulk detection is not perfect, a preferred embodiment uses the probability that email is bulk combined with the probability that the email may be spam to derive the overall probability that email is bulk and spam.
Performance evaluation 110 is a process that assesses the success or failure of specific modules to detect a match of email. For example, if a module has determined that an email message is the same as other email messages in category 1, and a benchmark evaluation reveals that the message is actually NOT the same as the email messages in category 1, the module is said to have failed at the matching process. Modules that fail more frequently than desired can be removed from use, or if they are still used less weight can be given to their conclusions. On the other hand, modules which are more successful than others can be weighted more heavily than other modules so that the successful modules have more influence in the overall decision of sameness than other modules. Completely useless or redundant modules can be removed. A module X is redundant if there exists another module Y which is right whenever module X is right. A partially useless module may still be deleted if the incremental value that it provides does not justify the cost of executing the module.
A benchmark evaluation can be achieved manually, as where it is performed by a human editor. Such an approach can periodically have a human editor review categorized email messages and determine if the sorting is proper. Module decisions as to the category can then be compared against the human editor and modules can be rated accordingly. Inter-module checking can also be performed where if a module often decides contrary to other modules, especially when the other modules are weighted highly, then the contrary module can be de-rated, or given a lower weighting in the overall result. A preferred embodiment uses Bayesian analysis to achieve this “tuning” of the module selection and weighting.
Module tuning and sameness checking can be applied to spam checking in addition to bulk detection. A preferred embodiment of the invention uses a process called the SpamRepute Engine that uses the “sameness” method. If one message is identified to be spam, then all messages which are identified as the “same” as that message are also classified as spam. If one message is identified to be legitimate, then all messages which are identified as the “same” as that message is also legitimate.
Table I shows examples of different ID modules used to perform sameness checking.
Uses nilsimsa fingerprints
Uses DCC checksums of messages, utilizes dccproc
to get checksums
Using the whole message body, this module creates a
Using only the first 2K bytes of the message body, this
module creates a hash
Using only the first half of the message body, this
module creates a hash
Table II shows performance measurements of the modules in Table I
In Table II, a determination as to whether the module is actually right or wrong is based on a human editor's decision as to whether the messages are the “same.” One way to calculate a weight to assign to a module based on the results of Table II can be performed as follows (using the values denoted by the letters in parentheses in each column of Table II):
The calculation above is computed for each module used in a group of modules (e.g., ID modules 130 of
By assuming that messages with a computed 99% or greater combined sameness probability are the same and those with a 1% or less combined sameness probability are not the same, the message sample can be used to tune the weights of the individual ID modules. In order to start a comparison process to determine if an email message is spam, it may be necessary to make a determination about at least one instance of the email message. One way this can be done is by observation and flagging an email as spam by a human editor. Another method is to allow a user or group of users to “vote” on whether the email is spam. The votes can be cross referenced by the ID modules, weighted by a user's reputation and tallied.
Other ways to perform initial classification can include so-called “relay honeypots” and “proxy honeypots” to obtain information about an email message or email sender. Another approach can use sender authentication and permit messages from authenticated senders, or with approved digital signatures, to be passed as legitimate, non-spam, email.
The Source Code Appendix includes examples of ID modules and a routine to manage the application of the modules to determine sameness among email messages.
One feature of the present invention allows a central server to hold messages for a time before delivery. In this manner a group of messages can be compared for sameness before they are delivered to the intended recipients. This can be useful, for example, to make a bulk email determination since the threshold criterion for bulk email delivery might be tens of thousands of messages but an email spammer may only send out a few hundred messages at a time so that the bulk detection could not occur until after a reasonable time interval (e.g., 1 hour). If the non-bulk messages are not delayed, then all messages below the bulk threshold will always be treated as non-bulk. The time period for holding email messages pending delivery in order to detect bulk email can vary according to any of a number of factors. For example, a user may designate certain types of email (e.g., from known senders) to be delivered immediately. The number to be held could be proportional to the historical number of messages needed for actual bulk messages to exceed the bulk threshold. Email from senders who are not on the immediate delivery list can be held for a predetermined time period. The time period for holding can also be increased gradually as the number of matches for a category grows or based on the content of the message. Other ways to set or vary the hold time are possible.
A contemplated embodiment of the invention envisions a master server performing the performance evaluation function shown in
Another feature allows for users to set parameters that deal with tuning sameness engines for either bulk mail detection or spam detection. For example, a user may want to include or exclude certain modules, or to manually assign different weights to different modules. This can be useful, for example, where a user wants to receive certain types of email that might otherwise be blocked as spam. A user can be allowed to set any of a number of parameters in the system, such as the threshold number of email messages in a category before the category is considered to be bulk email. Note that many different users can each have a different threshold number so that the same category of email messages can be considered bulk (or spam) or not on a user-by-user basis. Subsequent processing or detection of spam or other characteristics of email can proceed, accordingly, on the same user-by-user basis. User selection or setting of parameters can be by typing in a numerical value, selection of a menu option, activation of a button or slider control, or by any other means as is known in the art. If a continuous function is converted into a discrete function, the confidence level determines the threshold by which the conversion is performed. For example, if the probability is 99 and the confidence level is 98, then the result can be converted into a definite 100.
Although the invention has been discussed with reference to specific embodiments thereof, these embodiments are illustrative, and not restrictive, of the invention. For example, although the invention is discussed primarily with respect to email messages, other types of information exchange or transfer can similarly benefit. For example, so-called pop-up web pages or dialog boxes can be subjected to sameness testing and filtering. Items attached to email messages can be analyzed as can web pages, files, images, or other data items or structures.
In the description herein, numerous specific details are provided, such as examples of components and/or methods, to provide a thorough understanding of embodiments of the present invention. One skilled in the relevant art will recognize, however, that an embodiment of the invention can be practiced without one or more of the specific details, or with other apparatus, systems, assemblies, methods, components, materials, parts, and/or the like. In other instances, well-known structures, materials, or operations are not specifically shown or described in detail to avoid obscuring aspects of embodiments of the present invention.
A “machine-readable medium” or “computer-readable medium” for purposes of embodiments of the present invention may be any medium or transmission that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, system or device. The computer readable carrier can be, by way of example only but not by limitation, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, system, device, propagation medium, or computer memory.
A “processor” or “process” includes any human, hardware and/or software system, mechanism or component that processes data, signals or other information. A processor can include a system with a general-purpose central processing unit, multiple processing units, dedicated circuitry for achieving functionality, or other systems. Processing need not be limited to a geographic location, or have temporal limitations. For example, a processor can perform its functions in “real time,” “offline,” in a “batch mode,” etc. Portions of processing can be performed at different times and at different locations, by different (or the same) processing systems.
Reference throughout this specification to “one embodiment”, “an embodiment”, or “a specific embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention and not necessarily in all embodiments. Thus, respective appearances of the phrases “in one embodiment”, “in an embodiment”, or “in a specific embodiment” in various places throughout this specification are not necessarily referring to the same embodiment. Furthermore, the particular features, structures, or characteristics of any specific embodiment of the present invention may be combined in any suitable manner with one or more other embodiments. It is to be understood that other variations and modifications of the embodiments of the present invention described and illustrated herein are possible in light of the teachings herein and are to be considered as part of the spirit and scope of the present invention.
Embodiments of the invention may be implemented by using a programmed general purpose digital computer, by using application specific integrated circuits, programmable logic devices, field programmable gate arrays, optical, chemical, biological, quantum or nanoengineered systems, components and mechanisms may be used. In general, the functions of the present invention can be achieved by any means as is known in the art. Distributed, or networked systems, components and circuits can be used. Communication, or transfer, of data may be wired, wireless, or by any other means.
It will also be appreciated that one or more of the elements depicted in the drawings/figures can also be implemented in a more separated or integrated manner, or even removed or rendered as inoperable in certain cases, as is useful in accordance with a particular application. It is also within the spirit and scope of the present invention to implement a program or code that can be stored in a machine-readable medium to permit a computer to perform any of the methods described above.
Additionally, any signal arrows in the drawings/Figures should be considered only as exemplary, and not limiting, unless otherwise specifically noted. Furthermore, the term “or” as used herein is generally intended to mean “and/or” unless otherwise indicated. Combinations of components or steps will also be considered as being noted, where terminology is foreseen as rendering the ability to separate or combine is unclear.
As used in the description herein and throughout the claims that follow, “a”, “an”, and “the” includes plural references unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
The foregoing description of illustrated embodiments of the present invention, including what is described in the Abstract, is not intended to be exhaustive or to limit the invention to the precise forms disclosed herein. While specific embodiments of, and examples for, the invention are described herein for illustrative purposes only, various equivalent modifications are possible within the spirit and scope of the present invention, as those skilled in the relevant art will recognize and appreciate. As indicated, these modifications may be made to the present invention in light of the foregoing description of illustrated embodiments of the present invention and are to be included within the spirit and scope of the present invention.
Thus, while the present invention has been described herein with reference to particular embodiments thereof, a latitude of modification, various changes and substitutions are intended in the foregoing disclosures, and it will be appreciated that in some instances some features of embodiments of the invention will be employed without a corresponding use of other features without departing from the scope and spirit of the invention as set forth. Therefore, many modifications may be made to adapt a particular situation or material to the essential scope and spirit of the present invention. It is intended that the invention not be limited to the particular terms used in the following claims and/or to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include any and all embodiments and equivalents falling within the scope of the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5694616||Dec 30, 1994||Dec 2, 1997||International Business Machines Corporation||Method and system for prioritization of email items by selectively associating priority attribute with at least one and fewer than all of the recipients|
|US5742769||May 6, 1996||Apr 21, 1998||Banyan Systems, Inc.||Directory with options for access to and display of email addresses|
|US5781857||Jun 28, 1996||Jul 14, 1998||Motorola, Inc.||Method of establishing an email monitor responsive to a wireless communications system user|
|US5809020 *||Mar 18, 1996||Sep 15, 1998||Motorola, Inc.||Method for adaptively adjusting weighting coefficients in a cDMA radio receiver|
|US5822526||Jun 3, 1996||Oct 13, 1998||Microsoft Corporation||System and method for maintaining and administering email address names in a network|
|US5878230||Jan 5, 1995||Mar 2, 1999||International Business Machines Corporation||System for email messages wherein the sender designates whether the recipient replies or forwards to addresses also designated by the sender|
|US5978799||Jan 29, 1998||Nov 2, 1999||Hirsch; G. Scott||Search engine including query database, user profile database, information templates and email facility|
|US5987609||Oct 3, 1997||Nov 16, 1999||Kabushiki Kaisha Toshiba||System for remotely securing/locking a stolen wireless device via an Email message|
|US5999967||Aug 17, 1997||Dec 7, 1999||Sundsted; Todd||Electronic mail filtering by electronic stamp|
|US6023723||Dec 22, 1997||Feb 8, 2000||Accepted Marketing, Inc.||Method and system for filtering unwanted junk e-mail utilizing a plurality of filtering mechanisms|
|US6052709||Dec 23, 1997||Apr 18, 2000||Bright Light Technologies, Inc.||Apparatus and method for controlling delivery of unsolicited electronic mail|
|US6104500||Apr 29, 1998||Aug 15, 2000||Bcl, Computer Inc.||Networked fax routing via email|
|US6108688||Jun 12, 1996||Aug 22, 2000||Sun Microsystems, Inc.||System for reminding a sender of an email if recipient of the email does not respond by a selected time set by the sender|
|US6108691||Apr 17, 1998||Aug 22, 2000||Switchboard, Inc.||Directory with options for access to and display of email addresses|
|US6118856||Dec 28, 1998||Sep 12, 2000||Nortel Networks Corporation||Method and apparatus for automatically forwarding an email message or portion thereof to a remote device|
|US6141695||Dec 2, 1997||Oct 31, 2000||Canon Kabushiki Kaisha||Email system converts email data to a different format according to processing mode information set in memory in correspondence with post office information|
|US6161130||Jun 23, 1998||Dec 12, 2000||Microsoft Corporation||Technique which utilizes a probabilistic classifier to detect "junk" e-mail by automatically updating a training and re-training the classifier based on the updated training set|
|US6223213||Jul 31, 1998||Apr 24, 2001||Webtv Networks, Inc.||Browser-based email system with user interface for audio/video capture|
|US6249807||Nov 17, 1998||Jun 19, 2001||Kana Communications, Inc.||Method and apparatus for performing enterprise email management|
|US6272532||Dec 2, 1998||Aug 7, 2001||Harold F. Feinleib||Electronic reminder system with universal email input|
|US6282565||Nov 17, 1998||Aug 28, 2001||Kana Communications, Inc.||Method and apparatus for performing enterprise email management|
|US6289214||May 29, 1998||Sep 11, 2001||Ericsson Inc.||Systems and methods for deactivating a cellular radiotelephone system using an ANSI-41 short message service email|
|US6304898||Oct 11, 2000||Oct 16, 2001||Datahouse, Inc.||Method and system for creating and sending graphical email|
|US6321267||Nov 23, 1999||Nov 20, 2001||Escom Corporation||Method and apparatus for filtering junk email|
|US6324569||Jul 18, 2000||Nov 27, 2001||John W. L. Ogilvie||Self-removing email verified or designated as such by a message distributor for the convenience of a recipient|
|US6330589||May 26, 1998||Dec 11, 2001||Microsoft Corporation||System and method for using a client database to manage conversation threads generated from email or news messages|
|US6330590||Jan 5, 1999||Dec 11, 2001||William D. Cotten||Preventing delivery of unwanted bulk e-mail|
|US6351523||Mar 22, 1999||Feb 26, 2002||Sharp Laboratories Of America, Inc.||Method and apparatus for management of EMail originated by thin client devices|
|US6363414||Dec 29, 1998||Mar 26, 2002||Pitney Bowes Ltd.||Method for converting an email message to a different format and retransmitting to a location other than recipient address information in the email message|
|US6374292||Mar 7, 2000||Apr 16, 2002||Sun Microsystems, Inc.||Access control system for an ISP hosted shared email server|
|US6401112||Jan 29, 1997||Jun 4, 2002||Palm, Inc.||Method and apparatus for synchronizing an Email client on a portable computer system with an Email client on a desktop computer|
|US6405225||Jun 17, 1998||Jun 11, 2002||Microsoft Corporation||Integrating email functionality into a word processor by incorporating an email GUI within the word processor|
|US6405243||Apr 5, 1996||Jun 11, 2002||Sun Microsystems, Inc.||Method and system for updating email addresses|
|US6413000||Nov 28, 2000||Jul 2, 2002||Jean Charles Incorporated||Mesh sponge with flexible pouch|
|US6424426||Mar 28, 2000||Jul 23, 2002||Mongonet||Fax-to-email and email-to-fax communication system and method|
|US6842773 *||Jan 31, 2001||Jan 11, 2005||Yahoo ! Inc.||Processing of textual electronic communication distributed in bulk|
|US7194681 *||Jul 30, 1999||Mar 20, 2007||Microsoft Corporation||Method for automatically assigning priorities to documents and messages|
|US7249162 *||Feb 25, 2003||Jul 24, 2007||Microsoft Corporation||Adaptive junk message filtering system|
|US20040039786 *||Jun 30, 2003||Feb 26, 2004||Horvitz Eric J.||Use of a bulk-email filter within a system for classifying messages for urgency or importance|
|US20050060643 *||Aug 12, 2004||Mar 17, 2005||Miavia, Inc.||Document similarity detection and classification system|
|1||Graham, Paul; "A Plan for Spam"; Aug. 2002; http://paulgraham.com/spam.html; pp. 1-8.|
|2||Sahami et al.; "A Bayesian Approach to Filtering Junk E-Mail"; Microsoft Research Redmond WA; pp. 1-8.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7970845||Nov 9, 2009||Jun 28, 2011||Gozoom.Com, Inc.||Methods and systems for suppressing undesireable email messages|
|US8032604 *||Sep 14, 2009||Oct 4, 2011||Gozoom.Com, Inc.||Methods and systems for analyzing email messages|
|US8280971||Jun 27, 2011||Oct 2, 2012||Gozoom.Com, Inc.||Suppression of undesirable email messages by emulating vulnerable systems|
|US8285806||Sep 23, 2011||Oct 9, 2012||Gozoom.Com, Inc.||Methods and systems for analyzing email messages|
|US8495737||Mar 1, 2011||Jul 23, 2013||Zscaler, Inc.||Systems and methods for detecting email spam and variants thereof|
|US8515894||Dec 30, 2009||Aug 20, 2013||Gozoom.Com, Inc.||Email analysis using fuzzy matching of text|
|US8918466||Mar 8, 2005||Dec 23, 2014||Tonny Yu||System for email processing and analysis|
|US8966620||May 27, 2010||Feb 24, 2015||Microsoft Technology Licensing, Llc||Campaign detection|
|US9116879||May 25, 2011||Aug 25, 2015||Microsoft Technology Licensing, Llc||Dynamic rule reordering for message classification|
|US20050262209 *||Mar 8, 2005||Nov 24, 2005||Mailshell, Inc.||System for email processing and analysis|
|US20090044006 *||May 30, 2006||Feb 12, 2009||Shim Dongho||System for blocking spam mail and method of the same|
|US20100169638 *||Dec 31, 2008||Jul 1, 2010||Jack Farris||Communication system having message encryption|
|US20120158868 *||Jun 21, 2012||Yahoo! Inc||Protecting privacy in groups e-mail messages|
|WO2012116587A1 *||Feb 1, 2012||Sep 7, 2012||Tencent Technology (Shenzhen) Company Limited||Similar email processing system and method|
|U.S. Classification||709/206, 709/207|
|International Classification||G06F15/16, H04L12/58, G06Q10/00|
|Cooperative Classification||H04L51/12, G06Q10/107, H04L12/585|
|European Classification||G06Q10/107, H04L51/12, H04L12/58F|
|Sep 16, 2008||AS||Assignment|
Owner name: GOZOOM.COM, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YU, TONNY;REEL/FRAME:021540/0365
Effective date: 20080912
|Sep 21, 2010||CC||Certificate of correction|
|Feb 22, 2013||FPAY||Fee payment|
Year of fee payment: 4