Randomized algorithms
Clustering in large graphs and matrices
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
The stochastic approach for link-structure analysis (SALSA) and the TKC effect
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
What is this page known for? Computing Web page reputations
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Finding authorities and hubs from link structures on the World Wide Web
Proceedings of the 10th international conference on World Wide Web
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
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search
IEEE Transactions on Knowledge and Data Engineering
ACM Transactions on Internet Technology (TOIT)
Link analysis ranking: algorithms, theory, and experiments
ACM Transactions on Internet Technology (TOIT)
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
ACM Transactions on Internet Technology (TOIT)
Hits on the web: how does it compare?
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Comparing the effectiveness of hits and salsa
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Extrapolation to speed-up query-dependent link analysis ranking algorithms
Proceedings of the 8th International Conference on Frontiers of Information Technology
Contextualization using hyperlinks and internal hierarchical structure of Wikipedia documents
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
Extrapolations are techniques in linear algebra that require little additional infrastructure that must be incorporated in the existing query-dependent Link Analysis Ranking LAR algorithms. Extrapolations in LAR settings relies on the prior knowledge of the iterative process that created the existing data points iterates to compute the new improved data point, which periodically leads to the desired solution faster than the original method. In this study, the author presents novel approaches using extrapolation techniques to speed-up the convergence of query-dependent iterative methods, link analysis based ranking methods, where hyperlink structures are used to determine relative importance of a document in the network of inter-connections. The author uses the framework defined in HITS and SALSA and proposes the use of different Extrapolation techniques for faster ranking. The paper improves algorithms like HITS and SALSA using Extrapolation techniques. With the proposed approaches it is possible to accelerate the iterative ranking algorithms in terms of reducing the number of iterations and increasing the rate of convergence.