Walk, not wait: Faster sampling over online social networks

Azade Nazi, Zhuojie Zhou, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das

Research output: Contribution to journalConference article

10 Citations (Scopus)

Abstract

In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.

Original languageEnglish
Pages (from-to)678-689
Number of pages12
JournalProceedings of the VLDB Endowment
Volume8
Issue number6
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes

Fingerprint

Sampling
Costs
Experiments

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Walk, not wait : Faster sampling over online social networks. / Nazi, Azade; Zhou, Zhuojie; Thirumuruganathan, Saravanan; Zhang, Nan; Das, Gautam.

In: Proceedings of the VLDB Endowment, Vol. 8, No. 6, 01.01.2015, p. 678-689.

Research output: Contribution to journalConference article

Nazi, Azade ; Zhou, Zhuojie ; Thirumuruganathan, Saravanan ; Zhang, Nan ; Das, Gautam. / Walk, not wait : Faster sampling over online social networks. In: Proceedings of the VLDB Endowment. 2015 ; Vol. 8, No. 6. pp. 678-689.
@article{009db2d6046245568520788fa020d7ce,
title = "Walk, not wait: Faster sampling over online social networks",
abstract = "In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.",
author = "Azade Nazi and Zhuojie Zhou and Saravanan Thirumuruganathan and Nan Zhang and Gautam Das",
year = "2015",
month = "1",
day = "1",
doi = "10.14778/2735703.2735707",
language = "English",
volume = "8",
pages = "678--689",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "Very Large Data Base Endowment Inc.",
number = "6",

}

TY - JOUR

T1 - Walk, not wait

T2 - Faster sampling over online social networks

AU - Nazi, Azade

AU - Zhou, Zhuojie

AU - Thirumuruganathan, Saravanan

AU - Zhang, Nan

AU - Das, Gautam

PY - 2015/1/1

Y1 - 2015/1/1

N2 - In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.

AB - In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.

UR - http://www.scopus.com/inward/record.url?scp=85013654150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013654150&partnerID=8YFLogxK

U2 - 10.14778/2735703.2735707

DO - 10.14778/2735703.2735707

M3 - Conference article

AN - SCOPUS:85013654150

VL - 8

SP - 678

EP - 689

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 6

ER -