Data processing: database and file management or data structures – Database and file access – Post processing of search results
Reexamination Certificate
2003-09-16
2010-06-15
Jalil, Neveen Abel (Department: 2165)
Data processing: database and file management or data structures
Database and file access
Post processing of search results
Reexamination Certificate
active
07739281
ABSTRACT:
Systems and methods for ranking Web pages based on hyperlink information in a manner that is resistant to nepotistic links are provided. In one embodiment, a Web search service is provided for returning quality query results. The vulnerability of existing ranking algorithms, such as PageRank, to Web pages that are artificially generated for the sole purpose of inflating the score of target page(s) is addressed. Intuitively, it is recognized that it is less likely to reach a particular page on a Web server having many pages via a random jump than it is to reach a particular page on a Web server having few pages, which implies that the influence of such a page upon another page by linking to, or endorsing, the other page is diminished. Thus, in various non-limiting embodiments, each Web server, not each Web page, is assigned a guaranteed minimum score. This minimum score assigned to a server can then be divided among all the pages on that Web server.
REFERENCES:
patent: 2935732 (1960-05-01), Guerber
patent: 6285999 (2001-09-01), Page
patent: 6963867 (2005-11-01), Ford et al.
patent: 2002/0078045 (2002-06-01), Dutta
patent: 2004/0034633 (2004-02-01), Rickard
patent: 04160540 (1992-05-01), None
Bharat et al., Improved Algorithms for Topic Distillation in a Hyperlinked Environment, Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pp. 104-111, ACM, 1998.
Dhyani, D. et al, “Deriving and Verifying Statistical Distribution of a Hyperlink-Based Web Page Quality Metric;”Data&Knowledge Engineering, 2003; vol. 46, No. 3, pp. 291-315.
Upstill, T., “Query-Independent Evidence in Home Page Finding;”ACM Transactions on Information Systems; 2003; vol. 21, No. 23 , pp. 286-313.
Haveliwala, Taher H., “Topic-Sensitive PageRank: A Context-Sensitive Ranking Alborithm for Web Search;”IEEE Transactions on Knowledge and Data Engineering; 2003; 15(4), 784-796.
Devanshu, D., “A Survey of Web Metrics;”ACM Computing Surveys; 2002; 34(4), 469-503.
Thelwall, M., “Subject Gateway Sites and Search Engine Ranking;”Online Information Review, 2002, 26(2), 101-107.
Rafiei,D., “What Is This Page Known For? Computing Web Page Reputations;”Computer Networks, 2000; 33(1-6), 823-835.
Henzinger, M.R., “Measuring Index Quality Using Random Walks on the Web;”Computer Networks1999; 31(11-16),1291-1303.
Brin, S., “The Anatomy of a Large-Scale Hypertextual Web Search Engine;”Computer Networks and ISDN Systems;1998; 30(1-7),107-117.
Song, Ju-ping, et al., “Improved PageRank Algorithm for Ordering Web Pages;”Journal of Shanghai Jiaotong University; Shanghai Jiaotung University Press, China, Mar. 2003; vol. 37, No. 3, pp. 397-400 (English Abstract attached).
Chen, Yen-Yu, et al.“I/O-Efficient Techniques for Computing Pagerank;”CIKM, 2002, 549-557.
Z. Chen, et al. “A Unified Framework for Web Link Analysis;”WISE, 2002, Proceedings of the Third International Conference on Web Information Systems Engineering, IEEE Comput. Sci, 2002; 63-70.
Pretto, L, “A Theoretical Analysis of Google's PageRank;”Proceedings of 9thInternational Symposium, String Processing and Information Retrieval 2002, Sep. 11-13, 2002, Lisbon, Portugal; Springer-Verlag, Germany, 2002; (Lecture Notes in Computer Science, vol. 2476), pp. 131-144.
Baeza-Yates, R. et al. “Web Structure, Dynamics and Page Quality;”Proceedings of 9thInternational Symposium, String Processing and Information Retrieval 2002, Sep. 11-13, 2002, Lisbon, Portugal; Springer-Verlag, Germany, 2002; (Lecture Notes on Computer Science, vol. 2476), pp. 117-130.
Pandurangan, G., “Using PageRank to Characterize Web Structure;”Proceedings of 8thAnnual International Conference, Computing and Combinatorics(COCOON)2002, Aug. 15-17, 2002, Singapore; Springer-Verlag, Germany, 2002; (Lecture Notes in Computer Science, vol. 2387), pp. 330-339.
Kim, S.J., et al. “An Improved Computation of the PageRank Algorithm;”Proceedings of 24thBCS-IRSG European Colloquium on IR Research, Advances in Information Retrieval, Mar. 25-27, 2002, Glasgow, UK; Springer-Verlag, Germany, 2002; (Lecture Notes in Computer Science, vol. 2291), pp. 73-85.
Kamvar, S.D. et al., “Exploiting the Block Structure of the Web for Computing PageRank”,Technical Report, 2003, 1-13, XP-002301858.
Page, L. et al., “The PageRank Citation Ranking: Bringing Order to the Web”,Technical Report, 1998, 1-17, XP-002213518.
Thelwall, M., “Conceptualizing Documentation on the Web: An Evaluation of Different Heuristic-Based Models for Counting Links between University Web Sites”,Journal of the American Society for Information Science and Technology Wiley for ASIS, 2002, 53(12), 1-18, XP-002301859.
Abel Jalil Neveen
Hicks Michael J
Microsoft Corporation
Woodcock & Washburn LLP
LandOfFree
Systems and methods for ranking documents based upon... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods for ranking documents based upon..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for ranking documents based upon... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4215541