{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:59:49Z","timestamp":1742932789195,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545337"},{"type":"electronic","value":"9783031545344"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54534-4_22","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:39:18Z","timestamp":1710844758000},"page":"311-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visualization-Driven Graph Sampling Strategy for\u00a0Exploring Large-Scale Networks"],"prefix":"10.1007","author":[{"given":"Gagik","family":"Khalafyan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5827-2620","authenticated-orcid":false,"given":"Irina","family":"Tirosyan","sequence":"additional","affiliation":[]},{"given":"Varduhi","family":"Yeghiazaryan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"key":"22_CR1","unstructured":"Ahmed, N., Neville, J., Kompella, R.R.: Network sampling via edge-based node selection with graph induction. Technical report, Purdue University (2011)"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2601438","volume":"8","author":"NK Ahmed","year":"2013","unstructured":"Ahmed, N.K., Neville, J., Kompella, R.: Network sampling: from static to streaming graphs. ACM Trans. Knowl. Discov. Data 8(2), 1\u201356 (2013)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows (1988)","DOI":"10.21236\/ADA594171"},{"issue":"1987","key":"22_CR4","doi-asserted-by":"publisher","first-page":"20120375","DOI":"10.1098\/rsta.2012.0375","volume":"371","author":"AL Barab\u00e1si","year":"2013","unstructured":"Barab\u00e1si, A.L.: Network science. Philos. Trans. Roy. Soc. A: Math. Phys. Eng. Sci. 371(1987), 20120375 (2013)","journal-title":"Philos. Trans. Roy. Soc. A: Math. Phys. Eng. Sci."},{"issue":"9","key":"22_CR5","first-page":"17","volume":"105","author":"P Bholowalia","year":"2014","unstructured":"Bholowalia, P., Kumar, A.: EBK-means: a clustering technique based on elbow method and K-means in WSN. Int. J. Comput. Appl. 105(9), 17\u201324 (2014)","journal-title":"Int. J. Comput. Appl."},{"key":"22_CR6","unstructured":"Cosmograph: Interactive network visualization (2023). https:\/\/cosmograph.app. Accessed 19 July 2023"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Hardiman, S.J., Katzir, L.: Estimating clustering coefficients and size of social networks via random walk. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 539\u2013550 (2013)","DOI":"10.1145\/2488388.2488436"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s41109-021-00405-3","volume":"6","author":"J Hu","year":"2021","unstructured":"Hu, J., et al.: Bc tree-based spectral sampling for big complex network visualization. Appl. Netw. Sci. 6(1), 60 (2021)","journal-title":"Appl. Netw. Sci."},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"016102","DOI":"10.1103\/PhysRevE.73.016102","volume":"73","author":"SH Lee","year":"2006","unstructured":"Lee, S.H., Kim, P.J., Jeong, H.: Statistical properties of sampled networks. Phys. Rev. E 73(1), 016102 (2006)","journal-title":"Phys. Rev. E"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177\u2013187 (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2-es (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"22_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/9781108684163","volume-title":"Mining of Massive Data Sets","author":"J Leskovec","year":"2020","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Data Sets. Cambridge University Press, Cambridge (2020)"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: SNAP: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. 8(1), 1\u201320 (2016)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"22_CR15","unstructured":"McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, vol. 25, pp. 539\u2013547 (2012)"},{"key":"22_CR16","unstructured":"McCallum, A.K., Nigam, K., Rennie, J., Seymore, K.: The Cora dataset. https:\/\/paperswithcode.com\/dataset\/cora. Accessed 19 July 2023"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98(2), 404\u2013409 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Noble, C.C., Cook, D.J.: Graph-based anomaly detection. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636 (2003)","DOI":"10.1145\/956750.956831"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.physa.2013.11.015","volume":"396","author":"A Rezvanian","year":"2014","unstructured":"Rezvanian, A., Rahmati, M., Meybodi, M.R.: Sampling from complex networks using distributed learning automata. Phys. A 396, 224\u2013234 (2014)","journal-title":"Phys. A"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Allen, C., Sarkar, R.: Multi-scale attributed node embedding. J. Complex Netw. 9(2), cnab014 (2021)","DOI":"10.1093\/comnet\/cnab014"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 1325\u20131334 (2020)","DOI":"10.1145\/3340531.3411866"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"036118","DOI":"10.1103\/PhysRevE.72.036118","volume":"72","author":"MPH Stumpf","year":"2005","unstructured":"Stumpf, M.P.H., Wiuf, C.: Sampling properties of random graphs: the degree distribution. Phys. Rev. E 72(3), 036118 (2005)","journal-title":"Phys. Rev. E"},{"key":"22_CR23","unstructured":"Uehara, R.: The number of connected components in graphs and its applications. Technical report, Komazawa University (1999)"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TVCG.2016.2598867","volume":"23","author":"Y Wu","year":"2016","unstructured":"Wu, Y., Cao, N., Archambault, D., Shen, Q., Qu, H., Cui, W.: Evaluation of graph sampling: a visualization perspective. IEEE Trans. Visual Comput. Graphics 23(1), 401\u2013410 (2016)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"22_CR25","unstructured":"Zhao, Y., et al.: Mino-centric graph sampling (MCGS). GitHub repository (2020). https:\/\/github.com\/csuvis\/MCGS. Accessed 19 July 2023"},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/TVCG.2020.3030428","volume":"27","author":"Y Zhao","year":"2020","unstructured":"Zhao, Y., et al.: Preserving minority structures in graph sampling. IEEE Trans. Visual Comput. Graphics 27(2), 1698\u20131708 (2020)","journal-title":"IEEE Trans. Visual Comput. Graphics"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54534-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:43:41Z","timestamp":1710845021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54534-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545337","9783031545344"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54534-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yerevan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Armenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","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":"24","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":"26% - 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":"3","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":"1.62","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Out of the 93 submission, 17 were rejected before being sent to peer review.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}