{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:25:20Z","timestamp":1778347520747,"version":"3.51.4"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T00:00:00Z","timestamp":1502755200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10489-017-1005-1","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T21:12:16Z","timestamp":1502745136000},"page":"1054-1081","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A streaming sampling algorithm for social activity networks using fixed structure learning automata"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5222-2532","authenticated-orcid":false,"given":"Mina","family":"Ghavipour","sequence":"first","affiliation":[]},{"given":"Mohammad Reza","family":"Meybodi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,15]]},"reference":[{"key":"1005_CR1","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/1150402.1150479","volume-title":"Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD \u201906","author":"J Leskovec","year":"2006","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD \u201906. ACM Press, New York, p 631"},{"key":"1005_CR2","doi-asserted-by":"publisher","unstructured":"Ebbes P, Huang Z, Rangaswamy A (2012) Subgraph sampling methods for social networks: the good, the bad, and the ugly. SSRN Electron J. doi:\n                        10.2139\/ssrn.1580074","DOI":"10.2139\/ssrn.1580074"},{"key":"1005_CR3","doi-asserted-by":"publisher","unstructured":"Lee SH, Kim P-J, Jeong H (2006) Statistical properties of sampled networks. Phys Rev E 73:16102. doi:\n                        10.1103\/PhysRevE.73.016102","DOI":"10.1103\/PhysRevE.73.016102"},{"key":"1005_CR4","doi-asserted-by":"publisher","first-page":"46114","DOI":"10.1103\/PhysRevE.75.046114","volume":"75","author":"S Yoon","year":"2007","unstructured":"Yoon S, Lee S, Yook S-H, Kim Y (2007) Statistical properties of sampled networks by random walks. Phys Rev E 75:46114. doi:\n                        10.1103\/PhysRevE.75.046114","journal-title":"Phys Rev E"},{"key":"1005_CR5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.engappai.2017.01.004","volume":"59","author":"M Ghavipour","year":"2017","unstructured":"Ghavipour M, Meybodi MR (2017) Irregular cellular learning automata-based algorithm for sampling social networks. Eng Appl Artif Intell 59:244\u2013259","journal-title":"Eng Appl Artif Intell"},{"key":"1005_CR6","doi-asserted-by":"publisher","first-page":"4284","DOI":"10.1016\/j.comnet.2007.06.004","volume":"51","author":"V Krishnamurthy","year":"2007","unstructured":"Krishnamurthy V, Faloutsos M, Chrobak M et al (2007) Sampling large Internet topologies for simulation purposes. Comput Networks 51:4284\u20134302. doi:\n                        10.1016\/j.comnet.2007.06.004","journal-title":"Comput Networks"},{"key":"1005_CR7","doi-asserted-by":"crossref","unstructured":"H\u00fcbler C, Kriegel H-P, Borgwardt K, Ghahramani Z (2008) Metropolis algorithms for representative subgraph sampling. In: 2008 8th IEEE international conference on data mining. IEEE, pp 283\u2013292","DOI":"10.1109\/ICDM.2008.124"},{"key":"1005_CR8","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1109\/JSAC.2011.111005","volume":"29","author":"M Kurant","year":"2011","unstructured":"Kurant M, Markopoulou A, Thiran P (2011) Towards unbiased BFS sampling. IEEE J Sel Areas Commun 29:1799\u20131809. doi:\n                        10.1109\/JSAC.2011.111005","journal-title":"IEEE J Sel Areas Commun"},{"key":"1005_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.physa.2015.01.030","volume":"424","author":"A Rezvanian","year":"2015","unstructured":"Rezvanian A, Meybodi MR (2015) Sampling social networks using shortest paths. Phys A Stat Mech Appl 424:254\u2013268. doi:\n                        10.1016\/j.physa.2015.01.030","journal-title":"Phys A Stat Mech Appl"},{"key":"1005_CR10","doi-asserted-by":"publisher","unstructured":"Rezvanian A, Meybodi MR (2015) A new learning automata-based sampling algorithm for social networks. Int J Commun Syst, n\/a-n\/a. doi:\n                        10.1002\/dac.3091","DOI":"10.1002\/dac.3091"},{"key":"1005_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/2601438","volume":"8","author":"NK Ahmed","year":"2014","unstructured":"Ahmed NK, Neville J, Kompella R (2014) Network sampling: from static to streaming graphs. ACM Trans Knowl Discov Data 8:7. doi:\n                        10.1145\/2601438","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1005_CR12","first-page":"623","volume-title":"Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms","author":"Z Bar-Yossef","year":"2002","unstructured":"Bar-Yossef Z, Kumar R, Sivakumar D (2002) Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, San Francisco, California, pp 623\u2013632"},{"key":"1005_CR13","first-page":"607","volume-title":"Proceedings of the 32nd international conference on very large data bases","author":"CC Aggarwal","year":"2006","unstructured":"Aggarwal CC (2006) On biased reservoir sampling in the presence of stream evolution. In: Proceedings of the 32nd international conference on very large data bases, pp 607\u2013618"},{"key":"1005_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970397","volume":"58","author":"AD Sarma","year":"2011","unstructured":"Sarma AD, Gollapudi S, Panigrahy R (2011) Estimating PageRank on graph streams. J ACM 58:1\u201319. doi:\n                        10.1145\/1970392.1970397","journal-title":"J ACM"},{"key":"1005_CR15","doi-asserted-by":"crossref","unstructured":"Buriol LS, Frahling G, Leonardi S et al (2006) Counting triangles in data streams. In: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. ACM, pp 253\u2013262","DOI":"10.1145\/1142351.1142388"},{"key":"1005_CR16","doi-asserted-by":"crossref","first-page":"975","DOI":"10.14778\/1920841.1920964","volume":"3","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC, Li Y, Yu PS, Jin R (2010) On dense pattern mining in graph streams. Proc VLDB Endow 3:975\u2013984","journal-title":"Proc VLDB Endow"},{"key":"1005_CR17","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/1.9781611972801.42","volume-title":"Proceedings of the 2010 SIAM international conference on data mining SIAM","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC, Zhao Y, Yu PS (2010) On clustering graph streams. In: Proceedings of the 2010 SIAM international conference on data mining SIAM, pp 478\u2013489"},{"key":"1005_CR18","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1109\/TKDE.2010.67","volume":"22","author":"L Chen","year":"2010","unstructured":"Chen L, Wang C (2010) Continuous subgraph pattern search over certain and uncertain graph streams. IEEE Trans Knowl Data Eng 22:1093\u20131109","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1005_CR19","first-page":"271","volume-title":"Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems - Pod. \u201905","author":"G Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S (2005) Space efficient mining of multigraph streams. In: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems - Pod. \u201905. ACM Press, New York, p 271"},{"key":"1005_CR20","first-page":"1","volume-title":"Proceedings 8th Work. Min. Learn. with Graphs - MLG \u201910","author":"NK Ahmed","year":"2010","unstructured":"Ahmed NK, Berchmans F, Neville J, Kompella R (2010) Time-based sampling of social network activity graphs Proceedings 8th Work. Min. Learn. with Graphs - MLG \u201910. ACM Press, New York, pp 1\u20139"},{"key":"1005_CR21","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Zhao Y, Philip SY (2011) Outlier detection in graph streams. In: 27th IEEE international conference on data engineering 2011 (ICDE 2011). IEEE, pp 399\u2013409","DOI":"10.1109\/ICDE.2011.5767885"},{"key":"1005_CR22","doi-asserted-by":"crossref","first-page":"46132","DOI":"10.1103\/PhysRevE.64.046132","volume":"64","author":"EM Jin","year":"2001","unstructured":"Jin EM, Girvan M, Newman MEJ (2001) Structure of growing social networks. Phys Rev E 64:46132","journal-title":"Phys Rev E"},{"key":"1005_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00298ED1V01Y201009DMK003","volume":"2","author":"L Tang","year":"2010","unstructured":"Tang L, Liu H (2010) Community detection and mining in social media. Synth Lect Data Min Knowl Discov 2:1\u2013137","journal-title":"Synth Lect Data Min Knowl Discov"},{"key":"1005_CR24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1081870.1081893","volume-title":"Proceedings of the Elev. ACM SIGKDD international conference on knowledge discovery and data mining - KDD \u201905","author":"J Leskovec","year":"2005","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time. In: Proceedings of the Elev. ACM SIGKDD international conference on knowledge discovery and data mining - KDD \u201905. ACM Press, New York, p 177"},{"key":"1005_CR25","doi-asserted-by":"crossref","unstructured":"Kumar R, Novak J, Tomkins A (2010) Structure and evolution of online social networks. In: Link min Model algorithms Appl. Springer, pp 337\u2013357","DOI":"10.1007\/978-1-4419-6515-8_13"},{"key":"1005_CR26","first-page":"4221","volume-title":"Proceedings of the Natl. Acad. Sci. U. S. A. National Acad Sciences","author":"MP Stumpf","year":"2005","unstructured":"Stumpf MP, Wiuf C, May RM (2005) Subnets of scale-free networks are not scale-free: sampling properties of networks. In: Proceedings of the Natl. Acad. Sci. U. S. A. National Acad Sciences, pp 4221\u20134224"},{"key":"1005_CR27","doi-asserted-by":"crossref","unstructured":"Ahn Y-Y, Han S, Kwak H et al (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on world wide web. ACM, pp 835\u2013844","DOI":"10.1145\/1242572.1242685"},{"key":"1005_CR28","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP et al (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement. ACM, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"key":"1005_CR29","doi-asserted-by":"crossref","unstructured":"Wilson C, Boe B, Sala A et al (2009) User interactions in social networks and their implications. In: Proceedings of the 4th ACM european conference on computer systems. ACM, pp 205\u2013 218","DOI":"10.1145\/1519065.1519089"},{"key":"1005_CR30","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1214\/aoms\/1177705148","volume":"32","author":"LA Goodman","year":"1961","unstructured":"Goodman LA (1961) Snowball sampling. Ann Math Stat 32:148\u2013170","journal-title":"Ann Math Stat"},{"key":"1005_CR31","first-page":"1","volume-title":"Proceedings of the IEEE Infocom. IEEE","author":"M Gjoka","year":"2010","unstructured":"Gjoka M, Kurant M, Butts CT, Markopoulou A (2010) Walking in Facebook: A case study of unbiased sampling of OSNs 2010. In: Proceedings of the IEEE Infocom. IEEE, pp 1\u20139"},{"key":"1005_CR32","doi-asserted-by":"crossref","unstructured":"Ye S, Lang J, Wu F (2010) Crawling online social graphs. In: The 12th international Asia-Pacific web conference (APWeb 2010). IEEE, pp 236\u2013242","DOI":"10.1109\/APWeb.2010.10"},{"key":"1005_CR33","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/2392622.2392628","volume-title":"Proceedings of the 1st ACM international workshop on hot topics on interdisciplinary social networks research - hotsocial \u201912","author":"J Lu","year":"2012","unstructured":"Lu J, Li D (2012) Sampling online social networks by random walk. In: Proceedings of the 1st ACM international workshop on hot topics on interdisciplinary social networks research - hotsocial \u201912. ACM Press, New York, pp 33\u201340"},{"key":"1005_CR34","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/1993744.1993773","volume-title":"Proceedings of the ACM SIGMETRICS Jt. international conference on measurement and modeling of computer systems - SIGMETRICS \u201911","author":"M Kurant","year":"2011","unstructured":"Kurant M, Gjoka M, Butts CT, Markopoulou A (2011) Walking on a graph with a magnifying glass. In: Proceedings of the ACM SIGMETRICS Jt. international conference on measurement and modeling of computer systems - SIGMETRICS \u201911. ACM Press, New York, p 281"},{"key":"1005_CR35","doi-asserted-by":"crossref","unstructured":"Rasti AH, Torkjazi M, Rejaie R et al (2009) Respondent-driven sampling for characterizing unstructured overlays. In: IEEE INFOCOM 2009. IEEE, pp 2701\u20132705","DOI":"10.1109\/INFCOM.2009.5062215"},{"key":"1005_CR36","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2254756.2254795","volume-title":"Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Jt. international conference on measurement and modeling of computer systems - SIGMETRICS \u201912","author":"C-H Lee","year":"2012","unstructured":"Lee C-H, Xu X, Eun DY et al (2012) Beyond random walk and metropolis-hastings samplers. In: Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Jt. international conference on measurement and modeling of computer systems - SIGMETRICS \u201912. ACM Press, New York, p 319"},{"key":"1005_CR37","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TNET.2008.2001730","volume":"17","author":"D Stutzbach","year":"2009","unstructured":"Stutzbach D, Rejaie R, Duffield N et al (2009) On unbiased sampling for unstructured peer-to-peer networks. IEEE\/ACM Trans Netw 17:377\u2013390","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1005_CR38","doi-asserted-by":"crossref","unstructured":"Ribeiro B, Towsley D (2010) Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Conf. Internet Meas. ACM, pp 390\u2013403","DOI":"10.1145\/1879141.1879192"},{"key":"1005_CR39","doi-asserted-by":"crossref","unstructured":"Avrachenkov K, Ribeiro B, Towsley D (2010) Improving random walk estimation accuracy with uniform restarts. In: Int. Work. Algorithms Model. Web-Graph. Springer, pp 98\u2013109","DOI":"10.1007\/978-3-642-18009-5_10"},{"key":"1005_CR40","unstructured":"Thathachar MAL, Sastry PS (2011) Networks of learning automata: techniques for online stochastic optimization. Springer Science & Business Media"},{"key":"1005_CR41","doi-asserted-by":"publisher","unstructured":"Narendra KS, Thathachar MAL (2012) Learning automata: an introduction. doi:\n                        10.1109\/TSMCB.2002.1049606","DOI":"10.1109\/TSMCB.2002.1049606"},{"key":"1005_CR42","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.elerap.2016.10.002","volume":"20","author":"M Ghavipour","year":"2016","unstructured":"Ghavipour M, Meybodi MR (2016) An adaptive fuzzy recommender system based on learning automata. Electron Commer Res Appl 20:105\u2013115","journal-title":"Electron Commer Res Appl"},{"key":"1005_CR43","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1007\/s12293-016-0183-4","volume":"8","author":"MR Mirsaleh","year":"2016","unstructured":"Mirsaleh MR, Meybodi MR (2016) A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem. Memetic Comput 8:2112\u2013222. doi:\n                        10.1007\/s12293-016-0183-4","journal-title":"Memetic Comput"},{"key":"1005_CR44","first-page":"1345","volume":"22","author":"M Tsetlin","year":"1961","unstructured":"Tsetlin M (1961) On behaviour of finite automata in random medium. Avtom I Telemekhanika 22:1345\u20131354","journal-title":"Avtom I Telemekhanika"},{"key":"1005_CR45","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A -L, Albert R (1999) Emergence of scaling in random networks. Science (80-) 286:509\u2013512","journal-title":"Science (80-)"},{"key":"1005_CR46","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si A-L (2000) Error and attack tolerance of complex networks. Nature 406:378\u2013382","journal-title":"Nature"},{"key":"1005_CR47","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-642-59412-0_15","volume-title":"Softw. Pioneers","author":"R Bayer","year":"2002","unstructured":"Bayer R, Mccreight E (2002) Organization and maintenance of large ordered indexes. In: Softw. Pioneers. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 245\u2013262"},{"key":"1005_CR48","doi-asserted-by":"publisher","unstructured":"Gleich DF (2012) Graph of flickr photo-sharing social network crawled in May 2006. doi:\n                        10.4231\/D39P2W550","DOI":"10.4231\/D39P2W550"},{"key":"1005_CR49","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1592665.1592675","volume-title":"Proceedings 2nd ACM work Online soc. networks - WOSN \u201909","author":"B Viswanath","year":"2009","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: Proceedings 2nd ACM work Online soc. networks - WOSN \u201909. ACM Press, New York, p 37"},{"key":"1005_CR50","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford Large Network Dataset Collection"},{"key":"1005_CR51","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1140\/epjb\/e2004-00316-5","volume":"41","author":"ML Goldstein","year":"2004","unstructured":"Goldstein ML, Morris SA, Yen GG (2004) Problems with fitting to the power-law distribution. Eur Phys J B 41:255\u2013258. doi:\n                        10.1140\/epjb\/e2004-00316-5","journal-title":"Eur Phys J B"},{"key":"1005_CR52","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u201csmall-world\u201d networks. Nature 393:440\u2013442","journal-title":"Nature"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1005-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1005-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1005-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T04:26:13Z","timestamp":1520396773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1005-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,15]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["1005"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1005-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,15]]}}}