Sciweavers

2463 search results - page 4 / 493
» Rankings of Directed Graphs
Sort
View
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 3 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko
WWW
2010
ACM
14 years 2 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
COCOON
2008
Springer
13 years 9 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 1 months ago
Relational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
Floris Geerts, Heikki Mannila, Evimaria Terzi
EKAW
2008
Springer
13 years 9 months ago
Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations
In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency c...
Gaël Dias, Raycho Mukelov, Guillaume Cleuziou