survey

A Survey of Sampling Method for Social Media Embeddedness Relationship

Authors:

Xiaogang ChenAuthors Info & Claims

ACM Computing Surveys, Volume 55, Issue 4

Article No.: 74, Pages 1 - 39

https://doi.org/10.1145/3524105

Published: 21 November 2022 Publication History

Abstract

Social media embeddedness relationships consist of online social networks formed by self-organized individual actors and significantly affect many aspects of our lives. Since the high cost and inefficiency of using population networks generated by social media embeddedness relationships to study practical issues, sampling techniques have become increasingly important than ever. Our work consists of three parts. We first comprehensively analyze current sampling selection methods, evaluation indexes, and evaluation methods in terms of technological evolution. In the second part, we systematically conduct sampling tests using representative large-scale social media datasets. The test results indicate that unequal-probability sampling methods can construct similar sample networks at the macroscale and microscale and outperform the equal-probability methods. However, non-negligible sampling errors at the mesoscale seriously affect the sampling reliability and validity. MANOVA tests show that the direct cause of sampling errors is the low in-degree nodes with medium-high betweenness located between the core and periphery, and current sampling methods cannot accurately sample such complex interconnected structures. In the third part, we summarize the pros and cons of current sampling methods and provide suggestions for future work.

References

[1]

S. Atilgan. 2017. A research on social media users. In Proceedings of International Academic Conferences International Institute of Social and Economic Sciences.

[2]

A. T. Stephen. 2016. The role of digital and social media marketing in consumer behavior. Current Opinion in Psychology 10, 17–21.

[3]

H. Allcott and M. Gentzkow.2017. Social media and fake news in the 2016 election. Journal of Economic Perspectives 31, 2 (2017 May), 211236.

[4]

G. Krippner, M. Granovetter, F. Block, N. Biggart, T. Beamish, Y. Hsing, ... and S. Ó Riain. 2004. Polanyi symposium: a conversation on embeddedness. Socio-Economic Review 2, 1 (2004), 109–135.

[5]

X. Shi, Z. Zheng, Y. Zhou, H. Jin, L. He, B. Liu, and Q. S. Hua. 2018. Graph processing on GPUs: A survey. ACM Computing Surveys (CSUR) 50, 6 (2018), 1–35.

Digital Library

[6]

C. Y. Gui, L. Zheng, B. He, C. Liu, X. Y. Chen, X. F. Liao, and H. Jin. 2019. A survey on graph processing accelerators: Challenges and opportunities. Journal of Computer Science and Technology 34, 2 (2019), 339–371.

[7]

H. Wang and P. Van Mieghem. 2010. Sampling networks by the union of m shortest path trees. Computer Networks 54, 6 (2010), 1042–1053.

Digital Library

[8]

S. Moreno, J. J. Pfeiffer, and J. Neville. 2018. Scalable and exact sampling method for probabilistic generative graph models. Data Mining and Knowledge Discovery 32, 6 (2018), 1561–1596.

Digital Library

[9]

B. Yan and S. Gregory. 2013. Identifying communities and key vertices by reconstructing networks from samples. PloS One 8, 4 (2013), e61006.

[10]

Y. Xin, Z. Q. Xie, and J. Yang. 2016. An adaptive random walk sampling method on dynamic community detection. Expert Systems with Applications 58 (2016), 10–19.

Digital Library

[11]

M. U. Ilyas, M. Z. Shafiq, A. X. Liu, and H. Radha. 2013. A distributed algorithm for identifying information hubs in social networks. IEEE Journal on Selected Areas in Communications 31, 9 (2013), 629–640.

[12]

F. Murai, B. Ribeiro, D. Towsley, and P. Wang. 2013. On set size distribution estimation and the characterization of large networks via sampling. IEEE Journal on Selected Areas in Communications 31, 6 (2013), 1017–1025.

[13]

P. Wang, J. Zhao, J. C. Lui, D. Towsley, and X. Guan. 2013. Sampling node pairs over large graphs. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 781–792.

Digital Library

[14]

N. M. Ahmed, L. Chen, Y. Wang, B. Li, Y. Li, and W. Liu. 2016. Sampling-based algorithm for link prediction in temporal networks. Information Sciences 374 (2016), 1–14.

Digital Library

[15]

M. Kurant, M. Gjoka, Y. Wang, Z. W. Almquist, C. T. Butts, and A. Markopoulou. 2012. Coarse-grained topology estimation via graph sampling. In Proceedings of the 2012 ACM Workshop on Workshop on Online Social Networks. 25–30.

Digital Library

[16]

L. S. Ahlstrom, J. L. Baker, K. Ehrlich, Z. T. Campbell, S. Patel, I. I. Vorontsov, and O. Miyashita. 2013. Network visualization of conformational sampling during molecular dynamics simulation. Journal of Molecular Graphics and Modelling 46 (2013), 140–149.

[17]

R. Gove. 2019. Force-directed graph layouts by edge sampling. In Proceedings of the 2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV). IEEE, 1–5.

[18]

K. Kafetsios, D. Chatzakou, N. Tsigilis, and A. Vakali. 2017. Experience of emotion in face to face and computer-mediated social interactions: An event sampling study. Computers in Human Behavior 76 (2017), 287–293.

Digital Library

[19]

A. Reissmann, J. Hauser, E. Stollberg, I. Kaunzinger, and K. W. Lange. 2018. The role of loneliness in emerging adults’ everyday use of facebook–An experience sampling approach. Computers in Human Behavior 88 (2018), 47–60.

Digital Library

[20]

A. Anis, A. El Gamal, A. S. Avestimehr, and A. Ortega. 2018. A sampling theory perspective of graph-based semi-supervised learning. IEEE Transactions on Information Theory 65, 4 (2018), 2322–2342.

[21]

Z. Cebeci and F. Yildiz. 2016. Efficiency of random sampling based data size reduction on computing time and validity of clustering in data mining. Agrárinformatika/Journal of Agricultural Informatics 7, 1 (2016), 53–64.

[22]

T. Yang, D. Fu, and J. Meng. 2020. A Manifold-based dimension reduction algorithm framework for noisy data using graph sampling and spectral graph. Complexity, 2020.

[23]

J. A. Smith and J. Moody. 2013. Structural effects of network sampling coverage I: Nodes missing at random. Social Networks 35, 4 (2013), 652–668.

[24]

J. A. Smith, J. Moody, and J. H. Morgan. 2017. Network sampling coverage II: The effect of non-random missing data on network measurement. Social Networks 48 (2017), 78–99.

[25]

N. K. Ahmed, N. Duffield, T. L. Willke, and R. A. Rossi. 2017. On sampling from massive graph streams. Proceedings of the VLDB Endowment 10, 11 (2017), 1430–1441.

Digital Library

[26]

S. Chen, X. Lu, Z. Liu, and Z. Jia. 2018. Sampling on bipartite networks: a comparative analysis of eight crawling methods. Journal of Statistical Mechanics: Theory and Experiment, 2018, 7 (2018), 073403.

[27]

J. Zhang, K. Zhu, Y. Pei, G. Fletcher, and M. Pechenizkiy. 2019. Cluster-preserving sampling from fully-dynamic streaming graphs. Information Sciences 482 (2019), 279–300.

Digital Library

[28]

A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. 2007. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. 29–42.

Digital Library

[29]

A. L. Traud, E. D. Kelsic, P. J. Mucha, et al. 2011. Comparing community structure to characteristics in online collegiate social networks. SIAM Review, 53, 3 (2011), 526–543.

Digital Library

[30]

E. Ferrara. 2012. Community structure discovery in facebook. International Journal of Social Network Mining 1, 1 (2012), 67–90.

[31]

M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. 2010. Walking in facebook: A case study of unbiased sampling of osns. In Proceedings of the 2010 Proceedings IEEE Infocom. IEEE, 1–9.

[32]

B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. 2009. On the evolution of user interaction in facebook. In Proceedings of the 2nd ACM Workshop on Online Social Networks. 37–42.

Digital Library

[33]

F. Baltar and I. Brunet. 2012. Social research 2.0: virtual snowball sampling method using Facebook. Internet Research.

[34]

T. Wells and M. Link. 2014. Facebook user research using a probability-based sample and behavioral data. Journal of Computer-Mediated Communication 19, 4 (2014), 1042–1052.

Digital Library

[35]

D. H. Chau, S. Pandit, S. Wang, and C. Faloutsos. 2007. Parallel crawling for online social networks. In Proceedings of the 16th International Conference on World Wide Web. 1283–1284.

Digital Library

[36]

Q. Gao, X. Ding, F. Pan, and W. Li. 2014. An improved sampling method of complex network. International Journal of Modern Physics C 25, 05 (2014), 1440007.

[37]

E. Voudigari, N. Salamanos, T. Papageorgiou, and E. J. Yannakoudakis. 2016. Rank degree: An efficient algorithm for graph sampling. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 120–129.

[38]

M. I. Yousuf and S. Kim. 2018. List sampling for large graphs. Intelligent Data Analysis 22, 2 (2018), 261–295.

Digital Library

[39]

S. Ye, J. Lang, and F. Wu. 2010. Crawling online social graphs. In Proceedings of the 2010 12th International Asia-Pacific Web Conference. IEEE, 236–242.

Digital Library

[40]

J. Jiang, C. Wilson, X. Wang, W. Sha, P. Huang, Y. Dai, and B. Y. Zhao. 2013. Understanding latent interactions in online social networks. ACM Transactions on the Web (TWEB) 7, 4 (2013), 1–39.

Digital Library

[41]

S. González-Bailón, N. Wang, A. Rivero, J. Borge-Holthoefer, and Y. Moreno. 2014. Assessing the bias in samples of large online networks. Social Networks 38 (2014), 16–27.

[42]

N. Ahmed, J. Neville, and R. R. Kompella. 2011. Network sampling via edge-based node selection with graph induction.

[43]

V. Krishnamurthy, M. Faloutsos, M. Chrobak, J. H. Cui, L. Lao, and A. G. Percus. 2007. Sampling large Internet topologies for simulation purposes. Computer Networks 51, 15 (2007), 4284–4302.

Digital Library

[44]

N. K. Ahmed, N. Duffield, J. Neville, and R. Kompella. 2014. Graph sample and hold: A framework for big-graph analytics. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1446–1455.

Digital Library

[45]

J. Lu and H. Wang. 2017. Uniform random sampling not recommended for large graph size estimation. Information Sciences 421 (2017), 136–153.

Digital Library

[46]

R. S. Sadasivam, S. L. Cutrona, E. Volz, S. R. Rao, and T. K. Houston. 2013. Web-based peer-driven chain referrals for smoking cessation. Studies in Health Technology and Informatics 192 (2013), 357.

[47]

M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. 2011. Practical recommendations on crawling online social networks. IEEE Journal on Selected Areas in Communications 29, 9 (2011), 1872–1892.

[48]

J. Zhao, J. C. Lui, D. Towsley, P. Wang, and X. Guan. 2015. A tale of three graphs: Sampling design on hybrid social-affiliation networks. In Proceedings of the 2015 IEEE 31st International Conference on Data Engineering. IEEE, 939–950.

[49]

M. Salehi, H. R. Rabiee, N. Nabavi, and S. Pooya. 2011. Characterizing twitter with respondent-driven sampling. In 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing. IEEE, 1211–1217.

Digital Library

[50]

A. Rezvanian, M. Rahmati, and M. R. Meybodi. 2014. Sampling from complex networks using distributed learning automata. Physica A: Statistical Mechanics and its Applications 396, 2 (2014), 224–234.

[51]

Z. S. Jalali, A. Rezvanian, and M. R. Meybodi. 2016. Social network sampling using spanning trees. International Journal of Modern Physics C 27, 05 (2016), 1650052.

[52]

A. Rezvanian and M. R. Meybodi. 2016. Sampling algorithms for weighted networks. Social Network Analysis and Mining 6, 1 (2016), 1–22.

[53]

M. Ghavipour and M. R. Meybodi. 2017. Irregular cellular learning automata-based algorithm for sampling social networks. Engineering Applications of Artificial Intelligence 59 (2017), 244–259.

[54]

J. Lu and D. Li. 2012. Sampling online social networks by random walk. In Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research. 33–40.

Digital Library

[55]

A. H. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach. 2009. Respondent-driven sampling for characterizing unstructured overlays. In Proceedings of the IEEE Infocom 2009. IEEE, 2701–2705.

[56]

D. D. Heckathorn. 2002. Respondent-driven sampling II: deriving valid population estimates from chain-referral samples of hidden populations. Social Problems 49, 1 (2002), 11–34.

[57]

S. Sperandei, L. S. Bastos, M. Ribeiro-Alves, and Francisco Inácio Bastos. 2017. Assessing respondent-driven sampling: a simulation study across different networks. Social Networks, S0378873316301769.

[58]

P. Ebbes, Z. Huang, and A. Rangaswamy. 2016. Sampling designs for recovering local and global characteristics of social networks. International Journal of Research in Marketing 33, 3 (2016), 578–599.

[59]

J. D. Noh and H. Rieger. 2004. Random walks on complex networks. Physical Review Letters 92, 11 (2004), 118701.

[60]

J. Leskovec and C. Faloutsos. 2006. Sampling from large graphs. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 631–636.

Digital Library

[61]

L. Lovász. 1993. Random walks on graphs. Combinatorics, Paul Erdos is Eighty 2, 1--46 (1993), 4.

[62]

M. Papagelis, G. Das, and N. Koudas. 2011. Sampling online social networks. IEEE Transactions on Knowledge and Data Engineering 25, 3 (2011), 662–676.

Digital Library

[63]

C. Tong, Y. Lian, J. Niu, Z. Xie, and Y. Zhang. 2016. A novel green algorithm for sampling complex networks. Journal of Network and Computer Applications 59 (2016), 55–62.

Digital Library

[64]

X. Xu and C. H. Lee. 2014. A general framework of hybrid graph sampling for complex network analysis. In Proceedings of the IEEE Infocom 2014-IEEE Conference on Computer Communications. IEEE, 2795–2803.

[65]

Y. Xie, S. Chang, Z. Zhang, M. Zhang, and L. Yang. 2018. Efficient sampling of complex network with modified random walk strategies. Physica A: Statistical Mechanics and its Applications 492 (2018), 57–64.

[66]

J. Zhao, P. Wang, J. C. Lui, D. Towsley, and X. Guan. 2019. Sampling online social networks by random walk with indirect jumps. Data Mining and Knowledge Discovery 33, 1 (2019), 24–57.

Digital Library

[67]

M. K. Cowles and B. P. Carlin. 1996. Markov chain Monte Carlo convergence diagnostics: A comparative review. Journal of the American Statistical Association 91, 434 (1996), 883–904.

[68]

L. Jin, Y. Chen, P. Hui, C. Ding, T. Wang, A. V. Vasilakos, ... and X. Li. 2011. Albatross sampling: robust and effective hybrid vertex sampling for social graphs. In Proceedings of the 3rd ACM International Workshop on MobiArch. 11–16.

Digital Library

[69]

C. A. Pina-García and D. Gu. 2013. Collecting random samples from facebook: An efficient heuristic for sampling large and undirected graphs via a metropolis-hastings random Walk. In Proceedings of the 2013 IEEE International Conference on Systems, Man, and Cybernetics. IEEE, 2244–2249.

Digital Library

[70]

C. H. Lee, X. X. Do, and Y. Eun. 2017. On the Rao-Blackwellization and its application for graph sampling via neighborhood exploration. In Proceedings of the IEEE Infocom 2017-IEEE Conference on Computer Communications. IEEE, 1--9.

[71]

R. H. Li, J. X. Yu, L. Qin, R. Mao, and T. Jin. 2015. On random walk based graph sampling. In Proceedings of the 2015 IEEE 31st International Conference on Data Engineering. IEEE, 927–938.

[72]

C. Hübler, H. P. Kriegel, K. Borgwardt, and Z. Ghahramani. 2008. Metropolis algorithms for representative subgraph sampling. In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining. IEEE, 283–292.

Digital Library

[73]

B. Jiao, J. Shi, W. Zhang, and L. Xing. 2019. Graph sampling for internet topologies using normalized laplacian spectral features. Information Sciences 481 (2019), 574–603.

Digital Library

[74]

D. Wang, Z. Li, and G. Xie. 2011. Towards unbiased sampling of online social networks. In Proceedings of the 2011 IEEE International Conference on Communications (ICC). IEEE, 1--5.

[75]

X. Xu and C. H. Lee. 2017. Challenging the limits: Sampling online social networks with cost constraints. In IEEE Infocom 2017-IEEE Conference on Computer Communications. IEEE, 1--9.

[76]

C. Doerr and N. Blenn. 2013. Metric convergence in social network sampling. In Proceedings of the 5th ACM workshop on HotPlanet. 45–50.

Digital Library

[77]

E. M. Airoldi, X. Bai, and K. M. Carley. 2011. Network sampling and classification: An investigation of network model representations. Decision Support Systems 51, 3 (2011), 506–518.

Digital Library

[78]

B. W. Kernighan and S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49, 2 (1970), 291–307.

[79]

E. B. Fowlkes and C. L. Mallows. 1983. A method for comparing two hierarchical clusterings. Journal of the American Statistical Association 78, 383 (1983), 553–569.

[80]

M. Meilă. 2007. Comparing clusterings—an information based distance. Journal of Multivariate Analysis 98, 5 (2007), 873–895.

Digital Library

[81]

W. O. Kermack and A. G. McKendrick. 1927. A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character 115, 772 (1927), 700–721.

[82]

M. E. Newman. 2003. The structure and function of complex networks. SIAM Review 45, 2 (2003), 167–256.

Digital Library

[83]

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. U. Hwang. 2006. Complex networks: Structure and dynamics. Physics Reports 424, 4--5 (2006), 175–308.

[84]

A. Lancichinetti, M. Kivelä, J. Saramäki, and S. Fortunato. 2010. Characterizing the community structure of complex networks. PloS One 5, 8 (2010), e11976.

[85]

A. Scott and T. M. Smith. 1969. Estimation in multi-stage surveys. Journal of the American Statistical Association 64, 327 (1969), 830–840.

[86]

N. Blagus, L. Šubelj, and M. Bajec. 2017. Empirical comparison of network sampling: How to choose the most appropriate method? Physica A: Statistical Mechanics and its Applications 477 (2017), 136–148.

[87]

A. Mohaisen, A. Yun, and Y. Kim. 2010. Measuring the mixing time of social graphs. In Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement. 383–389.

Digital Library

[88]

Z. Zhou, N. Zhang, Z. Gong, and G. Das. 2016. Faster random walks by rewiring online social networks on-the-fly. ACM Transactions on Database Systems (TODS) 40, 4 (2016), 1–36.

Digital Library

[89]

G. St-Onge, J. G. Young, L. Hébert-Dufresne, and L. J. Dubé. 2019. Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm. Computer Physics Communications 240 (2019), 30–37.

[90]

F. Zhang, S. Zhang, and C. Lightsey. 2018. Implementation and evaluation of distributed graph sampling methods with spark. Electronic Imaging 2018, 1, (2018) 379–1.

[91]

S. Benaissa Pedriza. 2021. Sources, channels and strategies of disinformation in the 2020 US election: Social networks, traditional media and political candidates. Journalism and Media 2, 4 (2021), 605–624.

[92]

D. Zhang, J. Yin, X. Zhu, and C. Zhang. 2018. Network representation learning: A survey. IEEE Transactions on Big Data.

[93]

H. Cai, V. W. Zheng, and K. C. C. Chang. 2018. A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE Transactions on Knowledge and Data Engineering 30, 9 (2018), 1616–1637.

Digital Library

[94]

P. Goyal and E. Ferrara. 2018. Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems 151 (2018), 78–94.

[95]

M. Kurant, A. Markopoulou, and P. Thiran. 2011. Towards unbiased BFS sampling. IEEE Journal on Selected Areas in Communications 29, 9 (2011), 1799–1809.

[96]

M. Kurant, A. Markopoulou, and P. Thiran. 2010. On the bias of BFS (breadth first search). In Proceedings of the 2010 22nd International Teletraffic Congress (lTC 22). IEEE, 1–8.

[97]

A. Rezvanian and M. R. Meybodi. 2015. Sampling social networks using shortest paths. Physica A: Statistical Mechanics and its Applications 424 (2015), 254--268.

[98]

K. Avrachenkov, B. Ribeiro, and D. Towsley. 2010. Improving random walk estimation accuracy with uniform restarts. In Proceedings of the International Workshop on Algorithms and Models for the Web-Graph. Springer, Berlin, 98–109.

[99]

D. D. Heckathorn. 1997. Respondent-driven sampling: a new approach to the study of hidden populations. Social Problems 44, 2 (1997), 174–199.

[100]

J. Zhao, J. C. Lui, D. Towsley, P. Wang, and X. Guan. 2015. A tale of three graphs: Sampling design on hybrid social-affiliation networks. In 2015 IEEE 31st International Conference on Data Engineering. IEEE, 939–950.

[101]

P. Bhattacharya, S. Paul, and P. Biswas. 2015. Mathematical modeling of treatment SIR model with respect to variable contact rate. International Proceedings of Economics Development and Research 83 (2015), 34.

[102]

J. Taylor. 1997. Introduction to error analysis, the study of uncertainties in physical measurements.

[103]

X. K. Xu and J. J. Zhu. 2016. Flexible sampling large-scale social networks by self-adjustable random walk. Physica A: Statistical Mechanics and its Applications 463 (2016), 356–365.

[104]

T. Squartini, R. Mastrandrea, and D. Garlaschelli. 2015. Unbiased sampling of network ensembles. New Journal of Physics 17, 2 (2015), 023052.

[105]

M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou. 2011. Multigraph sampling of online social networks. IEEE Journal on Selected Areas in Communications 29, 9 (2011), 1893–1905.

[106]

M. A. Stephens. 1974. EDF statistics for goodness of fit and some comparisons. Journal of the American statistical Association 69, 347 (1974), 730–737.

[107]

Y. Zhao, H. Jiang, Y. Qin, H. Xie, Y. Wu, S. Liu, ... and F. Zhou. 2020. Preserving minority structures in graph sampling. IEEE Transactions on Visualization and Computer Graphics 27, 2 (2020), 1698–1708.

[108]

R. Zou and L. B. Holder. 2010. Frequent subgraph mining on a single large graph using sampling techniques. In Proceedings of the Eighth Workshop on Mining and Learning with Graphs. 171–178.

Digital Library

[109]

J. Zhu, H. Li, M. Chen, Z. Dai, and M. Zhu. 2018. Enhancing stratified graph sampling algorithms based on approximate degree distribution. In Proceedings of the Computer Science On-line Conference. Springer, Cham, 197--207.

[110]

M. I. Yousuf and S. Kim. 2020. Guided sampling for large graphs. Data Mining and Knowledge Discovery 34, 4 (2020), 905–948.

Cited By

Ali SAhmad MBeg MKhan IFaizullah SKhan M(2024) SsAG: Summarization and Sparsification of Attributed GraphsACM Transactions on Knowledge Discovery from Data10.1145/365161918:6(1-22)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3651619
Zhou HLai PSun ZChen XChen YWu HWang Y(2024)AdaMotif: Graph Simplification via Adaptive Motif DesignIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345632131:1(688-698)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456321
Tseng FZeng JCho HYeh KChen C(2024)Detecting Adversarial Examples of Fake News via the Neurons Activation StateIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.329371811:4(5199-5209)Online publication date: Aug-2024
https://doi.org/10.1109/TCSS.2023.3293718
Show More Cited By

Index Terms

A Survey of Sampling Method for Social Media Embeddedness Relationship
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Streaming, sublinear and near linear time algorithms
      1. Sketching and sampling

Recommendations

Unbiased sampling in directed social graph
SIGCOMM '10

Microblogging 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 ...
Sampling in online social networks
SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing

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 ...
Sampling from Social Networks with Attributes
WWW '17: Proceedings of the 26th International Conference on World Wide Web

Sampling from large networks represents a fundamental challenge for social network research. In this paper, we explore the sensitivity of different sampling techniques (node sampling, edge sampling, random walk sampling, and snowball sampling) on social ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 55, Issue 4

April 2023

871 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/3567469

Editor:
Albert Zomaya
University of Sydney, Australia

Issue’s Table of Contents

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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 November 2022

Online AM: 30 March 2022

Accepted: 28 February 2022

Revised: 14 November 2021

Received: 12 May 2020

Published in CSUR Volume 55, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Survey
Refereed

Funding Sources

National Key Research and Development Plan
Natural Science Basic Research Program of Shaanxi
Fundamental Research Funds for the Central Universities
National Natural Science Foundation of China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
733
Total Downloads

Downloads (Last 12 months)205
Downloads (Last 6 weeks)11

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ali SAhmad MBeg MKhan IFaizullah SKhan M(2024) SsAG: Summarization and Sparsification of Attributed GraphsACM Transactions on Knowledge Discovery from Data10.1145/365161918:6(1-22)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3651619
Zhou HLai PSun ZChen XChen YWu HWang Y(2024)AdaMotif: Graph Simplification via Adaptive Motif DesignIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345632131:1(688-698)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456321
Tseng FZeng JCho HYeh KChen C(2024)Detecting Adversarial Examples of Fake News via the Neurons Activation StateIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.329371811:4(5199-5209)Online publication date: Aug-2024
https://doi.org/10.1109/TCSS.2023.3293718
Jiao B(2024)Sampling unknown large networks restricted by low sampling ratesScientific Reports10.1038/s41598-024-64018-314:1Online publication date: 10-Jun-2024
https://doi.org/10.1038/s41598-024-64018-3
Luo QXie ZLiu YYu DCheng XLin XJia X(2024)Sampling hypergraphs via joint unbiased random walkWorld Wide Web10.1007/s11280-024-01253-827:2Online publication date: 19-Feb-2024
https://dl.acm.org/doi/10.1007/s11280-024-01253-8
Jin JLu GGu W(2023)A Fast Dynamic Adaptive Sampling Algorithm for Large-Scale Online Social NetworksComputer Science and Education10.1007/978-981-99-2443-1_30(337-349)Online publication date: 14-May-2023
https://doi.org/10.1007/978-981-99-2443-1_30
Zhang LWang FJiang HFeng DXie YZhang ZWang G(2022)Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costsKnowledge and Information Systems10.1007/s10115-022-01691-864:7(1909-1935)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s10115-022-01691-8

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Full Text

View this article in Full Text.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View full text|Download PDF

View Issue’s Table of Contents