3 search results - page 1 / 1 » Clustered low rank approximation of graphs in information sc... |
SDM
2011
SIAM
12 years 7 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
KDD
2007
ACM
14 years 5 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...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...