180 search results - page 6 / 36 » Learning random walks to rank nodes in graphs |
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
EMNLP
2008
13 years 9 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...
ACL
2006
13 years 9 months ago
2006
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...