Article

Computing personalized pageranks

Authors:

Franco Scarselli,

Ah Chung Tsoi,

Markus HagenbuchnerAuthors Info & Claims

WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters

Pages 382 - 383

https://doi.org/10.1145/1013367.1013486

Published: 19 May 2004 Publication History

Get Access

Abstract

A recently published approach to adaptive page rank, using the solution of quadratic optimization methods with a set of simple constraints, is modified to permit classification of web pages according to their page contents, URLs. This modification allows the approach to be more adapted to the needs of focussed crawlers, or personalized search engines.

References

[1]

Bianchini, M., Gori, M., Scarselli, F. "Inside PageRank", ACM Trasanctions on Internet Technology, 2004 (to appear).

Digital Library

Google Scholar

[2]

Brin, S., Page, L. "The anatomy of a large scale hypertextual web search engine". Proceedings of the 7th WWW conference, April, 1998.

Digital Library

Google Scholar

[3]

Tsoi, A. C., Morini, G., Scarselli, F., Hagenbuchner, M., Maggini, M. "Adaptive ranking of Web pages", in Proceedings of the 12th WWW Conference, 2003.

Digital Library

Google Scholar

[4]

Chang, H., Cohn, D., McCallum A. K., "Learning to Create Customized Authority Lists", Proc. 17th International Conf. on Machine Learning, 2000.

Digital Library

Google Scholar

[5]

Kleinberg J., "Authoritative sources in a hyperlinked environment", Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.

Digital Library

Google Scholar

[6]

Vandenberghe, L., Boyd S., "Semidefinite programming", SIAM, 38(1): 49--95, March 1996.

Digital Library

Google Scholar

Cited By

View all

Xue Z(2021)FRPI: A novel Followee Recommendation approach based on Potential Interest in social networks2021 International Conference on Information Science, Parallel and Distributed Systems (ISPDS)10.1109/ISPDS54097.2021.00030(116-120)Online publication date: Aug-2021
https://doi.org/10.1109/ISPDS54097.2021.00030
Mohamed SNováček VVandenbussche PHaddad HWainwright RChbeir R(2018)Knowledge base completion using distinct subgraph pathsProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167346(1992-1999)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167346
Scarselli FGori MTsoi AHagenbuchner MMonfardini G(2009)The graph neural network modelIEEE Transactions on Neural Networks10.1109/TNN.2008.200560520:1(61-80)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1109/TNN.2008.2005605

Index Terms

Computing personalized pageranks
1. Information systems
  1. Information retrieval

Recommendations

Computing customized page ranks

In this article, we present a new approach to page ranking. The page rank of a collection of Web pages can be represented in a parameterized model, and the user requirements can be represented by a set of constraints. For a particular parameterization, ...
Beyond PageRank: machine learning for static ranking
WWW '06: Proceedings of the 15th international conference on World Wide Web

Since the publication of Brin and Page's paper on PageRank, many in the Web community have depended on PageRank for the static (query-independent) ordering of Web pages. We show that we can significantly outperform PageRank using features that are ...
A personalized search engine based on web-snippet hierarchical clustering
WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web

In this paper we propose a hierarchical clustering engine, called snaket, that is able to organize on-the-fly the search results drawn from 16 commodity search engines into a hierarchy of labeled folders. The hierarchy offers a complementary view to the ...

Comments

Information & Contributors

Information

Published In

WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters

May 2004

532 pages

ISBN:1581139128

DOI:10.1145/1013367

Conference Chairs:
Stuart Feldman
IBM Research
,
Mike Uretsky
New York University
,
Program Chairs:
Marc Najork
Microsoft Research
,
Craig Wills
Worcester Polytechnic Institute

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: 19 May 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

WWW04

Sponsor:

WWW04: The 2004 World Wide Web Conference ( in conjunction with ACM Conference on Electronic Commerce [EC'04])

May 19 - 21, 2004

NY, New York, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
347
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xue Z(2021)FRPI: A novel Followee Recommendation approach based on Potential Interest in social networks2021 International Conference on Information Science, Parallel and Distributed Systems (ISPDS)10.1109/ISPDS54097.2021.00030(116-120)Online publication date: Aug-2021
https://doi.org/10.1109/ISPDS54097.2021.00030
Mohamed SNováček VVandenbussche PHaddad HWainwright RChbeir R(2018)Knowledge base completion using distinct subgraph pathsProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167346(1992-1999)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167346
Scarselli FGori MTsoi AHagenbuchner MMonfardini G(2009)The graph neural network modelIEEE Transactions on Neural Networks10.1109/TNN.2008.200560520:1(61-80)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1109/TNN.2008.2005605

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Computing customized page ranks

Beyond PageRank: machine learning for static ranking

A personalized search engine based on web-snippet hierarchical clustering

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations