A new learning automata‐based sampling algorithm for social networks

Summary Recently, studying social networks plays a significant role in many applications of social network analysis, from the studying the characterization of network to that of financial applications. Due to the large data and privacy issues of social network services, there is only a limited local access to the whole network data in a reasonable amount of time. Therefore, network sampling arises to studying the characterization of real networks such as communication, technological, information, and social networks. In this paper, a sampling algorithm for complex social networks that is based on a new version of distributed learning automata (DLA) reported recently called extended DLA (eDLA) is proposed. For evaluation purpose, the eDLA-based sampling algorithm has been tested on several test networks and the obtained experimental results are compared with the results obtained for a number of well-known sampling algorithms in terms of relative error and Kolmogorov–Smirnov test. It is shown that eDLA-based sampling algorithm outperforms the existing sampling algorithms. Experimental results further show that the eDLA-based sampling algorithm in comparison with the DLA-based sampling algorithm has a 26.93% improvement for the average of Kolmogorov–Smirnov value for degree distribution taken over all test networks. Copyright © 2015 John Wiley & Sons, Ltd.

[1]  Joel J. P. C. Rodrigues,et al.  Intelligent Mobile Video Surveillance System as a Bayesian Coalition Game in Vehicular Sensor Networks: Learning Automata Approach , 2015, IEEE Transactions on Intelligent Transportation Systems.

[2]  Hosung Park,et al.  Sampling bias in user attribute estimation of OSNs , 2013, WWW '13 Companion.

[3]  Jianguo Lu,et al.  Sampling online social networks by random walk , 2012, HotSocial '12.

[4]  Shou-De Lin,et al.  Semantically sampling in heterogeneous social networks , 2013, WWW '13 Companion.

[5]  Qi Gao,et al.  An improved sampling method of complex network , 2014 .

[6]  Rana Forsati,et al.  Effective Page Recommendation Algorithms Based on Distributed Learning Automata , 2009 .

[7]  Mohammad Reza Meybodi,et al.  Sampling from complex networks using distributed learning automata , 2014 .

[8]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[9]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[10]  Mir Mohammad Alipour.  A Learning Automata Based Algorithm For Solving Capacitated Vehicle Routing Problem , 2012 .

[11]  Nick Koudas,et al.  Sampling Online Social Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[12]  Hawoong Jeong,et al.  Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Soon-Hyung Yook,et al.  Statistical properties of sampled networks by random walks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Sampling from complex networks with high community structures. , 2012, Chaos.

[15]  Petros Nicopolitidis,et al.  On low-complexity adaptive wireless push-based data broadcasting , 2014, Int. J. Commun. Syst..

[16]  HasanzadehMohammad,et al.  Grid resource discovery based on distributed learning automata , 2014 .

[17]  Mohammad Reza Meybodi,et al.  Finding Minimum Vertex Covering in Stochastic Graphs: A Learning Automata Approach , 2015, Cybern. Syst..

[18]  Xuesong Lu,et al.  Sampling Connected Induced Subgraphs Uniformly at Random , 2012, SSDBM.

[19]  Matthew J. Salganik,et al.  Assessing respondent-driven sampling , 2010, Proceedings of the National Academy of Sciences.

[20]  Athina Markopoulou,et al.  Towards Unbiased BFS Sampling , 2011, IEEE Journal on Selected Areas in Communications.

[21]  Colin Cooper,et al.  A fast algorithm to find all high degree vertices in power law graphs , 2012, WWW.

[22]  Petros Nicopolitidis.  Performance fairness across multiple applications in wireless push systems , 2015, Int. J. Commun. Syst..

[23]  Ove Frank,et al.  Survey sampling in networks , 2011 .

[24]  Xueqi Cheng,et al.  Mobile social networks: state-of-the-art and a new vision , 2012, Int. J. Commun. Syst..

[25]  P. Venkata Krishna,et al.  Secure socket layer certificate verification: a learning automata approach , 2014, Secur. Commun. Networks.

[26]  Donald F. Towsley,et al.  Sampling directed graphs with random walks , 2012, 2012 Proceedings IEEE INFOCOM.

[27]  Mohammad Reza Meybodi,et al.  Distributed optimization Grid resource discovery , 2014, The Journal of Supercomputing.

[28]  B. R. Harita,et al.  Learning automata with changing number of actions , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[29]  Mohammad Reza Meybodi,et al.  Clustering the wireless Ad Hoc networks: A distributed learning automata approach , 2010, J. Parallel Distributed Comput..

[30]  Mohammad Reza Meybodi,et al.  Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata , 2015, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[31]  Petros Nicopolitidis,et al.  On the efficient use of multiple channels by single-receiver clients in wireless data broadcasting , 2014, Int. J. Commun. Syst..

[32]  Nasser Yazdani,et al.  A Novel Community Detection Algorithm for Privacy Preservation in Social Networks , 2012, ISI.

[33]  Hamid R. Rabiee,et al.  Characterizing Twitter with Respondent-Driven Sampling , 2011, 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing.

[34]  P. Venkata Krishna,et al.  Learning automata as a utility for power management in smart grids , 2013, IEEE Communications Magazine.

[35]  Bing-Hong Liu,et al.  Virus infection control in online social networks based on probabilistic communities , 2014, Int. J. Commun. Syst..

[36]  Lei Li,et al.  User communities and contents co‐ranking for user‐generated content quality evaluation in social networks , 2016, Int. J. Commun. Syst..

[37]  Minas Gjoka,et al.  Multigraph Sampling of Online Social Networks , 2010, IEEE Journal on Selected Areas in Communications.

[38]  Jianwei Niu,et al.  Sampling from social network to maintain community structure , 2014, Int. J. Commun. Syst..

[39]  Athanasios V. Vasilakos,et al.  Albatross sampling: robust and effective hybrid vertex sampling for social graphs , 2011, HotPlanet '11.

[40]  Pan-Jun Kim,et al.  Reliability of rank order in sampled networks , 2005, physics/0702148.

[41]  Shimon Even,et al.  Graph Algorithms: Contents , 2011 .

[42]  Shimon Even,et al.  Graph Algorithms , 1979 .

[43]  Tanya Y. Berger-Wolf,et al.  Sampling community structure , 2010, WWW '10.

[44]  Walter Willinger,et al.  Sizing up online social networks , 2010, IEEE Network.

[45]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.

[46]  Mohammad Reza Meybodi,et al.  Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems , 2006, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[47]  Mohammad Reza Meybodi,et al.  Grid resource discovery based on distributed learning automata , 2014, Computing.

[48]  Mohammad Reza Meybodi,et al.  A distributed adaptive landmark clustering algorithm based on mOverlay and learning automata for topology mismatch problem in unstructured peer‐to‐peer networks , 2017, Int. J. Commun. Syst..

[49]  Athina Markopoulou,et al.  On the bias of BFS (Breadth First Search) , 2010, 2010 22nd International Teletraffic Congress (lTC 22).

[50]  Michel L. Goldstein,et al.  Problems with fitting to the power-law distribution , 2004, cond-mat/0402322.

[51]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[52]  Mohammad Reza Meybodi,et al.  Solving maximum clique problem in stochastic graphs using learning automata , 2012, 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN).

[53]  Mohammad Reza Meybodi,et al.  Decreasing Impact of SLA Violations:A Proactive Resource Allocation Approachfor Cloud Computing Environments , 2014, IEEE Transactions on Cloud Computing.

[54]  Mohammad Reza Meybodi,et al.  Learning Automata Based Face-Aware Mobicast , 2014, Wirel. Pers. Commun..

[55]  Mohammad Reza Meybodi,et al.  Extended distributed learning automata , 2014, Applied Intelligence.

[56]  Neeraj Kumar,et al.  Collaborative-Learning-Automata-Based Channel Assignment With Topology Preservation for Wireless Mesh Networks Under QoS Constraints , 2015, IEEE Systems Journal.

[57]  Minas Gjoka,et al.  Walking on a graph with a magnifying glass: stratified sampling via weighted random walks , 2011, PERV.

[58]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[59]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[60]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[61]  Mark S Handcock,et al.  7. Respondent-Driven Sampling: An Assessment of Current Methodology , 2009, Sociological methodology.

[62]  Feng Xia,et al.  Bio-inspired packet dropping for ad-hoc social networks , 2017, Int. J. Commun. Syst..

[63]  Erik M. Volz,et al.  Probability based estimation theory for respondent driven sampling , 2008 .

[64]  Xin Xu,et al.  Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling , 2012, SIGMETRICS '12.

[65]  Mohsen Guizani,et al.  Stochastic learning automata-based channel selection in cognitive radio/dynamic spectrum access for WiMAX networks , 2015, Int. J. Commun. Syst..

[66]  Mohammad S. Obaidat,et al.  Networks of learning automata for the vehicular environment: a performance analysis study , 2014, IEEE Wireless Communications.

[67]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[68]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[69]  Mohammad S. Obaidat,et al.  Collaborative Learning Automata-Based Routing for Rescue Operations in Dense Urban Regions Using Vehicular Sensor Networks , 2015, IEEE Systems Journal.

[70]  Jing Wang,et al.  Unbiased Sampling of Bipartite Graph , 2011, 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery.

[71]  Donald F. Towsley,et al.  On Set Size Distribution Estimation and the Characterization of Large Networks via Sampling , 2012, IEEE Journal on Selected Areas in Communications.