733 search results - page 62 / 147 » Recommending random walks |
NIPS
2008
14 years 11 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
CN
2000
14 years 9 months ago
2000
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
15 years 4 months ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...