180 search results - page 5 / 36 » Learning random walks to rank nodes in graphs |
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
NAACL
2010
14 years 7 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
183
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
WEBI
2005
Springer
15 years 2 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
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...