paper-with-me

Papers Graph Sampling

“Graph Sampling” 태그가 달린 논문 101편 · 필터 해제

Sampling From Large Graphs

2006-08-21 · KDD 2006 8 · Jure Leskovec, Christos Faloutsos

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.), but several of them become impractical …

Graph SamplingNatural Questions
← 이전 101–101 / 101