2079 search results - page 105 / 416 » Universality of random graphs |
156
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
173
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
146
click to vote
IV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
171
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
111
click to vote
GI
2004
Springer
15 years 9 months ago
2004
Springer
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...