{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:42:39Z","timestamp":1726044159605},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307851"},{"type":"electronic","value":"9783030307868"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_16","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"205-217","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Geometric Representations of Dichotomous Ordinal Data"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"16_CR1","unstructured":"Agarwal, S., Wills, J., Cayton, L., Lanckriet, G.R.G., Kriegman, D.J., Belongie, S.J.: Generalized non-metric multidimensional scaling. In: Meila, M., Shen, X. (eds.) AISTATS. JMLR Proceedings, vol. 2, pp. 11\u201318. JMLR.org (2007)"},{"key":"16_CR2","unstructured":"Aichholzer, O., Hoffmann, M., van Kreveld, M.J., Rote, G.: Graph drawings with relative edge length specifications. In: CCCG (2014)"},{"key":"16_CR3","first-page":"137","volume":"13","author":"N Ailon","year":"2012","unstructured":"Ailon, N.: An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity. J. Mach. Learn. Res. 13, 137\u2013164 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-53174-7_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MJ Alam","year":"2016","unstructured":"Alam, M.J., Kobourov, S.G., Pupyrev, S., Toeniskoetter, J.: Weak unit disk and interval representation of graphs. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 237\u2013251. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_17"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"46:1","DOI":"10.1145\/1383369.1383377","volume":"4","author":"N Alon","year":"2008","unstructured":"Alon, N., Badoiu, M., Demaine, E.D., Farach-Colton, M., Hajiaghayi, M.T., Sidiropoulos, A.: Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. ACM Trans. Algorithms 4(4), 46:1\u201346:21 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02288932","volume":"25","author":"JF Bennett","year":"1960","unstructured":"Bennett, J.F., Hays, W.L.: Multidimensional unfolding: determining the dimensionality of ranked preference data. Psychometrika 25(1), 27\u201343 (1960)","journal-title":"Psychometrika"},{"key":"16_CR7","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (2005)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.7155\/jgaa.00145","volume":"11","author":"S Cabello","year":"2007","unstructured":"Cabello, S., Demaine, E.D., Rote, G.: Planar embeddings of graphs with specified edge lengths. J. Graph Algorithms Appl. 11(1), 259\u2013276 (2007)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00355-016-1011-y","volume":"48","author":"J Chen","year":"2017","unstructured":"Chen, J., Pruhs, K., Woeginger, G.J.: The one-dimensional Euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. 48(2), 409\u2013432 (2017)","journal-title":"Soc. Choice Welf."},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"J Doignon","year":"1994","unstructured":"Doignon, J., Falmagne, J.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithms"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P Eades","year":"1990","unstructured":"Eades, P., Wormald, N.C.: Fixed edge-length graph drawing is NP-hard. Discret. Appl. Math. 28(2), 111\u2013134 (1990)","journal-title":"Discret. Appl. Math."},{"key":"16_CR12","unstructured":"Elkind, E., Lackner, M.: Structure in dichotomous preferences. In: Yang, Q., Wooldridge, M. (eds.) IJCAI, pp. 2019\u20132025. AAAI Press (2015)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Jamieson, K.G., Nowak, R.D.: Low-dimensional embedding using adaptively selected ordinal data. In: Allerton Conference on Communication, Control, and Computer, pp. 1077\u20131084. IEEE (2011)","DOI":"10.1109\/Allerton.2011.6120287"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"J Kruskal","year":"1964","unstructured":"Kruskal, J.: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29(1), 1\u201327 (1964)","journal-title":"Psychometrika"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02289694","volume":"29","author":"J Kruskal","year":"1964","unstructured":"Kruskal, J.: Nonmetric multidimensional scaling: a numerical method. Psychometrika 29(2), 115\u2013129 (1964)","journal-title":"Psychometrika"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Peters, D.: Recognising multidimensional Euclidean preferences. In: Singh, S.P., Markovitch, S. (eds.) AAAI, pp. 642\u2013648. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10616"},{"key":"16_CR17","first-page":"399","volume":"5","author":"M Quist","year":"2004","unstructured":"Quist, M., Yona, G., Yu, B.: Distributional scaling: an algorithm for structure-preserving embedding of metric and nonmetric spaces. J. Mach. Learn. Res. 5, 399\u2013420 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR18","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in $$k$$ -space is strongly NP-hard. In: 17th Allerton Conference on Communication, Control, and Computer, pp. 480\u2013489. IEEE (1979)"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02289630","volume":"27","author":"RN Shepard","year":"1962","unstructured":"Shepard, R.N.: The analysis of proximities: multidimensional scaling with an unknown distance function. I. Psychometrika 27(2), 125\u2013140 (1962)","journal-title":"Psychometrika"},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02289621","volume":"27","author":"RN Shepard","year":"1962","unstructured":"Shepard, R.N.: The analysis of proximities: multidimensional scaling with an unknown distance function. II. Psychometrika 27(3), 219\u2013246 (1962)","journal-title":"Psychometrika"},{"key":"16_CR21","unstructured":"Terada, Y., von Luxburg, U.: Local ordinal embedding. In: ICML. JMLR Workshop and Conference Proceedings, vol. 32, pp. 847\u2013855. JMLR.org (2014)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-69848-7_34","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"D Vo","year":"2008","unstructured":"Vo, D., Vo, N., Challa, S.: Weighted MDS for Sensor Localization. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008. LNCS, vol. 5073, pp. 409\u2013418. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69848-7_34"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T04:31:03Z","timestamp":1695184263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.4","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-2","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)"}}]}}