Sciweavers

9849 search results - page 3 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
WWW
2004
ACM
14 years 6 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
WWW
2004
ACM
14 years 6 months ago
Outlink estimation for pagerank computation under missing data
The enormity and rapid growth of the web-graph forces quantities such as its pagerank to be computed under missing information consisting of outlinks of pages that have not yet be...
Sreangsu Acharyya, Joydeep Ghosh
SIGIR
2002
ACM
13 years 5 months ago
PageRank, HITS and a unified framework for link analysis
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hon...
ALGORITHMICA
2011
13 years 1 months ago
Exact Algorithms for Cluster Editing: Evaluation and Experiments
Sebastian Böcker, Sebastian Briesemeister, Gu...
WEBDB
2007
Springer
133views Database» more  WEBDB 2007»
14 years 5 days ago
EntityAuthority: Semantically Enriched Graph-Based Authority Propagation
This paper pursues the recently emerging paradigm of searching for entities that are embedded in Web pages. We utilize informationextraction techniques to identify entity candidat...
Julia Stoyanovich, Srikanta J. Bedathur, Klaus Ber...