Open AccessProceedings Article
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence Page,Sergey Brin,Rajeev Motwani,Terry Winograd +3 more
- Vol. 98, pp 161-172
TLDR
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.Abstract:
The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the relative importance of Web pages. This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them. We compare PageRank to an idealized random Web surfer. We show how to efficiently compute PageRank for large numbers of pages. And, we show how to apply PageRank to search and to user navigation.read more
Citations
More filters
Book ChapterDOI
Trust management for the semantic web
TL;DR: A web of trust is employed, in which each user maintains trusts in a small number of other users, and these trusts are composed into trust values for all other users.
Book
Complex Networks: Structure, Robustness and Function
Reuven Cohen,Shlomo Havlin +1 more
TL;DR: This chapter discusses random network models, which are based on the Erdos-Renyi models, and their application in the context of complex networks, where distances in scale-free networks are small and distances in complex networks are large.
Proceedings ArticleDOI
GraphChi: large-scale graph computation on just a PC
TL;DR: GraphChi as mentioned in this paper is a disk-based system for computing efficiently on graphs with billions of edges, using a well-known method to break large graphs into small parts, and a novel parallel sliding windows method.
Proceedings ArticleDOI
AdaRank: a boosting algorithm for information retrieval
TL;DR: The proposed novel learning algorithm, referred to as AdaRank, repeatedly constructs 'weak rankers' on the basis of reweighted training data and finally linearly combines the weak rankers for making ranking predictions, which proves that the training process of AdaRank is exactly that of enhancing the performance measure used.
Proceedings ArticleDOI
Expertise networks in online communities: structure and algorithms
TL;DR: This study analyzes the Java Forum, a large online help-seeking community, using social network analysis methods and tests a set of network-based ranking algorithms on this large size social network in order to identify users with high expertise.
References
More filters
Journal Article
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Sergey Brin,Lawrence Page +1 more
TL;DR: Google as discussed by the authors is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.
Journal ArticleDOI
Efficient crawling through URL ordering
TL;DR: In this paper, the authors study in what order a crawler should visit the URLs it has seen, in order to obtain more "important" pages first, and they show that a good ordering scheme can obtain important pages significantly faster than one without.
Proceedings ArticleDOI
Silk from a sow's ear: extracting usable structures from the Web
TL;DR: This paper presents the exploration into techniques that utilize both the topology and textual similarity between items as well as usage data collected by servers and page meta-information lke title and size.
Proceedings ArticleDOI
HyPursuit: a hierarchical network search engine that exploits content-link hypertext clustering
TL;DR: Experience with HyPursuit suggests that abstraction functions based on hypertext clustering can be used to construct meaningful and scalable cluster hierarchies, and is encouraged by preliminary results on clustering based on both document contents and hyperlink structures.
Journal ArticleDOI
The quest for correct information on the Web: hyper search engines
TL;DR: This paper presents a novel method to extract from a web object its “hyper” informative content, in contrast with current search engines, which only deal with the “textual’ informative content.