Calculating web page importance

Data processing: database and file management or data structures – Database and file access – Post processing of search results

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S706000

Reexamination Certificate

active

08069167

ABSTRACT:
The page ranking technique described herein employs a Markov Skeleton Mirror Process (MSMP), which is a particular case of Markov Skeleton Processes, to model and calculate page importance scores. Given a web graph and its metadata, the technique builds an MSMP model on the web graph. It first estimates the stationary distribution of a EMC and views it as transition probability. It next computes the mean staying time using the metadata. Finally, it calculates the product of transition probability and mean staying time, which is actually the stationary distribution of MSMP. This is regarded as page importance.

REFERENCES:
patent: 2007/0100653 (2007-05-01), Ramer
patent: 2008/0114750 (2008-05-01), Saxena
patent: 2008/0250009 (2008-10-01), Xie et al.
patent: 2008/0270377 (2008-10-01), Liu
patent: 2009/0006388 (2009-01-01), Ives
patent: 2009/0029687 (2009-01-01), Ramer
Zhang et al., “An Efficient Algorithm to Rank Web Resources,” Journal Computer Networks, Jun. 2000.
Eirinaki et al., “Web Path Recommendations based on Page Ranking and Markov Models,” Proceedings of the 7thannual ACM international workship on Web information and data management, 2005.
Song et al., “Information Flow Modeling based on Diffusion Rate for Prediction and Ranking,” May 2007.
Berberich, K., M. Vazirgiannis, and G. Weikum, T-Rank: Time-aware authority ranking, Algorithms and Models for the Web-Graph: Third Int'l Workshop, WAW'04, pp. 131-142, Oct. 2004, Springer-Verlag.
Berberich, K., M. Vazirgiannis, and G. Weikum, Time-aware authority ranking, Internet Mathematics, pp. 301-332, vol. 2, No. 3, Apr. 2005, A K Peters Ltd.
Bianchini, M., M. Gori, and F. Scarselli, Inside PageRank, ACM Trans. on Internet Tech., pp. 92-128, vol. 5, No. 1, Feb. 2005, ACM New York, NY, USA.
Boldi, P., M. Santini, and S. Vigna, PageRank as a function of the damping factor, Proc. of the 14th Int'l Conf. on World Wide Web, pp. 557-566, May 2005, ACM New York, NY, USA.
Brin, S., and L. Page, The anatomy of a large-scale hypertextual Web search engine, Comp. Networks and ISDN Systems, pp. 107-117, vol. 30, Apr. 1998.
Dominich, S., PageRank: Quantitative model of interaction information retrieval, Proc. of the 12th Int'l World Wide Web Conf., Int'l Workshop on Mobile Web Technologies WF7, May 2003, pp. 13-18.
Gyöngyi, Z., H. Garcia-Molina, and J. Pedersen, Combating web spam with TrustRank, 30th Int'l Conf. on Very Large Data Bases, VLDB '04, pp. 576-587, Jan. 2004, Toronto, Canada.
Haveliwala, T., Efficient computation of PageRank, Technical Report 1999-31, Sep. 1999.
Haveliwala, T., S. Kamvar, and G. Jeh, An analytical comparison of approaches to personalizing PageRank, Stanford University Technical Report, Jul. 2003.
Haveliwala, T. H., Topic-sensitive PageRank, Proceedings of the Eleventh Int'l World Wide Web Conf., Honolulu, Hawaii, May 2002, pp. 517-526, ACM New York, NY, USA.
Hou, Z., Z. Liu, and J. Zou, Markov skeleton processes, Chinese Science Bulletin, vol. 43, No. 11, pp. 881-889, Jun. 1998.
Jindal, A., C. Crutchfield, S. Goel, R. Kolluri, and R. Jain, the mobile web is structurally different, Proc. of the 11th IEEE Global Internet Symposium, Apr. 2008.
Kleinberg, J. M., Authoritative sources in a hyperlinked environment, pp. 668-677, Jan. 1998, Symposium on Discrete Algorithms (SODA), Philadelphia, PA, USA.
Langville, A. N., and C. D. Meyer, Deeper inside PageRank, Internet Mathematics, pp. 335-400, vol. 1, No. 3, Oct. 2004.
Liu, Y., B. Gao, T. Liu, Y. Zhang, Z. Ma, S. He, and H. Li, BrowseRank: Letting users vote for page importance, SIGIR, pp. 451-458, Jul. 2008, ACM New York, NY, USA.
McSherry, F., A uniform approach to accelerated PageRank computation, Proc. of the 14th Int'l Conf. on World Wide Web, pp. 575-582, May 2005, ACM New York, NY, USA.
Morrison, D. S., Jan. 10, 2008, Google algorithm in need of serious overhaul for mobile web?, Retrieved Feb. 3, 2009 from http://moconews.net/article/419-google-algorithm-in-need-of-serious-overhaul-for-mobile-web/.
Page, L., S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, Jan. 1998.
Patrick, A., Jul. 25, 2008, Pagerank, Browserrank and the search for Google's achilles heel, retrieved Feb. 3, 2009 from http://www.broadstuff.com/archives/1096-Pagerank,-Browserank-and-the-search-for-Googles-achilles-heel. html, pp. 1-3.
Richardson, M. and P. Domingos, The intelligent surfer: Probabilistic combination of link and content information in PageRank, Advances in Neural Information Processing Sys's, pp. 1441-1448, Dec. 2002, MIT Press.
Yu, P. S., X. Li, and B. Liu, Adding the temporal dimension to search—A case study in publication search, Proc. of the 2005 IEEE/WIC/ACM Int'l Conf. on Web Intelligence, pp. 543-549, Sep. 2005, ACM New York, NY, USA.
Yin, X., W. S. Lee, Optimization of web page for mobile devices, 13th Int'l World Wide Web Conf., pp. 345-354, May 2004, New York, NY.
Yin, X., W. S. Lee, Using link analysis to improve layout on mobile devices, May 2004, http://people.cs.und.edu/˜wenchen/reference/adapt/yin.pdf.

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

Calculating web page importance does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Calculating web page importance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Calculating web page importance will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4276223

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