{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T03:20:20Z","timestamp":1777778420846,"version":"3.51.4"},"reference-count":16,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Visualization"],"published-print":{"date-parts":[[2004,3]]},"abstract":"<jats:p>This paper introduces a method called relational perspective map (RPM) to visualize distance information in high-dimensional spaces. Like conventional multidimensional scaling, the RPM algorithm aims to produce proximity preserving 2-dimensional (2-D) maps. The main idea of the RPM algorithm is to simulate a multiparticle system on a closed surface: whereas the repulsive forces between the particles reflect the distance information, the closed surface holds the whole system in balance and prevents the resulting map from degeneracy. A special feature of RPM algorithm is its ability to partition a complex dataset into pieces and map them onto a 2-D space without overlapping. Compared to other multidimensional scaling methods, RPM is able to reveal more local details of complex datasets. This paper demonstrates the properties of RPM maps with four examples and provides extensive comparison to other multidimensional scaling methods, such as Sammon Mapping and Curvilinear Principle Analysis.<\/jats:p>","DOI":"10.1057\/palgrave.ivs.9500051","type":"journal-article","created":{"date-parts":[[2004,2,26]],"date-time":"2004-02-26T04:51:06Z","timestamp":1077771066000},"page":"49-59","source":"Crossref","is-referenced-by-count":40,"title":["Visualization of High-Dimensional Data with Relational Perspective Map"],"prefix":"10.1177","volume":"3","author":[{"given":"James Xinzhi","family":"Li","sequence":"first","affiliation":[{"name":"Edgehill Dr. NW Calgary, Alberta, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2004,3,1]]},"reference":[{"key":"bibr1-palgrave.ivs.9500051","volume-title":"Multidimensional Scaling","author":"Cox T","year":"1994"},{"key":"bibr2-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2711-1"},{"key":"bibr3-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222678"},{"key":"bibr4-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294052"},{"key":"bibr5-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1109\/72.554199"},{"key":"bibr6-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"bibr7-palgrave.ivs.9500051","unstructured":"Lee JA, Lendasse A, Donckers N, Verleysen M. A robust nonlinear projection method. In: Proceedings of ESANN' 2000, 8th European Symposition on Artificial Neural Networks (Bruges, Belgium, 2000), M. D-Facto public, 13\u201320."},{"key":"bibr8-palgrave.ivs.9500051","unstructured":"Lee JA, Lendasse A, Verleysen B. Curvlinear distance analysis versus Isomap. In: Proceedings of European Symposium on Artifical Neural Networks (Bruges, Belgium, 2002); d-side publications, 185\u2013192."},{"key":"bibr9-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500040"},{"key":"bibr10-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1007\/BF00337288"},{"key":"bibr11-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"bibr12-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1119\/1.14440"},{"key":"bibr13-palgrave.ivs.9500051","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1"},{"key":"bibr14-palgrave.ivs.9500051","unstructured":"Press WH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical Recipes in C++ (2nd Edition). Cambridge University Press: Cambridge, 2002, 366\u2013372."},{"key":"bibr15-palgrave.ivs.9500051","unstructured":"VisuMap Technologies, VisuMap version 1.4 (standard edition). The software program used to produce examples in this paper. This program and associated datasets can be downloaded at http:\/\/www.visumap.net (accessed August 9, 2003)."},{"key":"bibr16-palgrave.ivs.9500051","unstructured":"H\u00e9rault J, Gu\u00e9rin-Dugu\u00e9 A, Villemain P. Searching for the embedded manifolds in high-dimensional data, problems and unsolved questions. European Conference on Artificial Neural Networks (Bruges, Belgium, 2002)."}],"container-title":["Information Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1057\/palgrave.ivs.9500051","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1057\/palgrave.ivs.9500051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:19:28Z","timestamp":1777490368000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1057\/palgrave.ivs.9500051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["10.1057\/palgrave.ivs.9500051"],"URL":"https:\/\/doi.org\/10.1057\/palgrave.ivs.9500051","relation":{},"ISSN":["1473-8716","1473-8724"],"issn-type":[{"value":"1473-8716","type":"print"},{"value":"1473-8724","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}