SGP: a social network sampling method based on graph partition
by Xiaolin Du; Dan Wang; Yunming Ye; Yan Li; Yueping Li
International Journal of Information Technology and Management (IJITM), Vol. 18, No. 2/3, 2019

Abstract: A representative sample of a social network is essential for many internet services that rely on accurate analysis. A good sampling method for social network should be able to generate small sample network with similar structures and distributions as its original network. In this paper, a sampling algorithm based on graph partition, sampling based on graph partition (SGP), is proposed to sample social networks. SGP firstly partitions the original network into several sub-networks, and then samples in each sub-network evenly. This procedure enables SGP to effectively maintain the topological similarity and community structure similarity between the sampled network and its original network. Finally, we evaluate SGP on several well-known datasets. The experimental results show that SGP method outperforms seven state-of-the-art methods.

Online publication date: Thu, 23-May-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology and Management (IJITM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email