256 search results - page 11 / 52 » Sparse random graphs with clustering |
INFOCOM
2003
IEEE
14 years 23 days ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...