Crowd crawling: towards collaborative data collection for large-scale online social networks

Cong Ding, Yang Chen, Xiaoming Fu
{"title":"Crowd crawling: towards collaborative data collection for large-scale online social networks","authors":"Cong Ding, Yang Chen, Xiaoming Fu","doi":"10.1145/2512938.2512958","DOIUrl":null,"url":null,"abstract":"The emerging research for online social networks (OSNs) requires a huge amount of data. However, OSN sites typically enforce restrictions for data crawling, such as request rate limiting on a per-IP basis. It becomes challenging for an individual research group to collect sufficient data by using its own network resources. In this paper, we introduce and motivate crowd crawling, which allows multiple research groups to efficiently crawl data in a collaborative way. Crowd crawling is carefully designed by addressing several practical challenges including resource diversity of different partners, strict request rate limiting from OSN providers, and data fidelity. We implemented and deployed a crowd crawling prototype on PlanetLab, and demonstrated its performance through evaluations. We have made the datasets crawled in our evaluation publicly available.","PeriodicalId":304931,"journal":{"name":"Conference on Online Social Networks","volume":"137 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Online Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2512938.2512958","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

Abstract

The emerging research for online social networks (OSNs) requires a huge amount of data. However, OSN sites typically enforce restrictions for data crawling, such as request rate limiting on a per-IP basis. It becomes challenging for an individual research group to collect sufficient data by using its own network resources. In this paper, we introduce and motivate crowd crawling, which allows multiple research groups to efficiently crawl data in a collaborative way. Crowd crawling is carefully designed by addressing several practical challenges including resource diversity of different partners, strict request rate limiting from OSN providers, and data fidelity. We implemented and deployed a crowd crawling prototype on PlanetLab, and demonstrated its performance through evaluations. We have made the datasets crawled in our evaluation publicly available.
人群爬行:面向大规模在线社交网络的协同数据收集
新兴的在线社交网络研究需要大量的数据。但是,OSN站点通常会对数据爬行实施限制,例如基于每个ip的请求速率限制。对于一个单独的研究小组来说,利用自己的网络资源收集足够的数据变得具有挑战性。在本文中,我们引入并激励了群体爬行,它允许多个研究小组以协作的方式高效地爬行数据。通过解决不同合作伙伴的资源多样性、OSN提供商严格的请求速率限制和数据保真度等实际挑战,对人群爬行进行了精心设计。我们在PlanetLab上实现并部署了一个人群爬行原型,并通过评估展示了它的性能。我们已经公开了我们评估中抓取的数据集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信