Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

EDBTW
2004
Springer

favoriteEmaildiscussreport

116views Software Engineering» more EDBTW 2004»

A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph

13 years 10 months ago

A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph

Download www.ilab.sztaki.hu

Dániel Fogaras, Balázs Rácz

Real-time Traffic

EDBTW 2004 | Software Engineering |

claim paper

Related Content

» Scaling linkbased similarity search

» Fast Random Walk Graph Kernel

» FactRank Random Walks on a Web of Facts

» Relational linkbased ranking

» Graph fibrations graph isomorphism and PageRank

» Extracting Link Spam using Biased Random Walks from Spam Seed Sets

» AggregateRank bringing order to web sites

» Fast computation of SimRank for static and dynamic information networks

» SourceRank relevance and trust assessment for deep web sources based on intersource agreem...

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	EDBTW
Authors	Dániel Fogaras, Balázs Rácz

Comments (0)