10 search results - page 1 / 2 » Metropolis Algorithms for Representative Subgraph Sampling |
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....
WWW
2010
ACM
13 years 12 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
SDM
2009
SIAM
14 years 2 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...
WWW
2006
ACM
14 years 5 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
BMCBI
2008
13 years 5 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...