{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:43:55Z","timestamp":1743104635466,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819996360"},{"type":"electronic","value":"9789819996377"}],"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-981-99-9637-7_15","type":"book-chapter","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T15:02:38Z","timestamp":1704380558000},"page":"208-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How Hypergraph-to-Graph Conversion Affects Cooperative Working Visualization: A Multi-metric Evaluation"],"prefix":"10.1007","author":[{"given":"Zhihan","family":"Xiong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruixin","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chongshen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjun","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Arafat, N.A., Bressan, S.: Hypergraph drawing by force-directed placement, pp. 387\u2013394 (08 2017). https:\/\/doi.org\/10.1007\/978-3-319-64471-4_31","key":"15_CR1","DOI":"10.1007\/978-3-319-64471-4_31"},{"unstructured":"Bannister, M.J., Eppstein, D., Goodrich, M.T., Trott, L.: Force-directed graph drawing using social gravity and scaling. CoRR abs\/1209.0748 (2012). http:\/\/arxiv.org\/abs\/1209.0748","key":"15_CR2"},{"doi-asserted-by":"publisher","unstructured":"Di Bartolomeo, S., Pister, A., Buono, P., Plaisant, C., Dunne, C., Fekete, J.D.: Six methods for transforming layered hypergraphs to apply layered graph layout algorithms. Comput. Graph. Forum 41 (2022). https:\/\/doi.org\/10.1111\/cgf.14538","key":"15_CR3","DOI":"10.1111\/cgf.14538"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/TVCG.2012.178","volume":"19","author":"U Dogrusoz","year":"2013","unstructured":"Dogrusoz, U., Belviranli, M.E., Dilek, A.: Cise: a circular spring embedder layout algorithm. IEEE Trans. Visual Comput. Graph. 19, 953\u2013966 (2013)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"doi-asserted-by":"publisher","unstructured":"Ducournau, A., Bretto, A., Rital, S., Laget, B.: A reductive approach to hypergraph clustering: An application to image segmentation. Pattern Recogn. 45, 2788\u20132803 (07 2012). https:\/\/doi.org\/10.1016\/j.patcog.2012.01.005","key":"15_CR5","DOI":"10.1016\/j.patcog.2012.01.005"},{"doi-asserted-by":"publisher","unstructured":"Frickey, T., Lupas, A.: Clans: a java application for visualizing protein families based on pairwise similarity. Bioinformatics (Oxford, England) 20, 3702\u20134 (01 2005). https:\/\/doi.org\/10.1093\/bioinformatics\/bth444","key":"15_CR6","DOI":"10.1093\/bioinformatics\/bth444"},{"doi-asserted-by":"publisher","unstructured":"Fuller, C.: Caste, race, and hierarchy in the american south. J. Royal Anthropol. Inst. 17, 604\u2013621 (08 2011). https:\/\/doi.org\/10.1111\/j.1467-9655.2011.01709.x","key":"15_CR7","DOI":"10.1111\/j.1467-9655.2011.01709.x"},{"doi-asserted-by":"publisher","unstructured":"Gajdo, P., Je\u017eowicz, T., Uher, V., Dohnalek, P.: A parallel fruchterman-reingold algorithm optimized for fast visualization of large graphs and swarms of data. Swarm Evol. Comput. 26 (08 2015). https:\/\/doi.org\/10.1016\/j.swevo.2015.07.006","key":"15_CR8","DOI":"10.1016\/j.swevo.2015.07.006"},{"doi-asserted-by":"publisher","unstructured":"\u00c1gg, B., et al.: The entoptlayout cytoscape plug-in for the efficient visualization of major protein complexes in protein-protein interaction and signalling networks. Bioinformatics (Oxford, England) 35, 4490\u20134492 (11 2019). https:\/\/doi.org\/10.1093\/bioinformatics\/btz257","key":"15_CR9","DOI":"10.1093\/bioinformatics\/btz257"},{"unstructured":"Haleem, H., Wang, Y., Puri, A., Wadhwa, S., Qu, H.: Evaluating the readability of force directed graph layouts: a deep learning approach. CoRR abs\/1808.00703 (2018), http:\/\/arxiv.org\/abs\/1808.00703","key":"15_CR10"},{"doi-asserted-by":"publisher","unstructured":"Heer, J., Card, S., Landay, J.: Prefuse: a toolkit for interactive information visualization, pp. 421\u2013430 (04 2005). https:\/\/doi.org\/10.1145\/1054972.1055031","key":"15_CR11","DOI":"10.1145\/1054972.1055031"},{"doi-asserted-by":"publisher","unstructured":"Herman, I., Melan\u00e7on, G., Marshall, M.: Graph visualization and navigation in information visualization: a survey. IEEE Tran. Visual. Comput. Graph. 6, 24\u201343 (02 2000). https:\/\/doi.org\/10.1109\/2945.841119","key":"15_CR12","DOI":"10.1109\/2945.841119"},{"unstructured":"Hu, Y.: Efficient and high quality force-directed graph drawing. Math. J. 10, 37\u201371 (01 2005)","key":"15_CR13"},{"doi-asserted-by":"publisher","unstructured":"Jacobsen, B., Wallinger, M., Kobourov, S., N\u00f6llenburg, M.: Metrosets: visualizing sets as metro maps. IEEE Trans. Visualization Comput. Graph. PP, 1\u20131 (10 2020). https:\/\/doi.org\/10.1109\/TVCG.2020.3030475","key":"15_CR14","DOI":"10.1109\/TVCG.2020.3030475"},{"doi-asserted-by":"publisher","unstructured":"Jacomy, M., Venturini, T., Heymann, S., Bastian, M.: Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software. PloS one 9, e98679 (06 2014). https:\/\/doi.org\/10.1371\/journal.pone.0098679","key":"15_CR15","DOI":"10.1371\/journal.pone.0098679"},{"unstructured":"Kapec, P.: Hypergraph-based software visualization. In: International Workshop on Computer Graphics, Computer Vision and Mathematics, GraVisMa 2009 - Workshop Proceedings, pp. 149\u2013153 (01 2009)","key":"15_CR16"},{"doi-asserted-by":"publisher","unstructured":"Kerren, A., Jusufi, I.: A novel radial visualization approach for undirected hypergraphs (01 2013). https:\/\/doi.org\/10.2312\/PE.EuroVisShort.EuroVisShort2013.025-029","key":"15_CR17","DOI":"10.2312\/PE.EuroVisShort.EuroVisShort2013.025-029"},{"doi-asserted-by":"publisher","unstructured":"Kritz, M., Perlin, K.: A new scheme for drawing hypergraphs. Int. J. Comput. Math. 50(3-4), 131\u2013134 (Jan 1994). https:\/\/doi.org\/10.1080\/00207169408804250, copyright: Copyright 2015 Elsevier B.V., All rights reserved","key":"15_CR18","DOI":"10.1080\/00207169408804250"},{"unstructured":"Ley, M.: Dblp.uni-trier.de: Computer science bibliography. http:\/\/dblp.uni-trier.de\/ (1993)","key":"15_CR19"},{"unstructured":"Qu, B., Zhang, E., Zhang, Y.: Automatic polygon layout for primal-dual visualization of hypergraphs. CoRR abs\/2108.00671 (2021). https:\/\/arxiv.org\/abs\/2108.00671","key":"15_CR20"},{"issue":"6","key":"15_CR21","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TVCG.2010.210","volume":"16","author":"N Riche","year":"2010","unstructured":"Riche, N., Dwyer, T.: Untangling euler diagrams. IEEE Trans. Visual Comput. Graph. 16(6), 1090\u20131099 (2010). https:\/\/doi.org\/10.1109\/TVCG.2010.210","journal-title":"IEEE Trans. Visual Comput. Graph."},{"unstructured":"Streeb, D., Arya, D., Keim, D.A., Worring, M.: Visual analytics framework for the assessment of temporal hypergraph prediction models (2019)","key":"15_CR22"},{"doi-asserted-by":"publisher","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, l., Su, Z.: Arnetminer: extraction and mining of academic social networks, pp. 990\u2013998 (08 2008). https:\/\/doi.org\/10.1145\/1401890.1402008","key":"15_CR23","DOI":"10.1145\/1401890.1402008"},{"unstructured":"Thawonmas, R., Kurashige, M., Chen, K.T.: Detection of landmarks for clustering of online-game players. IJVR 6, 11\u201316 (01 2007)","key":"15_CR24"},{"doi-asserted-by":"publisher","unstructured":"Valdivia, P., Buono, P., Plaisant, C., Dufournaud, N., Fekete, J.D.: Analyzing dynamic hypergraphs with parallel aggregated ordered hypergraph visualization. IEEE Trans. Visualization Comput. Graph. PP, 1\u20131 (08 2019). https:\/\/doi.org\/10.1109\/TVCG.2019.2933196","key":"15_CR25","DOI":"10.1109\/TVCG.2019.2933196"},{"unstructured":"Yang, C., Wang, R., Yao, S., Abdelzaher, T.F.: Hypergraph learning with line expansion. CoRR abs\/2005.04843 (2020). https:\/\/arxiv.org\/abs\/2005.04843","key":"15_CR26"},{"unstructured":"Zhou, Y., Rathore, A., Purvine, E., Wang, B.: Topological simplifications of hypergraphs. CoRR abs\/2104.11214 (2021). https:\/\/arxiv.org\/abs\/2104.11214","key":"15_CR27"}],"container-title":["Communications in Computer and Information Science","Computer Supported Cooperative Work and Social Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-9637-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T15:07:08Z","timestamp":1704380828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-9637-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819996360","9789819996377"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-9637-7_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChineseCSCW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Computer Supported Cooperative Work  and Social Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Harbin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"18 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","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":"chinesecscw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.scholat.com\/ccscw\/2023","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":"Yes. Microsoft CMT.","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","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":"54","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":"28","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":"24% - 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":"5","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)"}}]}}