180 search results - page 33 / 36 » Learning random walks to rank nodes in graphs |
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
106
click to vote
ICML
2008
IEEE
16 years 12 days ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
ICML
2007
IEEE
16 years 12 days ago
2007
IEEE
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
112
click to vote
PC
2007
14 years 11 months ago
2007
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
118
click to vote
NIPS
2004
15 years 1 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...