Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
On unbiased sampling for unstructured peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Proceedings of the first workshop on Online social networks
Poking facebook: characterization of osn applications
Proceedings of the first workshop on Online social networks
Characterizing privacy in online social networks
Proceedings of the first workshop on Online social networks
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
Unbiased sampling in directed social graph
Proceedings of the ACM SIGCOMM 2010 conference
Who is tweeting on Twitter: human, bot, or cyborg?
Proceedings of the 26th Annual Computer Security Applications Conference
Estimating sizes of social networks via biased sampling
Proceedings of the 20th international conference on World wide web
Proceedings of the 20th international conference on World wide web
Crawling Facebook for social network analysis purposes
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Walking on a graph with a magnifying glass: stratified sampling via weighted random walks
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Measuring and enhancing the social connectivity of UGC video systems: a case study of YouKu
Proceedings of the Nineteenth International Workshop on Quality of Service
A reachability-based access control model for online social networks
Databases and Social Networks
Albatross sampling: robust and effective hybrid vertex sampling for social graphs
HotPlanet '11 Proceedings of the 3rd ACM international workshop on MobiArch
Walking on a graph with a magnifying glass: stratified sampling via weighted random walks
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Socially-aware gateway-based content sharing and backup
Proceedings of the 2nd ACM SIGCOMM workshop on Home networks
Sharing graphs using differentially private graph models
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
The socialbot network: when bots socialize for fame and money
Proceedings of the 27th Annual Computer Security Applications Conference
Proceedings of the fifth ACM international conference on Web search and data mining
Effects of a soft cut-off on node-degree in the Twitter social network
Computer Communications
Framework and algorithms for network bucket testing
Proceedings of the 21st international conference on World Wide Web
Maximizing circle of trust in online social networks
Proceedings of the 23rd ACM conference on Hypertext and social media
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Cryptographic treatment of private user profiles
FC'11 Proceedings of the 2011 international conference on Financial Cryptography and Data Security
Coarse-grained topology estimation via graph sampling
Proceedings of the 2012 ACM workshop on Workshop on online social networks
Space-efficient sampling from social activity streams
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Making recommendations in a microblog to improve the impact of a focal user
Proceedings of the sixth ACM conference on Recommender systems
Density index and proximity search in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
The walls have ears: optimize sharing for visibility and privacy in online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Interest-matching information propagation in multiple online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Beyond friendship: modeling user activity graphs on social network-based gifting applications
Proceedings of the 2012 ACM conference on Internet measurement conference
Enhancing community detection using a network weighting strategy
Information Sciences: an International Journal
Nearly exact mining of frequent trees in large networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Bridge analysis in a Social Internetworking Scenario
Information Sciences: an International Journal
HD-GraphViz: highly distributed graph visualization on tiled displays
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Do online social network friends still threaten my privacy?
Proceedings of the third ACM conference on Data and application security and privacy
Social network analysis of virtual worlds
AMT'12 Proceedings of the 8th international conference on Active Media Technology
Design and analysis of a social botnet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Crawling Social Internetworking Systems
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
curso: protect yourself from curse of attribute inference: a social network privacy-analyzer
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
Learning influence in complex social networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Mining frequent graph patterns with differential privacy
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient single-source shortest path and distance queries on large graphs
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Sampling bias in user attribute estimation of OSNs
Proceedings of the 22nd international conference on World Wide Web companion
Like prediction: modeling like counts by bridging facebook pages with linked data
Proceedings of the 22nd international conference on World Wide Web companion
Does social contact matter?: modelling the hidden web of trust underlying twitter
Proceedings of the 22nd international conference on World Wide Web companion
Estimating clustering coefficients and size of social networks via random walk
Proceedings of the 22nd international conference on World Wide Web
Metric convergence in social network sampling
Proceedings of the 5th ACM workshop on HotPlanet
Analyzing Communication Interaction Networks (CINs) in enterprises and inferring hierarchies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Last call for the buffet: economics of cellular networks
Proceedings of the 19th annual international conference on Mobile computing & networking
Active exploration: simultaneous sampling and labeling for large graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Random walk-based graphical sampling in unbalanced heterogeneous bipartite social graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Crowd crawling: towards collaborative data collection for large-scale online social networks
Proceedings of the first ACM conference on Online social networks
Mixing local and global information for community detection in large networks
Journal of Computer and System Sciences
Supporting distributed feed-following apps over edge devices
Proceedings of the VLDB Endowment
A User-Centric Feature Identification and Modeling Approach to Infer Social Ties in OSNs
Proceedings of International Conference on Information Integration and Web-based Applications & Services
Moving from social networks to social internetworking scenarios: The crawling perspective
Information Sciences: an International Journal
Leveraging Social Feedback to Verify Online Identity Claims
ACM Transactions on the Web (TWEB)
Prediction in a microblog hybrid network using bonacich potential
Proceedings of the 7th ACM international conference on Web search and data mining
PREDIcT: towards predicting the runtime of large scale iterative analytics
Proceedings of the VLDB Endowment
On estimating the average degree
Proceedings of the 23rd international conference on World wide web
Making social interactions accessible in online social networks
Information Services and Use - Mining the Digital Information Networks
Hi-index | 0.00 |
With more than 250 million active users [1], Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased) sample of Facebook users by crawling its social graph. In this quest, we consider and implement several candidate techniques. Two approaches that are found to perform well are the Metropolis-Hasting random walk (MHRW) and a reweighted random walk (RWRW). Both have pros and cons, which we demonstrate through a comparison to each other as well as to the "ground-truth" (UNI - obtained through true uniform sampling of FB userIDs). In contrast, the traditional Breadth-First-Search (BFS) and Random Walk (RW) perform quite poorly, producing substantially biased results. In addition to offline performance assessment, we introduce online formal convergence diagnostics to assess sample quality during the data collection process. We show how these can be used to effectively determine when a random walk sample is of adequate size and quality for subsequent use (i.e., when it is safe to cease sampling). Using these methods, we collect the first, to the best of our knowledge, unbiased sample of Facebook. Finally, we use one of our representative datasets, collected through MHRW, to characterize several key properties of Facebook.