Computer Science > Social and Information Networks
[Submitted on 17 Feb 2021 (v1), last revised 18 Feb 2021 (this version, v2)]
Title:Graph Sampling Approach for Reducing Computational Complexity of Large-Scale Social Network
View PDFAbstract:Online social network services provide a platform for human social interactions. Nowadays, many kinds of online interactions generate large-scale social network data. Network analysis helps to mine knowledge and pattern from the relationship between actors inside the network. This approach is important to support predictions and the decision-making process in many real-world applications. The social network analysis methodology, which borrows approaches from graph theory provides several metrics that enabled us to measure specific properties of the networks. Some of the metrics calculations were built with no scalability in minds, thus it is computationally expensive. In this paper, we propose a graph sampling approach to reduce social network size, thus reducing computation operations. The performance comparison between natural graph sampling strategies using edge random sampling, node random sampling, and random walks are presented on each selected graph property. We found that the performance of graph sampling strategies depends on graph properties measured.
Submission history
From: Andry Alamsyah [view email][v1] Wed, 17 Feb 2021 17:25:09 UTC (1,178 KB)
[v2] Thu, 18 Feb 2021 01:48:28 UTC (1,171 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.