Corpus ID: 1508503

The PageRank Citation Ranking : Bringing Order to the Web

@inproceedings{Page1999ThePC,
  title={The PageRank Citation Ranking : Bringing Order to the Web},
  author={Lawrence Page and Sergey Brin and Rajeev Motwani and Terry Winograd},
  booktitle={WWW 1999},
  year={1999}
}
The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. [...] Key Method 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.Expand
Local Aspects of the Global Ranking of Web Pages
TLDR
The purpose is to show that the PageRank can be decomposed into two terms, internal and external PageRank, which allow a better comprehension of thePageRank sig- nification inside and outside a site. Expand
Beyond PageRank: machine learning for static ranking
TLDR
This work shows that it can significantly outperform PageRank using features that are independent of the link structure of the Web, and uses RankNet, a ranking machine learning algorithm, to combine these and other static features based on anchor text and domain characteristics. Expand
The Effect of New Links on Google Pagerank
TLDR
It is concluded that a Web page benefits from links inside its Web community and on the other hand irrelevant links penalize the Web pages and their Web communities. Expand
THE PERSONALIZED PAGERANK BASED ON USER BEHAVIORS
TLDR
This work proposes a new personalized ranking vector--UserRank (UR) based on user behaviors of browsing pages to estimate the importance of Web pages and demonstrates that the P2R algorithm can more closely reflect user preference and more largely improve the precision of ranking results. Expand
Associated Pagerank: A Content Relevance Weighted Pagerank Algorithm
Pagerank algorithm is a link analysis approach to evaluate the importance of web pages, and there are many techniques to improve the traditional Pagerank algorithm to prevent from the biases of linkExpand
Predictive ranking: a novel page ranking approach by estimating the web structure
TLDR
This work proposes a new variant of the PageRank algorithm called, Predictive Ranking (PreR), in which different classes of dangling pages are analyzed individually so that the link structure can be predicted more accurately. Expand
Upgradation of PageRank Algorithm based upon Time Spent on Web Page and its Link Structure
TLDR
A time-based approach is proposed as an extension to PageRank and is defined incrementally, which lays more stress on link structure of a page. Expand
Page Ranking: Summary
TLDR
Here pageranking is compared to idealized random surfing of net and some methods of converging pagerank based on ordering of pages are discussed. Expand
Title Predictive ranking : a novel page ranking approach byestimating the web structure
PageRank (PR) is one of the most popular ways to rank web pages. However, as the Web continues to grow in volume, it is becoming more and more difficult to crawl all the available pages. As a result,Expand
PageSim: a novel link-based measure of web page aimilarity
TLDR
This paper introduces a novel link-based similarity measure, called PageSim, which can measure similarity between any two web pages, whereas SimRank cannot in some cases. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
ParaSite: Mining Structural Information on the Web
TLDR
The varieties of link information (not just hyperlinks) on the Web, how the Web differs from conventional hypertext, and how the links can be exploited to build useful applications are discussed. Expand
The Anatomy of a Large-Scale Hypertextual Web Search Engine
TLDR
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want. Expand
The Quest for Correct Information on the Web: Hyper Search Engines
TLDR
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. Expand
Efficient Crawling Through URL Ordering
TLDR
This paper studies in what order a crawler should visit the URLs it has seen, in order to obtain more "important" pages first, and shows that a Crawler with a good ordering scheme can obtain important pages significantly faster than one without. Expand
Silk from a sow's ear: extracting usable structures from the Web
TLDR
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. Expand
Showing the context of nodes in the World-Wide Web
TLDR
This paper talks about a method to show the context of nodes in the World-Wide Web with respect to landmark nodes and implemented the method in the Navigational View Builder, a tool for forming effective visualizations of hyperme@a systems. Expand
Characterizing World Wide Web ecologies
TLDR
The primary goal of the research presented here is to put forth new techniques and models that can be used to help efficiently manage people's attentional processes when dealing with large, unstructured, heterogeneous information environments. Expand
HyPursuit: a hierarchical network search engine that exploits content-link hypertext clustering
TLDR
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. Expand
Visualizing complex hypermedia networks through multiple hierarchical views
TLDR
This work proposes an algorithm based on content and structural analysis to form hierarchies from hypermedia networks using multiple hierarchical views, which can be visualized in various ways to help the user better comprehend the information. Expand
Randomized Algorithms
TLDR
These notes describe other important illustrations of randomized algo rithms in other areas of the theory of algorithms and describe some basic principles which typically underly the construction of randomized algorithms. Expand
...
1
2
...