2100 search results - page 72 / 420 » Learning to rank on graphs |
EMNLP
2008
14 years 11 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
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...
121
click to vote
TKDE
2010
14 years 8 months ago
2010
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
EMNLP
2010
14 years 7 months ago
2010
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....