Bulk electronic message detection by header similarity analysis

Details Bulk electronic message detection by header similarity analysis Bulk electronic message detection by header similarity analysis

2004-09-16

2009-06-30

Jacobs, Lashonda T (Department: 2457)

Electrical computers and digital processing systems: multicomput

Computer conferencing

Demand based messaging

C709S203000, C709S224000

Reexamination Certificate

active

07555524

ABSTRACT:
Methods, apparatuses, and computer-readable media for detecting bulk electronic messages using header similarity analysis. Bulk electronic messages can be detected by parsing (115) header fields of an electronic message; associating (120) at least one constituent unit with each header field defining a set of constituent units for each header field; ascertaining (230) a feature vector for each set of constituent units; forming (240) a collection of feature vectors; and computing (250) an inner product from a set of constituent units from an additional electronic message and the collection of feature vectors from the initial electronic message resulting in a measure of similarity between the initial electronic message and the additional electronic message.

REFERENCES:
patent: 5675710 (1997-10-01), Lewis
patent: 5826249 (1998-10-01), Skeirik
patent: 6023723 (2000-02-01), McCormick et al.
patent: 6052709 (2000-04-01), Paul
patent: 6072942 (2000-06-01), Stockwell et al.
patent: 6161130 (2000-12-01), Horvitz et al.
patent: 6167434 (2000-12-01), Pang
patent: 6199103 (2001-03-01), Sakaguchi et al.
patent: 6249807 (2001-06-01), Shaw et al.
patent: 6253169 (2001-06-01), Apte et al.
patent: 6282565 (2001-08-01), Shaw et al.
patent: 6289416 (2001-09-01), Fukushima et al.
patent: 6298351 (2001-10-01), Castelli et al.
patent: 6324569 (2001-11-01), Ogilvie et al.
patent: 6330590 (2001-12-01), Cotten
patent: 6347310 (2002-02-01), Passera
patent: 6370526 (2002-04-01), Agrawal et al.
patent: 6397200 (2002-05-01), Lynch et al.
patent: 6397215 (2002-05-01), Kreulen et al.
patent: 6421709 (2002-07-01), McCormick et al.
patent: 6424960 (2002-07-01), Lee et al.
patent: 6442606 (2002-08-01), Subbaroyan et al.
patent: 6456991 (2002-09-01), Srinivasa et al.
patent: 6487586 (2002-11-01), Ogilvie et al.
patent: 6502082 (2002-12-01), Toyama et al.
patent: 6505167 (2003-01-01), Horvitz et al.
patent: 6507866 (2003-01-01), Barchi
patent: 6546416 (2003-04-01), Kirsch
patent: 6640301 (2003-10-01), Ng
patent: 6643685 (2003-11-01), Millard
patent: 6650890 (2003-11-01), Irlam et al.
patent: 6654787 (2003-11-01), Aronson et al.
patent: 6687740 (2004-02-01), Gough
patent: 6691156 (2004-02-01), Drummond et al.
patent: 6697942 (2004-02-01), L'Heureux
patent: 6701347 (2004-03-01), Ogilvie
patent: 6711608 (2004-03-01), Ogilvie
patent: 6732157 (2004-05-01), Gordon et al.
patent: 6757713 (2004-06-01), Ogilvie et al.
patent: 6757830 (2004-06-01), Tarbotton et al.
patent: 6915334 (2005-07-01), Hall
patent: 7051023 (2006-05-01), Kapur et al.
patent: 7089241 (2006-08-01), Alspector et al.
patent: 7149778 (2006-12-01), Patel et al.
patent: 7171450 (2007-01-01), Wallace et al.
patent: 7219148 (2007-05-01), Rounthwaite et al.
patent: 7240049 (2007-07-01), Kapur
patent: 7483947 (2009-01-01), Starbuck et al.
patent: 2002/0038308 (2002-03-01), Cappi
patent: 2002/0087641 (2002-07-01), Levosky
patent: 2002/0087649 (2002-07-01), Horvitz
patent: 2002/0138525 (2002-09-01), Karadimitriou et al.
patent: 2002/0138581 (2002-09-01), MacIntosh et al.
patent: 2002/0147694 (2002-10-01), Dempsey et al.
patent: 2002/0147754 (2002-10-01), Dempsey et al.
patent: 2002/0147782 (2002-10-01), Dimitrova et al.
patent: 2002/0181703 (2002-12-01), Logan et al.
patent: 2002/0199095 (2002-12-01), Bandini et al.
patent: 2002/0199186 (2002-12-01), Ali et al.
patent: 2002/0199194 (2002-12-01), Ali
patent: 2003/0033587 (2003-02-01), Ferguson et al.
patent: 2003/0149726 (2003-08-01), Spear
patent: 2003/0167311 (2003-09-01), Kirsch
patent: 2003/0191969 (2003-10-01), Katsikas
patent: 2003/0200334 (2003-10-01), Grynberg
patent: 2003/0220978 (2003-11-01), Rhodes
patent: 2003/0225841 (2003-12-01), Song et al.
patent: 2003/0229672 (2003-12-01), Kohn
patent: 2003/0233415 (2003-12-01), Beyda
patent: 2004/0003283 (2004-01-01), Goodman et al.
patent: 2004/0054887 (2004-03-01), Paulsen et al.
patent: 2004/0064734 (2004-04-01), Ehrlich
patent: 2004/0068534 (2004-04-01), Angermayr et al.
patent: 2004/0073617 (2004-04-01), Milliken et al.
patent: 2004/0093383 (2004-05-01), Huang et al.
patent: 2004/0093384 (2004-05-01), Shipp
patent: 2004/0111480 (2004-06-01), Yue
patent: 2004/0148358 (2004-07-01), Singh et al.
patent: 2004/0205173 (2004-10-01), Hall
patent: 2004/0215977 (2004-10-01), Goodman et al.
patent: 2004/0260776 (2004-12-01), Starbuck et al.
patent: 2005/0060643 (2005-03-01), Glass et al.
patent: 2006/0053203 (2006-03-01), Mijatovic
patent: 2006/0190481 (2006-08-01), Alspector et al.
patent: 2007/0011324 (2007-01-01), Mehr et al.
patent: 2007/0130263 (2007-06-01), Li et al.
patent: 2007/0239639 (2007-10-01), Loughmiller et al.
CAUCE.org web pages [online] Coalition Against Unsolicited Commercial Email [retrieved Mar. 17, 2003] Retrieved from the Internet: <URL: http://www.cauce.org/about/problem.shtml>.
Wikipedia.org web pages [online], Wikipedia, [retrieved Mar. 17, 2003] Retrieved from the Internet: <ULR: http://www.wikipedia.org/w/wiki.phintl?title=machine learning and printable=yes>.
Outlook.spambully.com web pages [online] Spam Bully [retrieved Jan. 16, 2003] Copyright 2002, Retrieved from the Internet <URL: http://outlook.spambully.com/about.php>.
“Technical Responses to Spam,” Nov. 2003, Taughannock Networks.
Kularski, C. “Compound Procedures for Spam Control,” Highland School of Technology, Jan. 2004.
NBEC/NWOCA Anti-Spam Tools, [online] [retrieved Jul. 7, 2004] retrived from http://home.nwoca.org, Jul. 7, 2004.
Cranor, Faith, L., LaMacchia, Brian A., “Spam!” Communications of the ACM, vol. 41, No. 8, pp. 74-83, Aug. 1998. U.S.A.
How it Works:Spam Recognition, http://www.death2spam.net/docs/classifier.html, retrieved Aug. 18, 2005, U.S.A.
Cavnar, William B. et al., “N-Gram-Based Text Categorization”, Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, NV., USA, Apr. 13, 1994.
“N-Gram-Based Text Categorization”, 2 pages, downloaded from http://citeseer.ist.psu.edu/68861.html, Aug. 25, 2005 U.S.A.
TextCat Language Guesser, 2 pages, downloaded from http:/odur.let.rug.nl/˜vannoord/Textcat/ on Aug. 25, 2005., U.S.A.
Spam Assassin, The Apache SpamAssasin Project, 2 pages, downloaded from http:/spamassasin.apache.org on Aug. 25, 2005, U.S.A.
Basis Technology's Rosette Language Identifier, 2 pages, downloaded from http:/www.basistech.com/language-identification/ on Aug. 25, 2005, U.S.A.
Karp-Rabin algorithm, 3 pages, downloaded from http:/www.igm.univ-mlv.fr/˜lecroq/string
ode5.html on Sep. 1, 2005, U.S.A.
Rabin-Karp string search algorithm, 5 pages, downloaded from http://en.wikipedia.org/wiki/Rabin-Karp—string—search—alogrithm on Aug. 31, 2005 U.S.A.
The Rabin-Karp algorithm, String searching via Hashing, 5 pages, downloaded from http://www.eecs.harvard.edu/˜ellard/Q-97/HTML/root
ode43 on Aug. 31, 2005 U.S.A.

Affiliated with

Also associated with

Rating

Bulk electronic message detection by header similarity analysis does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bulk electronic message detection by header similarity analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bulk electronic message detection by header similarity analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4094190