733 search results - page 29 / 147 » Recommending random walks |
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
116
click to vote
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
IPTPS
2005
Springer
15 years 3 months ago
2005
Springer
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
DAGM
2004
Springer
15 years 3 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...