Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
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...
From a user's perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering "backlinks&qu...
Soumen Chakrabarti, David Gibson, Kevin S. McCurle...
We explore the application of a graph representation to model similarity relationships that exist among images found on the Web. The resulting similarity-induced graph allows us t...
Barbara Poblete, Benjamin Bustos, Marcelo Mendoza,...
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with ...
B. de la Ossa, Ana Pont, Julio Sahuquillo, Jos&eac...