skip to main content
10.1145/1645953.1646056acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Nonlinear static-rank computation

Published:02 November 2009Publication History

ABSTRACT

Mainstream link-based static-rank algorithms (e.g. PageRank and its variants) express the importance of a page as the linear combination of its in-links and compute page importance scores by solving a linear system in an iterative way. Such linear algorithms, however, may give apparently unreasonable static-rank results for some link structures. In this paper, we examine the static-rank computation problem from the viewpoint of evidence combination and build a probabilistic model for it. Based on the model, we argue that a nonlinear formula should be adopted, due to the correlation or dependence between links. We focus on examining some simple formulas which only consider the correlation between links in the same domain. Experiments conducted on 100 million web pages (with multiple static-rank quality evaluation metrics) show that higher quality static-rank could be yielded by the new nonlinear algorithms. The convergence of the new algorithms is also proved in this paper by nonlinear functional analysis.

References

  1. R. Baeza-Yates, E. Davis. Web Page Ranking using Link Attributes. In WWW 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Berkhin. A Survey on PageRank Computing. Internet Mathematics, 2(1):73--120, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  3. K. Bharat, B.-W. Chang, M. Henzinger and M. Ruhl. Who Links to Whom: Mining Linkage between Web Site. In ICDM 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Bianchini, M. Gori and F. Scarselli. Inside PageRank. ACM Transactions on Internet Technology, 5(1):92--128, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Boldi, M. Santini and S. Vigna. PageRank as a Function of the Damping Factor. In WWW 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Z. Gyongyi, H. Garcie-Molina and J. Pedersen. Combating Web Spam with TrustRank. In VLDB 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. T. H. Haveliwala. Topic-Sensitive PageRank. In WWW 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Jarvelin and J. Kekalainen. IR evaluation Methods for Retrieving Highly Relevant Documents. In SIGIR 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Kamvar, T. Haveliwala, C. Manning and G. Golub. Extrapolation Methods for Accelerating the Computation of PageRank. In WWW 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Kamvar, T. Haveliwala, C. Manning and G. Golub. Exploiting the Block Structure of the Web for Computing PageRank. Technical Report, Stanford University, 2003.Google ScholarGoogle Scholar
  11. M. G. Kendall. Rank Correlation Methods, 4th edition. Griffin, London, 1970.Google ScholarGoogle Scholar
  12. J. M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. In Proceedings of ACM-SLAM Symposium on Discrete Algorithms, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M.A. Krasnoselskii and P.P. Zabreiko. Geometric Methods in Nonlinear Analysis, Springer-Verlag, Berlin, 1984.Google ScholarGoogle ScholarCross RefCross Ref
  14. A. Y. Ng, A. X. Zheng and M. I. Jordan. Stable Algorithms for Link Analysis. In SIGIR 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. L. Page, S. Brin, R. Motwani and T. Winograd. The PageRank Citation Ranking: Bring Order to the Web. Technical report, Stanford University Database Group, 1998.Google ScholarGoogle Scholar
  16. M. Richardson and P. Domingos. The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank. In NIPS 2002.Google ScholarGoogle Scholar
  17. S. E. Robertson. Overview of Okapi Projects. Journal of Documentation, 53(1):3--7, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  18. S. Shi, R. Song, and J.-R. Wen. Latent Additivity: Combining Homogeneous Evidence. Technical report, MSR-TR-2006-110, Microsoft Research, August 2006.Google ScholarGoogle Scholar
  19. P. Tsaparas. Using Non-Linear Dynamical Systems for Web Searching and Ranking. PODS, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. B. Wu and B. D. Davison. Identifying Link Farm Spam Pages. In WWW 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. G.-R. Xue, Q. Yang, H.-J. Zeng, Y. Yu and Z. Chen. Exploiting the Hierarchical Structure for Link Analysis. In SIGIR, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. E. Yilmaz, J. Aslam and S. Robertson. A New Rank Correlation Coefficient for Information Retrieval. In Proc. of the 31st Annual International ACM SIGIR Conference. July 20--24, 2008, Singapore. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. H. Zhang, M. Zhu, S. Shi, and J.-R. Wen. Employing Topic Models for Pattern-based Semantic Class Discovery. In Proc. of the Annual Meeting of the Association for Computational Linguistics (ACL'09), Singapore, August 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Nonlinear static-rank computation

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge management
      November 2009
      2162 pages
      ISBN:9781605585123
      DOI:10.1145/1645953

      Copyright © 2009 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 November 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,861of8,427submissions,22%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader