Finding Authorities and Hubs From Link Structures on the World Wide Web (2001)
Download:
ftp://markov.utstat.toronto.edu/jeff/www10-314.ps.
http://www.cs.toronto.edu/~tsap/publications/hubs-
DBLP
CACHED:
|
ftp://markov.utstat.toronto.edu/jeff/www10-314.ps.
http://www.cs.toronto.edu/~tsap/publications/hubs-
DBLP
CACHED:
|
by
Allan Borodin Gareth
,
Gareth O. Roberts
,
Jeffrey S. Rosenthal
,
Panayiotis Tsaparas
In Proceedings of the 10th International World Wide Web Conference, Hong Kong
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Gareth01findingauthorities,
author = {Allan Borodin Gareth and Gareth O. Roberts and Jeffrey S. Rosenthal and Panayiotis Tsaparas},
title = {Finding Authorities and Hubs From Link Structures on the World Wide Web},
booktitle = {In Proceedings of the 10th International World Wide Web Conference, Hong Kong},
year = {2001},
pages = {415--429},
publisher = {ACM Press}
}
author = {Allan Borodin Gareth and Gareth O. Roberts and Jeffrey S. Rosenthal and Panayiotis Tsaparas},
title = {Finding Authorities and Hubs From Link Structures on the World Wide Web},
booktitle = {In Proceedings of the 10th International World Wide Web Conference, Hong Kong},
year = {2001},
pages = {415--429},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best "authorities" for a given topic or query. While such analysis is usually combined with content analysis, there is a sense in which some algorithms are deemed to be "more balanced" and others "more focused".
