Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval
Reexamination Certificate
2011-05-24
2011-05-24
Kim, Charles (Department: 2157)
Data processing: database and file management or data structures
Database and file access
Preparing data for information retrieval
C707S738000, C707S798000
Reexamination Certificate
active
07949661
ABSTRACT:
An improved system and method is provided for identifying web communities from seed sets of web pages. A seed set of web pages may be represented as a set of seed vertices of a graph representing a collection of web pages. An initial probability distribution may be constructed on vertices of the graph by assigning a nonzero value to the vertices belonging to the seed set. Then a sequence of probability distributions may be produced on the vertices of the graph by modifying the probability distribution over a series of one-step walks of the probability distribution over the vertices of the graph. For each probability distribution produced in the sequence, level sets of vertices may be generated, and a level set with minimal conductance may be selected for each probability distribution. The level set with the least conductance may then be output representing a community of web pages.
REFERENCES:
patent: 6272507 (2001-08-01), Pirolli et al.
patent: 6654743 (2003-11-01), Hogg et al.
patent: 6799176 (2004-09-01), Page
patent: 2002/0112082 (2002-08-01), Ko et al.
patent: 2002/0129014 (2002-09-01), Kim et al.
patent: 2003/0120630 (2003-06-01), Tunkelang
patent: 2004/0111412 (2004-06-01), Broder
patent: 2005/0086260 (2005-04-01), Canright et al.
patent: 2005/0149502 (2005-07-01), McSherry
patent: 2005/0216533 (2005-09-01), Berkhin
patent: 2006/0122998 (2006-06-01), Bar-Yossef et al.
patent: 2008/0082481 (2008-04-01), Joshi et al.
patent: 2008/0243813 (2008-10-01), Liu
patent: 2008/0275902 (2008-11-01), Burges et al.
GW Flake, S Lawrence, CL Giles, Efficient identification of Web communities, 2000, ACM.
DA Spielman, SH Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, 2004, ACM.
Jon M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 46(5):604-632, 1999.
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan,and Andrew Tomkins. Trawling the Web for Emerging Cyber-communities. Computer Networks (Amsterdam, Netherlands: 1999).
Daniel A. Spielman and Shang-Hua Teng. Nearly-linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems. In ACM STOC-04, pp. 81-90, New.
Reid Andersen, Kevin J. Lang, Communities from Seed Sets, pp. 223-232, Proceedings of the 15th International Conference on World Wide Web, May 23-26, 2006, Edinburgh.
Andersen Reid Marlow
Lang Kevin John
Baker & Botts L.L.P.
Kim Charles
Mueller Kurt
Yahoo ! Inc.
LandOfFree
System and method for identifying web communities from seed... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for identifying web communities from seed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for identifying web communities from seed... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2652010