skip to main content
10.1145/775152.775203acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
Article

Adaptive ranking of web pages

Published: 20 May 2003 Publication History

Abstract

In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It is shown that this problem can be solved using the traditional quadratic programming techniques. In addition, it is shown that the number of parameters can be reduced by clustering web pages together through simple clustering techniques. This problem can be formulated and solved using quadratic programming techniques. It is demonstrated experimentally on a relatively large web data set, viz., the WT10G, that it is possible to modify the PageRanks of the web pages through the proposed method using a set of linear constraints. It is also shown that the PageRank of other pages may be affected; and that the quality of the result depends on the clustering technique used. It is shown that our results compared well with those obtained by a HITS based method.

References

[1]
Bianchini, M., Gori, M., Scarselli, F. "Inside PageRank", Tech. Report DII 1/2003, University of Siena, Italy, 2003.
[2]
Brin, S., Page, L. "The anatomy of a large scale hypertextual web search engine". Proceedings of the 7th WWW conference, April, 1998.
[3]
Ng, A.Y., Zheng, A.X., Jordan, M.I. "Stable algorithms for link analysis", in Proceedings of IJCAI-2001, 2001.
[4]
Zhang, D., Dong, Y. "An efficient algorithm to rank web resources", in Proceedings of the 9th WWW Conference, Elsevier Science, 2000.
[5]
Gill, P., Murray, W., Wright, M., Practical Optimization. Academic Press, 1981.
[6]
Chang, H., Cohn, D., McCallum, A.K., "Learning to Create Customized Authority Lists", Proc. 17th International Conf. on Machine Learning, 2000.
[7]
Kleinberg, J., "Authoritative sources in a hyperlinked environment", Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '03: Proceedings of the 12th international conference on World Wide Web
May 2003
772 pages
ISBN:1581136803
DOI:10.1145/775152
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. PageRank
  2. adaptive PageRank determinations
  3. learning PageRank
  4. quadratic programming applications
  5. search engine

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media