{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:03:12Z","timestamp":1781884992729,"version":"3.54.5"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031222023","type":"print"},{"value":"9783031222030","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_7","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"77-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Spherical Graph Drawing by\u00a0Multi-dimensional Scaling"],"prefix":"10.1007","author":[{"given":"Jacob","family":"Miller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahan","family":"Huroyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-68766-3_2","volume-title":"Graph Drawing and Network Visualization","author":"K B\u00f6rsig","year":"2020","unstructured":"B\u00f6rsig, K., Brandes, U., Pasztor, B.: Stochastic gradient descent works really well for stress minimization. In: GD 2020. LNCS, vol. 12590, pp. 18\u201325. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_2"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Lechevallier, Y., Saporta, G. (eds.) Proceedings of COMPSTAT 2010. Physica-Verlag HD, pp. 177\u2013186. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-7908-2604-3_16","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-35289-8_25","volume-title":"Neural Networks: Tricks of the Trade","author":"L Bottou","year":"2012","unstructured":"Bottou, L.: Stochastic gradient descent tricks. In: Montavon, G., Orr, G.B., M\u00fcller, K.-R. (eds.) Neural Networks: Tricks of the Trade. LNCS, vol. 7700, pp. 421\u2013436. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35289-8_25"},{"key":"7_CR4","unstructured":"B\u00f6rner, K.: (2012). http:\/\/scimaps.org\/home.html"},{"issue":"7","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0039464","volume":"7","author":"K B\u00f6rner","year":"2012","unstructured":"B\u00f6rner, K., et al.: Design and update of a classification system: the UCSD map of science. PLoS ONE 7(7), 1\u201310 (2012)","journal-title":"PLoS ONE"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1-1:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v031.i03","volume":"31","author":"J De Leeuw","year":"2009","unstructured":"De Leeuw, J., Mair, P.: Multidimensional scaling using majorization: SMACOF in R. J. Stat. Software 31, 1\u201330 (2009)","journal-title":"J. Stat. Software"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Du, F., Cao, N., Lin, Y., Xu, P., Tong, H.: iSphere: focus+context sphere visualization for interactive large graph exploration. In: Proceedings of the 2017 CHI Conference on Human Factors in Computing, pp. 2916\u20132927. ACM (2017)","DOI":"10.1145\/3025453.3025628"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11408031_38","volume-title":"Scale Space and PDE Methods in Computer Vision","author":"A Elad","year":"2005","unstructured":"Elad, A., Keller, Y., Kimmel, R.: Texture mapping via spherical multi-dimensional scaling. In: Kimmel, R., Sochen, N.A., Weickert, J. (eds.) Scale-Space 2005. LNCS, vol. 3459, pp. 443\u2013455. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11408031_38"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-92931-2_25","volume-title":"Graph Drawing and Network Visualization","author":"D Eppstein","year":"2021","unstructured":"Eppstein, D.: Limitations on realistic hyperbolic graph drawing. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 343\u2013357. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_25"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Frey, D., Pimentel, R.: Principal component analysis and factor analysis. In: Principal Component Analysis. Springer Series in Statistics. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4757-1904-8_7","DOI":"10.1007\/978-1-4757-1904-8_7"},{"issue":"6","key":"7_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., North, S.C.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph. 19(6), 927\u2013940 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-019-01440-w","volume":"186","author":"M G\u00fcrb\u00fczbalaban","year":"2021","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Parrilo, P.A.: Why random reshuffling beats stochastic gradient descent. Math. Program. 186(1), 49\u201384 (2021)","journal-title":"Math. Program."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, I.: (2007). https:\/\/world-processor.com","DOI":"10.1145\/1280120.1280159"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"7_CR17","unstructured":"Kobourov, S.: Force-directed drawing algorithms. In: Handbook on Graph Drawing and Visualization, pp. 383\u2013408. Chapman and Hall\/CRC (2013)"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TVCG.2005.103","volume":"11","author":"S Kobourov","year":"2005","unstructured":"Kobourov, S., Wampler, K.: Non-Euclidean spring embedders. IEEE Trans. Vis. Comput. Graph. 11(6), 757\u2013767 (2005)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogun\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/cgf.13187","volume":"36","author":"JF Kruiger","year":"2017","unstructured":"Kruiger, J.F., Rauber, P.E., Martins, R.M., Kerren, A., Kobourov, S., Telea, A.C.: Graph layouts by t-SNE. Comput. Graph. Forum 36(3), 283\u2013294 (2017)","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29(1), 1\u201327 (1964)","journal-title":"Psychometrika"},{"issue":"7","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1109\/TVCG.2016.2520921","volume":"22","author":"O Kwon","year":"2016","unstructured":"Kwon, O., Muelder, C., Lee, K., Ma, K.: A study of layout, rendering, and interaction methods for immersive graph visualization. IEEE Trans. Vis. Comput. Graph. 22(7), 1802\u20131815 (2016)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jvlc.1996.0003","volume":"7","author":"J Lamping","year":"1996","unstructured":"Lamping, J., Rao, R.: The hyperbolic browser: a focus + context technique for visualizing large hierarchies. J. Vis. Lang. Comput. 7(1), 33\u201355 (1996)","journal-title":"J. Vis. Lang. Comput."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Lamping, J., Rao, R., Pirolli, P.: A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In: Human Factors in Computing Systems, CHI 1995 Conference Proceedings, pp. 401\u2013408. ACM\/Addison-Wesley (1995)","DOI":"10.1145\/223904.223956"},{"issue":"11","key":"7_CR25","first-page":"2579","volume":"9","author":"L Van der Maaten","year":"2008","unstructured":"Van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(11), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J.: UMAP: uniform manifold approximation and projection for dimension reduction. CoRR abs\/1802.03426 (2018)","DOI":"10.21105\/joss.00861"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Miller, J., Kobourov, S., Huroyan, V.: Browser based hyperbolic visualization of graphs. In: IEEE Pacific Visualization Symposium PacificVis. IEEE Computer Society (2022)","DOI":"10.1109\/PacificVis53943.2022.00016"},{"key":"7_CR28","unstructured":"Munzner, T.: H3: laying out large directed graphs in 3d hyperbolic space. In: IEEE Symposium on Information Visualization, pp. 2\u201310. IEEE Computer Society (1997)"},{"issue":"4","key":"7_CR29","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/38.689657","volume":"18","author":"T Munzner","year":"1998","unstructured":"Munzner, T.: Exploring large graphs in 3D hyperbolic space. IEEE Comput. Graphics Appl. 18(4), 18\u201323 (1998)","journal-title":"IEEE Comput. Graphics Appl."},{"key":"7_CR30","unstructured":"Munzner, T.: Interactive visualization of large graphs and networks. Ph.D. thesis, Stanford University (2000)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Munzner, T., Burchard, P.: Visualizing the structure of the world wide web in 3d hyperbolic space. In: Proceedings of the 1995 Symposium on Virtual Reality Modeling Language, pp. 33\u201338. ACM (1995)","DOI":"10.1145\/217306.217311"},{"key":"7_CR32","unstructured":"Ontrup, J., Ritter, H.J.: Hyperbolic self-organizing maps for semantic navigation. In: Advances in Neural Information Processing Systems, vol. 14, pp. 1417\u20131424. MIT Press (2001)"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Perry, S., Yin, M.S., Gray, K., Kobourov, S.: Drawing graphs on the sphere. In: AVI 2020: International Conference on Advanced Visual Interfaces, pp. 17:1\u201317:9. ACM (2020)","DOI":"10.1145\/3399715.3399915"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. The Annals of Mathematical Statistics, pp. 400\u2013407 (1951)","DOI":"10.1214\/aoms\/1177729586"},{"key":"7_CR35","unstructured":"Ruder, S.: An overview of gradient descent optimization algorithms. CoRR abs\/1609.04747 (2016)"},{"key":"7_CR36","unstructured":"Sala, F., Sa, C.D., Gu, A., R\u00e9, C.: Representation tradeoffs for hyperbolic embeddings. In: Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 4457\u20134466. PMLR (2018)"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Schulz, H.J.: Treevis.net: a tree visualization reference. IEEE Comput. Graphics Appl. 31(6), 11\u201315 (2011)","DOI":"10.1109\/MCG.2011.103"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Shepard, R.N.: The analysis of proximities: multidimensional scaling with an unknown distance function. I. Psychometrika 27(2), 125\u2013140 (1962)","DOI":"10.1007\/BF02289630"},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2016.08.003","volume":"59","author":"K Verbeek","year":"2016","unstructured":"Verbeek, K., Suri, S.: Metric embedding, hyperbolic space, and social networks. Comput. Geom. 59, 1\u201312 (2016)","journal-title":"Comput. Geom."},{"issue":"3","key":"7_CR40","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1111\/cgf.13431","volume":"37","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Jenny, B., Dwyer, T., Marriott, K., Chen, H., Cordeil, M.: Maps and globes in virtual reality. Comput. Graph. Forum 37(3), 427\u2013438 (2018)","journal-title":"Comput. Graph. Forum"},{"issue":"9","key":"7_CR41","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1109\/TVCG.2018.2859997","volume":"25","author":"JX Zheng","year":"2019","unstructured":"Zheng, J.X., Pawar, S., Goodman, D.F.M.: Graph drawing by stochastic gradient descent. IEEE Trans. Vis. Comput. Graph. 25(9), 2738\u20132748 (2019)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"7_CR42","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1109\/TVCG.2020.3030447","volume":"27","author":"M Zhu","year":"2021","unstructured":"Zhu, M., Chen, W., Hu, Y., Hou, Y., Liu, L., Zhang, K.: DRGraph: An efficient graph layout algorithm for large-scale graphs by dimensionality reduction. IEEE Trans. Vis. Comput. Graph. 27(2), 1666\u20131676 (2021)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:03:29Z","timestamp":1704351809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","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":"25","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":"7","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":"3.01","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":"7.03","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)"}}]}}