Sciweavers

Share
162 search results - page 2 / 33
» Local Graph Partitioning using PageRank Vectors
Sort
View
IICS
2010
Springer
9 years 4 months ago
Local Aspects of the Global Ranking of Web Pages
Started in 1998, the search engine Google estimates page importance using several parameters. PageRank is one of those. Precisely, PageRank is a distribution of probability on the ...
Fabien Mathieu, Laurent Viennot
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
10 years 16 days ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
ICITA
2005
IEEE
9 years 5 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak
ICPADS
2005
IEEE
9 years 5 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
ITA
2006
163views Communications» more  ITA 2006»
9 years 3 days ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
books