Methods and systems for identifying manipulated articles

Data processing: presentation processing of document – operator i – Operator interface – For plural users or sites

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C715S854000

Reexamination Certificate

active

10732048

ABSTRACT:
Systems and methods that identify manipulated articles are described. In one embodiment, a search engine implements a method comprising determining at least one cluster comprising a plurality of articles, analyzing signals to determine an overall signal for the cluster, and determining if the articles are manipulated articles based at least in part on the overall signal.

REFERENCES:
patent: 6006222 (1999-12-01), Culliss
patent: 6014665 (2000-01-01), Culliss
patent: 6038561 (2000-03-01), Snyder et al.
patent: 6078916 (2000-06-01), Culliss
patent: 6182068 (2001-01-01), Culliss
patent: 6185559 (2001-02-01), Brin et al.
patent: 6285999 (2001-09-01), Page
patent: 6460036 (2002-10-01), Herz
patent: 6526440 (2003-02-01), Bharat
patent: 6529903 (2003-03-01), Smith et al.
patent: 6598054 (2003-07-01), Schuetze et al.
patent: 6615209 (2003-09-01), Gomes et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6678681 (2004-01-01), Brin
patent: 6725259 (2004-04-01), Bharat
patent: 6754873 (2004-06-01), Law et al.
patent: 6868525 (2005-03-01), Szabo
patent: 2002/0042791 (2002-04-01), Smith et al.
patent: 2002/0059708 (2002-05-01), Zhang et al.
patent: 2002/0069114 (2002-06-01), Charette et al.
patent: 2002/0123988 (2002-09-01), Dean et al.
patent: 2002/0133481 (2002-09-01), Smith et al.
patent: 2004/0024752 (2004-02-01), Manber et al.
patent: 2004/0119740 (2004-06-01), Change et al.
patent: 2004/0122811 (2004-06-01), Page
patent: 2004/0267725 (2004-12-01), Harik et al.
patent: 2005/0065959 (2005-03-01), Smith et al.
patent: 2005/0071224 (2005-03-01), Fikes et al.
patent: 2005/0071741 (2005-03-01), Acharya et al.
patent: 2005/0114198 (2005-05-01), Koningstein et al.
Brin, Sergey et al., “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” 1998, Computer Science Department, Stanford University, Stanford, CA.
Bryan, Kurt and Leise, Tanya, “The $25,000,000,000★ Eigenvector The Linear Algebra Behind Google,” Society for Industrial and Applied Mathematics. vol. 48,No. 3,pp. 569-581, 13 pages.
Dourisbourne, et al. “Extraction and Classification of Dense Communities in the Web,” WWW 2007, May 8-12, 2007, Banff, Alberta Canada, 10 pages.
Fetterly, et al., “Spam, Damn Spam, and Statistics,” Seventh Int'l Workshop on the Web and Databases, (WebDB 2004) Jun. 17-18, 2004, Paris, France. 6 pages.
Gibson, et al., “Discovering Large Dense Subparagraphs in Massive Graphs,” Proceedings of the 31stVLDB Conference, Trondheim, Norway, 2005, 12 pages.
Henzinger, et al., “Challenges in Web Search Engines,” Oct. 17, 2002, 14 pages.
Wikipedia—Bipartite Graph, [online] [retrieved May 15, 2007] Retrieved from http://en.wikipedia.org/w/index.php?title=Bipartite—graph&printable=yes , 3 pages.
Wikipedia—Link Farm, [online] [retrieved May 15, 2007] Retrieved from http://en.wikipedia.org/w/index.php?title=Link—farm&printable=yes , 3 pages.
Wikipedia—Spamdexing, [online] [retrieved May 15, 2007] Retrieved from http://en.wikipedia.org/w/index.php?title=Spamdexing&printable=yes , 5 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Methods and systems for identifying manipulated articles does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and systems for identifying manipulated articles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and systems for identifying manipulated articles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3806203

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.