{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T18:29:48Z","timestamp":1791570588540,"version":"4.3.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2020-116294GB-I00"],"award-info":[{"award-number":["PID2020-116294GB-I00"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003030","name":"Ag\u00e8ncia de Gesti\u00f3 d\u2019Ajuts Universitaris i de Recerca","doi-asserted-by":"publisher","award":["2020 FI SDUR 306"],"award-info":[{"award-number":["2020 FI SDUR 306"]}],"id":[{"id":"10.13039\/501100003030","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003030","name":"Ag\u00e8ncia de Gesti\u00f3 d\u2019Ajuts Universitaris i de Recerca","doi-asserted-by":"publisher","award":["2021 SGR 00613"],"award-info":[{"award-number":["2021 SGR 00613"]}],"id":[{"id":"10.13039\/501100003030","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014374","name":"Universitat Polit\u00e8cnica de Catalunya","doi-asserted-by":"publisher","award":["AGRUPS-2022"],"award-info":[{"award-number":["AGRUPS-2022"]}],"id":[{"id":"10.13039\/501100014374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014374","name":"Universitat Polit\u00e8cnica de Catalunya","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014374","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We present a set of algorithms implementing multidimensional scaling (MDS) for large data sets. MDS is a family of dimensionality reduction techniques using a\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$n \\times n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mo>\u00d7<\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    distance matrix as input, where\n                    <jats:italic>n<\/jats:italic>\n                    is the number of individuals, and producing a low dimensional configuration: a\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$n\\times r$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mo>\u00d7<\/mml:mo>\n                            <mml:mi>r<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    matrix with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$r&lt;&lt;n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>r<\/mml:mi>\n                            <mml:mo>&lt;<\/mml:mo>\n                            <mml:mo>&lt;<\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . When\n                    <jats:italic>n<\/jats:italic>\n                    is large, MDS is unaffordable with classical MDS algorithms because their extremely large memory and time requirements. We compare six non-standard algorithms intended to overcome these difficulties. They are based on the central idea of partitioning the data set into small pieces, where classical MDS methods can work. Two of these algorithms are original proposals. In order to check the performance of the algorithms as well as to compare them, we have done a simulation study. Additionally, we have used the algorithms to obtain an MDS configuration for EMNIST: a real large data set with more than 800000 points. We conclude that all the algorithms are appropriate to use for obtaining an MDS configuration, but we recommend to use one of our proposals, since it is a fast algorithm with satisfactory statistical properties when working with big data. An  package implementing the algorithms has been created.\n                  <\/jats:p>","DOI":"10.1007\/s11634-024-00591-9","type":"journal-article","created":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T07:01:59Z","timestamp":1712991719000},"page":"649-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Multidimensional scaling for big data"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3933-4852","authenticated-orcid":false,"given":"Pedro","family":"Delicado","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-4874","authenticated-orcid":false,"given":"Cristian","family":"Pach\u00f3n-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"issue":"3","key":"591_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1008861.1008865","volume":"12","author":"JL Bentley","year":"1980","unstructured":"Bentley JL, Haken D, Saxe JB (1980) A general method for solving divide-and-conquer recurrences. ACM SIGACT News 12(3):36\u201344","journal-title":"ACM SIGACT News"},{"key":"591_CR2","volume-title":"Modern multidimensional scaling: theory and applications","author":"I Borg","year":"2005","unstructured":"Borg I, Groenen P (2005) Modern multidimensional scaling: theory and applications. Springer, Berlin"},{"key":"591_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-70904-6_6","volume-title":"Graph drawing","author":"U Brandes","year":"2007","unstructured":"Brandes U, Pich C (2007) Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann M, Wagner D (eds) Graph drawing. Springer, Berlin, pp 42\u201353"},{"key":"591_CR4","doi-asserted-by":"crossref","unstructured":"Cohen G,\u00a0Afshar S,\u00a0Tapson J,\u00a0van Schaik A (2017) Emnist: extending mnist to handwritten letters. In: 2017 International joint conference on neural networks (IJCNN), pp 2921\u20132926","DOI":"10.1109\/IJCNN.2017.7966217"},{"key":"591_CR5","unstructured":"De\u00a0Silva V, Tenenbaum JB (2004) Sparse multidimensional scaling using landmark points. Technical report, Technical Report, Stanford University"},{"key":"591_CR6","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Lin KI (1995) Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, SIGMOD \u201995, New York, NY, USA, pp. 163-174. Association for Computing Machinery","DOI":"10.1145\/223784.223812"},{"issue":"3\u20134","key":"591_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/biomet\/53.3-4.325","volume":"53","author":"JC Gower","year":"1966","unstructured":"Gower JC (1966) Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika 53(3\u20134):325\u2013338","journal-title":"Biometrika"},{"issue":"3","key":"591_CR8","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1093\/biomet\/55.3.582","volume":"55","author":"JC Gower","year":"1968","unstructured":"Gower JC (1968) Adding a point to vector diagrams in multivariate analysis. Biometrika 55(3):582\u2013585","journal-title":"Biometrika"},{"key":"591_CR9","volume-title":"Biplots","author":"JC Gower","year":"1995","unstructured":"Gower JC, Hand DJ (1995) Biplots, vol 54. CRC Press, Boca Raton"},{"key":"591_CR10","unstructured":"Grother P (1970) NIST special database 19. NIST handprinted forms and characters database"},{"key":"591_CR11","unstructured":"Korobeynikov A, Larsen RM, Laboratory LBN (2022) svd: interfaces to various State-of-Art SVD and Eigensolvers. R package version 0.5.2"},{"key":"591_CR12","series-title":"Oxford statistical science series","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198507086.001.0001","volume-title":"Principles of multivariate analysis","author":"W Krzanowski","year":"2000","unstructured":"Krzanowski W (2000) Principles of multivariate analysis, vol 23, Revised. Oxford statistical science series. OUP, Oxford","edition":"Revised"},{"key":"591_CR13","unstructured":"LeCun Y,\u00a0Cortes C (2010) MNIST handwritten digit database. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"issue":"4","key":"591_CR14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.15199\/42.2022.4.2","volume":"1","author":"O Mersmann","year":"2023","unstructured":"Mersmann O (2023) Microbenchmark: accurate timing functions. R package version 1(4):10","journal-title":"R package version"},{"key":"591_CR15","unstructured":"Pach\u00f3n-Garc\u00eda C (2019) Multidimensional scaling for big data. http:\/\/hdl.handle.net\/2117\/127318"},{"issue":"4","key":"591_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1080\/10618600.2018.1470001","volume":"27","author":"E Paradis","year":"2018","unstructured":"Paradis E (2018) Multidimensional scaling with very large datasets. J. Comput. Graph. Stat. 27(4):935\u2013939. https:\/\/doi.org\/10.1080\/10618600.2018.1470001","journal-title":"J. Comput. Graph. Stat."},{"key":"591_CR17","doi-asserted-by":"publisher","unstructured":"Paradis E (2021) Reduced multidimensional scaling. Computational Statistics: Published on\u2013line 05 June 2021. https:\/\/doi.org\/10.1007\/s00180-021-01116-0","DOI":"10.1007\/s00180-021-01116-0"},{"key":"591_CR18","unstructured":"Platt J (2005) Fastmap, metricmap, and landmark mds are all nystr\u00f6m algorithms. In: RG Cowell and Z\u00a0Ghahramani (Eds.), Proceedings of the tenth international workshop on artificial intelligence and statistics, Vol\u00a0R5 of Proceedings of machine learning research, pp. 261\u2013268. PMLR. Reissued by PMLR on 30 March 2021"},{"key":"591_CR19","volume-title":"R: A language and environment for statistical computing","author":"R Core Team","year":"2020","unstructured":"R Core Team (2020) R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria"},{"issue":"4","key":"591_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson WS (1952) Multidimensional scaling: I theory and method. Psychometrika 17(4):401\u2013419","journal-title":"Psychometrika"},{"key":"591_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical linear algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen LN, Bau D (1997) Numerical linear algebra. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"591_CR22","doi-asserted-by":"crossref","unstructured":"Wang JTL,\u00a0Wang X, Lin KI,\u00a0Shasha D, Shapiro BA,\u00a0Zhang K (1999) Evaluating a class of distance-mapping algorithms for data mining and clustering. In: Proceedings of the Fifth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201999, New York, USA, pp 307-311. Association for Computing Machinery","DOI":"10.1145\/312129.312264"},{"issue":"2","key":"591_CR23","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/S0895479898334605","volume":"22","author":"K Wu","year":"2000","unstructured":"Wu K, Simon H (2000) Thick-restart Lanczos method for large symmetric eigenvalue problems. SIAM J Matrix Anal Appl 22(2):602\u2013616. https:\/\/doi.org\/10.1137\/S0895479898334605","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"591_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1824801.1824805","volume":"37","author":"I Yamazaki","year":"2010","unstructured":"Yamazaki I, Bai Z, Simon H, Wang LW, Wu K (2010) Adaptive projection subspace dimension for the thick-restart Lanczos method. ACM Trans Math Softw 37(3):85. https:\/\/doi.org\/10.1145\/1824801.1824805","journal-title":"ACM Trans Math Softw"},{"key":"591_CR25","unstructured":"Yang T, Liu J, McMillan L, Wei  W (2006) A fast approximation to multidimensional scaling. In: Proceedings of the ECCV workshop on computation intensive methods for computer vision (CIMCV)"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-024-00591-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-024-00591-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-024-00591-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:47:41Z","timestamp":1758264461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-024-00591-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,13]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["591"],"URL":"https:\/\/doi.org\/10.1007\/s11634-024-00591-9","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,13]]},"assertion":[{"value":"27 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2024","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"In this article, in the affiliation part, the spelling of the word \u201cPolit\u00e8cnica\u201d was incorrect. This has been corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors declare that they do not have financial or nonfinancial interests that are directly or indirectly related to the work submitted for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}