{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:38:31Z","timestamp":1766486311733,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031220630"},{"type":"electronic","value":"9783031220647"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22064-7_12","type":"book-chapter","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T19:02:04Z","timestamp":1669230124000},"page":"146-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Overview on\u00a0Reducing Social Networks\u2019 Size"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5171-8846","authenticated-orcid":false,"given":"Myriam","family":"Jaouadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lotfi","family":"Ben Romdhane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"3557","DOI":"10.1007\/s10489-018-1162-x","volume":"48","author":"D Rhouma","year":"2018","unstructured":"Rhouma, D., Ben Romdhane, L.: An efficient multilevel scheme for coarsening large scale social networks. Appl. Intell. 48, 3557\u20133576 (2018)","journal-title":"Appl. Intell."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"115773","DOI":"10.1016\/j.eswa.2021.115773","volume":"186","author":"M Jaouadi","year":"2021","unstructured":"Jaouadi, M., Ben, R.L.: A distributed model for sampling large scale social networks. Expert Syst. Appl. 186, 115773 (2021)","journal-title":"Expert Syst. Appl."},{"key":"12_CR3","unstructured":"Hu, P., Lau, W.C.: A survey and taxonomy of graph sampling. CoRR (2013)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Liao, Q., Yang, Y.: Incremental algorithm based on wedge sampling for estimating clustering coefficient with MapReduce. In: 2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS), pp. 700\u2013703 (2017)","DOI":"10.1109\/ICSESS.2017.8343010"},{"key":"12_CR5","unstructured":"Jure, L., Christos, F.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636 (2006)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/sam.11224","volume":"7","author":"C Seshadhri","year":"2014","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.: Edge sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Min. 7, 294\u2013307 (2014)","journal-title":"Stat. Anal. Data Min."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 69, 026113 (2004)","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Wakisaka, Y., Yamashita, K., Tsugawa, S., Ohsaki, H.: On the effectiveness of random node sampling in influence maximization on unknown graph. In: 2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC), pp. 613\u2013618 (2020)","DOI":"10.1109\/COMPSAC48688.2020.0-188"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Wang, W., Fu, X., Lin, X.: Edge-based sampling for complex network with self-similar structure. In: 2021 IEEE Intl Conference on Parallel and Distributed Processing with Applications, Social Computing and Networking, pp. 955\u2013962 (2021)","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00134"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Wu, M., Zhang, Q., Gao, Y., Li, N.: Graph signal sampling with deep Q-learning. In: 2020 International Conference on Computer Information and Big Data Applications (CIBDA), pp. 450\u2013453 (2020)","DOI":"10.1109\/CIBDA50819.2020.00107"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Wang, R., et al.: Common neighbors matter: fast random walk sampling with common neighbor awareness. IEEE Trans. Knowl. Data Eng. (2022)","DOI":"10.1109\/TKDE.2022.3150427"},{"key":"12_CR12","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-91189-2_20","volume-title":"Artificial Intelligence and Algorithms in Intelligent Systems","author":"J Zhu","year":"2019","unstructured":"Zhu, J., Li, H., Chen, M., Dai, Z., Zhu, M.: Enhancing stratified graph sampling algorithms based on approximate degree distribution. In: Silhavy, R. (ed.) CSOC2018 2018. AISC, vol. 764, pp. 197\u2013207. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91189-2_20"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0441-6","volume":"7","author":"N Salamanos","year":"2017","unstructured":"Salamanos, N., Voudigari, E., Yannakoudakis, E.: Deterministic graph exploration for efficient graph sampling. Soc. Netw. Anal. Min. 7, 1\u201314 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Khanam, K.Z., Srivastava, G., Mago, V.: The homophily principle in social network analysis: a survey. Multimed. Tools Appl. (2022)","DOI":"10.1007\/s11042-021-11857-1"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Voudigari, E., Salamanos, N., Papageorgiou, T., Yannakoudakis, E.: Rank degree: an efficient algorithm for graph sampling. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 120\u2013129 (2016)","DOI":"10.1109\/ASONAM.2016.7752223"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, L., Jiang, H., Wang, F., Feng, D.: DRaWS: a dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks. Knowl.-Based Syst. 198, 105891 (2020)","DOI":"10.1016\/j.knosys.2020.105891"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.jpdc.2014.09.012","volume":"76","author":"D LaSalle","year":"2014","unstructured":"LaSalle, D., Karypis, G.: Multi-threaded modularity based graph clustering using the multilevel paradigm. J. Parallel Distrib. Comput. 76, 66\u201380 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. Supercomputing 1995: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, p. 28 (1995)","DOI":"10.1145\/224170.224228"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48, 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"12_CR20","unstructured":"Ahmed, N., Neville, J., Kompella, R.: Network sampling via edge-based node selection with graph induction. Department of Computer Science Technical Reports (2011)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/TVCG.2020.3030440","volume":"27","author":"Z Zhou","year":"2021","unstructured":"Zhou, Z., et al.: Context-aware sampling of large networks via graph representation learning. IEEE Trans. Vis. Comput. Graph. 27, 1709\u20131719 (2021)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"77106","DOI":"10.1109\/ACCESS.2020.2989504","volume":"8","author":"G Cai","year":"2020","unstructured":"Cai, G., Lu, G., Guo, J., Ling, C., Li, R.: Fast representative sampling in large-scale online social networks. IEEE Access 8, 77106\u201377119 (2020)","journal-title":"IEEE Access"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, S., Lightsey, C.: Implementation and evaluation of distributed graph sampling methods with spark. Electron. Imaging 1\u20139 (2018)","DOI":"10.2352\/ISSN.2470-1173.2018.01.VDA-379"},{"key":"12_CR24","unstructured":"Gomez, K., T\u00e4schner, M., Rostami, M.A., Rost, C., Rahm, E.: Graph sampling with distributed in-memory dataflow systems. CoRR (2019)"},{"key":"12_CR25","unstructured":"Apache Spark. Apache Spark Lightning-Fast Cluster Computing (2015). Spark.Apache.Org. Last accessed April 2022"},{"issue":"6","key":"12_CR26","doi-asserted-by":"publisher","first-page":"100","DOI":"10.23919\/JCC.2021.06.009","volume":"18","author":"D Yang","year":"2021","unstructured":"Yang, D., Qin, X., Xu, X., Li, C., Wei, G.: Sample-efficient deep reinforcement learning with directed associative graph. China Commun. 18(6), 100\u2013113 (2021)","journal-title":"China Commun."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Chen, H., Perozzi, B., Hu, Y., Skiena, S.: HARP: hierarchical representation learning for networks. CoRR (2017)","DOI":"10.1609\/aaai.v32i1.11849"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TEVC.2019.2896951","volume":"23","author":"RJ Preen","year":"2019","unstructured":"Preen, R.J., Smith, J.: Evolutionary $$n$$-level hypergraph partitioning with adaptive coarsening. IEEE Trans. Evol. Comput. 23, 962\u2013971 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Blondel, V., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-02011-7_24","volume-title":"Experimental Algorithms","author":"A Noack","year":"2009","unstructured":"Noack, A., Rotta, R.: Multi-level algorithms for modularity clustering. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 257\u2013268. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02011-7_24"},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2013-40829-0","volume":"86","author":"L Waltman","year":"2013","unstructured":"Waltman, L., van Eck, N.J.: A smart local moving algorithm for large-scale modularity-based community detection. Eur. Phys. J. B 86, 1\u201314 (2013)","journal-title":"Eur. Phys. J. B"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s40324-021-00282-x","volume":"79","author":"J Chen","year":"2022","unstructured":"Chen, J., Saad, Y., Zhang, Z.: Graph coarsening: from scientific computing to machine learning. SeMA J. 79, 187\u2013223 (2022)","journal-title":"SeMA J."},{"key":"12_CR34","first-page":"27","volume":"83","author":"L-C Zhang","year":"2021","unstructured":"Zhang, L.-C.: Graph sampling: an introduction. Surv. Stat. 83, 27\u201337 (2021)","journal-title":"Surv. Stat."},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Yanagiya, K., Yamada, K., Katsuhara, Y., Takatani, T., Tanaka, Y.: Edge sampling of graphs based on edge smoothness. In: ICASSP 2022 -IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5932\u20135936 (2022)","DOI":"10.1109\/ICASSP43922.2022.9747724"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22064-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T19:03:49Z","timestamp":1669230229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22064-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220630","9783031220647"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22064-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2022.uqcloud.net\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"198","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}