Sciweavers

2463 search results - page 71 / 493
» Rankings of Directed Graphs
Sort
View
TKDE
2010
160views more  TKDE 2010»
13 years 7 months ago
Using Proximity Search to Estimate Authority Flow
—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...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...
EMNLP
2010
13 years 7 months ago
Automatic Keyphrase Extraction via Topic Decomposition
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...
Zhiyuan Liu, Wenyi Huang, Yabin Zheng, Maosong Sun
EMNLP
2008
13 years 10 months ago
Learning Graph Walk Based Similarity Measures for Parsed Text
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...
Einat Minkov, William W. Cohen
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 10 months ago
PageRank and the random surfer model
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....
Prasad Chebolu, Páll Melsted
BMCBI
2008
91views more  BMCBI 2008»
13 years 9 months ago
PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval
Background: Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships fr...
Jimmy J. Lin