Patents by Inventor Joshua T. Goodman

Joshua T. Goodman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20040221062
    Abstract: Architecture for detecting and removing obfuscating clutter from the subject and/or body of a message, e.g., e-mail, prior to filtering of the message, to identify junk messages commonly referred to as spam. The technique utilizes the powerful features built into an HTML rendering engine to strip the HTML instructions for all non-substantive aspects of the message. Pre-processing includes pre-rendering of the message into a final format, which final format is that which is displayed by the rendering engine to the user. The final format message is then converted to a text-only format to remove graphics, color, non-text decoration, and spacing that cannot be rendered as ASCII-style or Unicode-style characters. The result is essentially to reduce each message to its common denominator essentials so that the junk mail filter can view each message on an equal basis.
    Type: Application
    Filed: May 2, 2003
    Publication date: November 4, 2004
    Inventors: Bryan T. Starbuck, Robert L. Rounthwaite, David E. Heckerman, Joshua T. Goodman
  • Publication number: 20040215977
    Abstract: The subject invention provides for an intelligent quarantining system and method that facilitates a more robust classification system in connection with spam prevention. The invention involves holding back some messages that appear to be questionable, suspicious, or untrustworthy from classification (as spam or good). In particular, the filter lacks information about these messages and thus classification is temporarily delayed. This provides more time for a filter update to arrive with a more accurate classification. The suspicious messages can be quarantined for a determined time period to allow more data to be collected regarding these messages. A number of factors can be employed to determine whether messages are more likely to be flagged for further analysis. User feedback by way of a feedback loop system can also be utilized to facilitate classification of the messages. After some time period, classification of the messages can be resumed.
    Type: Application
    Filed: February 13, 2004
    Publication date: October 28, 2004
    Inventors: Joshua T. Goodman, Robert L. Rounthwaite, Geoffrey J. Hulten, Derek Hazeur
  • Publication number: 20040181571
    Abstract: The present invention provides for generating inputs that can be provided to a message classification module to facilitate more reliable classification of electronic messages, such as, for example, as unwanted and/or unsolicited. In one embodiment, a sending messaging server provides an appropriate response to address verification data thereby indicating a reduced likelihood of the sending messaging server using a forged network address. In another embodiment, it is determined if a messaging server is authorized to send electronic messages for a domain. In yet another embodiment, electronic message transmission policies adhered to by a domain are identified. In yet a further embodiment, a sending computer system expends computational resources to solve a computational puzzle and includes an answer document in an electronic message. A receiving computer system receives the electronic message and verifies the answer document.
    Type: Application
    Filed: October 10, 2003
    Publication date: September 16, 2004
    Inventors: Robert George Atkinson, Joshua T. Goodman, James M. Lyon, Roy Williams, Khaja E. Ahmed, Harry Simon Katz, Robert L. Rounthwaite
  • Publication number: 20040181585
    Abstract: The present invention provides for generating inputs that can be provided to a message classification module to facilitate more reliable classification of electronic messages, such as, for example, as unwanted and/or unsolicited. In one embodiment, a sending messaging server provides an appropriate response to address verification data thereby indicating a reduced likelihood of the sending messaging server using a forged network address. In another embodiment, it is determined if a messaging server is authorized to send electronic messages for a domain. In yet another embodiment, electronic message transmission policies adhered to by a domain are identified. In yet a further embodiment, a sending computer system expends computational resources to solve a computational puzzle and includes an answer document in an electronic message. A receiving computer system receives the electronic message and verifies the answer document.
    Type: Application
    Filed: October 10, 2003
    Publication date: September 16, 2004
    Inventors: Robert George Atkinson, Joshua T. Goodman, James M. Lyon, Roy Williams, Khaja E. Ahmed, Harry Simon Katz, Robert L. Rounthwaite, Andrew V. Goldberg, Cynthia Dwork
  • Publication number: 20040177110
    Abstract: The subject invention provides for a feedback loop system and method that facilitate classifying items in connection with spam prevention in server and/or client-based architectures. The invention makes uses of a machine-learning approach as applied to spam filters, and in particular, randomly samples incoming email messages so that examples of both legitimate and junk/spam mail are obtained to generate sets of training data. Users which are identified as spam-fighters are asked to vote on whether a selection of their incoming email messages is individually either legitimate mail or junk mail. A database stores the properties for each mail and voting transaction such as user information, message properties and content summary, and polling results for each message to generate training data for machine learning systems. The machine learning systems facilitate creating improved spam filter(s) that are trained to recognize both legitimate mail and spam mail and to distinguish between them.
    Type: Application
    Filed: March 3, 2003
    Publication date: September 9, 2004
    Inventors: Robert L. Rounthwaite, Joshua T. Goodman, David E. Heckerman, John D. Mehr, Nathan D. Howell, Micah C. Rupersburg, Dean A. Slawson
  • Publication number: 20040167964
    Abstract: The invention relates to a system for filtering messages—the system includes a seed filter having associated therewith a false positive rate and a false negative rate. A new filter is also provided for filtering the messages, the new filter is evaluated according to the false positive rate and the false negative rate of the seed filter, the data used to determine the false positive rate and the false negative rate of the seed filter are utilized to determine a new false positive rate and a new false negative rate of the new filter as a function of threshold. The new filter is employed in lieu of the seed filter if a threshold exists for the new filter such that the new false positive rate and new false negative rate are together considered better than the false positive and the false negative rate of the seed filter.
    Type: Application
    Filed: February 25, 2003
    Publication date: August 26, 2004
    Inventors: Robert L. Rounthwaite, Joshua T. Goodman, David E. Heckerman, John C. Platt, Carl M. Kadie
  • Publication number: 20030023420
    Abstract: Determination of a word input on a reduced keypad, such as a numeric keypad, by entering a key sequence ambiguously corresponding to the word, by taking into account the context of the word via a machine learning approach, is disclosed. Either the left context, the right context, or the double-sided context of the number sequence can be used to determine the intended word. The machine learning approach can use a statistical language model, such as an n-gram language model. The compression of a language model for use with small devices, such as mobile phones and other types of small devices, is also disclosed.
    Type: Application
    Filed: March 31, 2001
    Publication date: January 30, 2003
    Inventor: Joshua T. Goodman
  • Publication number: 20030011574
    Abstract: Out-of-vocabulary (OOV) word determination corresponding to a key sequence entered by the user on a (typically numeric) keypad, and a user interface for the user to select one of the words, are disclosed. A word-determining logic determines letter sequences corresponding to the entered key sequence, and presents the sequences within the user interface in which the user can select one of the letter sequences as the intended word, or select the first letter of the intended word. When letters are selected, the word-determining logic determines new letter sequences, consistent with the key sequence and the selected letters, and presents the new letter sequences. The user again selects one of the letter sequences as the intended word, or selects the second letter of the intended word. This process is repeated until the user has selected the intended word.
    Type: Application
    Filed: March 31, 2001
    Publication date: January 16, 2003
    Inventor: Joshua T. Goodman
  • Publication number: 20020188448
    Abstract: Spell checking of a word corresponding to a typically numeric key sequence entered by the user using numeric keys or other reduced keyboards is disclosed. The spell checking is based on comparisons of the entered number sequences with number sequences within a dictionary, or number sequences for words within a dictionary. For a given entered number sequence, the number sequences of words in a dictionary, or the number sequences in the dictionary, are compared. Those having costs according to a metric not greater than a maximum cost are presented as the potential intended word of the user. The metric may be the minimum edit distance, for example.
    Type: Application
    Filed: March 31, 2001
    Publication date: December 12, 2002
    Inventors: Joshua T. Goodman, Gina D. Venolia