Improved algorithms for topic distillation in a hyperlinked environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Automatic resource compilation by analyzing hyperlink structure and associated text
WWW7 Proceedings of the seventh international conference on World Wide Web 7
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Efficient crawling through URL ordering
WWW7 Proceedings of the seventh international conference on World Wide Web 7
The connectivity server: fast access to linkage information on the Web
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Breadth-first crawling yields high-quality pages
Proceedings of the 10th international conference on World Wide Web
ACM Transactions on Internet Technology (TOIT)
Stable algorithms for link analysis
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 11th international conference on World Wide Web
I/O-efficient techniques for computing pagerank
Proceedings of the eleventh international conference on Information and knowledge management
Toward a Qualitative Search Engine
IEEE Internet Computing
Mining the Web's Link Structure
Computer
Web Structure, Dynamics and Page Quality
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Using PageRank to Characterize Web Structure
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Extrapolation methods for accelerating PageRank computations
WWW '03 Proceedings of the 12th international conference on World Wide Web
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
Adaptive on-line page importance computation
WWW '03 Proceedings of the 12th international conference on World Wide Web
Design and Implementation of a High-Performance Distributed Web Crawler
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Generalizing PageRank: damping functions for link-based ranking algorithms
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Estimating the global pagerank of web communities
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient and decentralized PageRank approximation in a peer-to-peer web search network
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Dynamic personalized pagerank in entity-relation graphs
Proceedings of the 16th international conference on World Wide Web
Using neighbors to date web documents
Proceedings of the 9th annual ACM international workshop on Web information and data management
Local approximation of PageRank and reverse PageRank
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Local approximation of pagerank and reverse pagerank
Proceedings of the 17th ACM conference on Information and knowledge management
Web Page Rank Prediction with PCA and EM Clustering
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Local computation of PageRank contributions
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Local computation of PageRank: the ranking side
Proceedings of the 20th ACM international conference on Information and knowledge management
DIGRank: using global degree to facilitate ranking in an incomplete graph
Proceedings of the 20th ACM international conference on Information and knowledge management
Scalable manipulation of archival web graphs
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Efficient personalized pagerank with accuracy assurance
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Privacy preserving release of blogosphere data in the presence of search engines
Information Processing and Management: an International Journal
The power of local information in PageRank
Proceedings of the 22nd international conference on World Wide Web companion
Exploring the future of out-of-core computing with compute-local non-volatile memory
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
A Local Method for ObjectRank Estimation
Proceedings of International Conference on Information Integration and Web-based Applications & Services
Hi-index | 0.00 |
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link analysis to assign a global importance score to each web page. The PageRank scores of all the pages are usually determined off-line in a large-scale computation on the entire hyperlink graph of the web, and several recent studies have focused on improving the efficiency of this computation, which may require multiple hours on a workstation. However, in some scenarios, such as online analysis of link evolution and mining of large web archives such as the Internet Archive, it may be desirable to quickly approximate or update the PageRanks of individual nodes without performing a large-scale computation on the entire graph. We address this problem by studying several methods for efficiently estimating the PageRank score of a particular web page using only a small subgraph of the entire web. In our model, we assume that the graph is accessible remotely via a link database (such as the AltaVista Connectivity Server) or is stored in a relational database that performs lookups on disks to retrieve node and connectivity information. We show that a reasonable estimate of the PageRank value of a node is possible in most cases by retrieving only a moderate number of nodes in the local neighborhood of the node.