2004 search results - page 1 / 401 » Sampling from large graphs |
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
CN
2007
13 years 4 months ago
2007
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...