Sampling in online social networks
Pages 845 - 849
Abstract
In this paper, we propose a new graph sampling method for online social networks that achieves the following. First, a sample graph should reflect the ratio between the number of nodes and the number of edges of the original graph. Second, a sample graph should reflect the topology of the original graph. Third, sample graphs should be consistent with each other when they are sampled from the same original graph. The proposed method employs two techniques: hierarchical community extraction and densification power law. The proposed method partitions the original graph into a set of communities to preserve the topology of the original graph. It also uses the densification power law which captures the ratio between the number of nodes and the number of edges in online social networks. In experiments, we use several real-world online social networks, create sample graphs using the existing methods and ours, and analyze the differences between the sample graph by each sampling method and the original graph.
References
[1]
R. Kumar, J. Novak, and A Tomkins, "Structure and Evolution of Online Social Networks," In Proc. of Int'l. Conf. on Knowledge Discovery and Data, KDD, pp. 611--617, 2006.
[2]
S. Das, O. Egecioglu, and A. El Abbadi, "Anonimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs," IEEE Transactions on Knowledge and Data Engineering, Vol. 24, No. 4, pp. 590--604, 2012.
[3]
S. H. Yoon et al., "Extraction of a Latent Blog Community Based on Subject," In Proc. of ACM Int Int'l. Conf. on Information and Knowledge Management, ACM CIKM, pp. 1529--1532, 2009.
[4]
J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations," In Proc. of ACM Int'l. Conf. on Knowledge Discovery and Data Mining, ACM SIGKDD, pp. 177--187, 2005.
[5]
J. Leskovec and C. Faloutsos, "Sampling from Large Graphs," In Proc. of ACM Int'l. Conf. on Knowledge Discovery and Data Mining, ACM SIGKDD, pp. 631--636, 2006.
[6]
H C. Hübler et al., "Metropolis Algorithms for Representative Subgraph Sampling," In Proc. of IEEE Int'l. Conf. on Data Mining, ICDM, pp. 283--292, 2008.
[7]
S. Lee, P. Kim, and H. Jeong, "Statistical Properties of Sampled Networks," Physical Review E, Vol. 73, 2006.
[8]
A. Clauset, M. Newman, and C. Moore, "Finding Community Structure in Very Large Networks," Physical Review E, Vol. 70, 2004.
[9]
A. Barabasi, "Linked: The New Science of Networks," American Journal of Physics, Vol. 71, pp. 409, 2003.
[10]
D. Chakrabarti et al., "Fully Automatic Cross-Associations," In Proc. Int'l Conf. on Knowledge Discovery and Data Mining, KDD, pp. 79--88, 2004.
[11]
N. Friedman and S. Russell, "Image Segmentation in Video Sequences: A Probabilistic Approach," In Proc. 13th Conf. Uncertainty in Artificial Intelligence, 1997.
[12]
G. Karypis, E. H. Han, and V. Kumar, "Chameleon: A Hierarchical Clustering Algorithm Using Dynamic Modeling," IEEE Computer, Vol. 32, No. 8, pp. 68--75, 1999.
Recommendations
A community-based sampling method using DPL for online social networks
In this paper, we propose a new graph sampling method for online social networks that achieves the following. First, a sample graph should reflect the ratio between the number of nodes and the number of edges of the original graph. Second, a sample ...
Albatross sampling: robust and effective hybrid vertex sampling for social graphs
HotPlanet '11: Proceedings of the 3rd ACM international workshop on MobiArchNowadays, Online Social Networks (OSNs) have become dramatically popular and the study of social graphs attracts the interests of a large number of researchers. One critical challenge is the huge size of the social graph, which makes the graph analyzing ...
Unbiased sampling in directed social graph
SIGCOMM '10Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is a directed graph instead of an undirected graph. Recently, due to the ...
Comments
Information & Contributors
Information
Published In
March 2014
1890 pages
ISBN:9781450324694
DOI:10.1145/2554850
- Conference Chairs:
- Yookun Cho,
- Sung Y. Shin,
- Program Chairs:
- Sangwook Kim,
- Chih-Cheng Hung,
- Jiman Hong
Copyright © 2014 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 March 2014
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
SAC 2014
Sponsor:
Acceptance Rates
SAC '14 Paper Acceptance Rate 218 of 939 submissions, 23%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 107Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in