<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
  <mods>
    <titleInfo>
      <title>Multidimensional scaling with very large datasets</title>
    </titleInfo>
    <name type="personnal">
      <namePart type="family">Paradis</namePart>
      <namePart type="given">Emmanuel</namePart>
      <role>
        <roleTerm type="text">auteur</roleTerm>
        <roleTerm type="code" authority="marcrelator">aut</roleTerm>
      </role>
      <affiliation>IRD</affiliation>
    </name>
    <typeOfResource>text</typeOfResource>
    <genre authority="local">journalArticle</genre>
    <language>
      <languageTerm type="code" authority="iso639-2b">eng</languageTerm>
    </language>
    <physicalDescription>
      <internetMediaType>text/pdf</internetMediaType>
      <digitalOrigin>born digital</digitalOrigin>
      <reformattingQuality>access</reformattingQuality>
    </physicalDescription>
    <abstract>Multidimensional scaling has a wide range of applications when observations are not continuous but it is possible to define a distance (or dissimilarity) among them. However, standard implementations are limited when analyzing very large datasets because they rely on eigendecomposition of the full distance matrix and require very long computing times and large quantities of memory. Here, a new approach is developed based on projection of the observations in a space defined by a subset of the full dataset. The method is easily implemented. A simulation study showed that its performance are satisfactory in different situations and can be run in a short time when the standard method takes a very long time or cannot be run because of memory requirements.</abstract>
    <targetAudience authority="marctarget">specialized</targetAudience>
    <subject>
      <topic>Dimension reduction</topic>
      <topic>Distance data</topic>
      <topic>Projection method</topic>
      <topic>Random matrices</topic>
    </subject>
    <classification authority="local">020</classification>
    <classification authority="local">122</classification>
    <relatedItem type="host">
      <titleInfo>
        <title>Journal of Computational and Graphical Statistics</title>
      </titleInfo>
      <part>
        <detail type="volume">
          <number>27</number>
        </detail>
        <detail type="volume">
          <number>4</number>
        </detail>
        <extent unit="pages">
          <list> 935-939</list>
        </extent>
      </part>
      <originInfo>
        <dateIssued>2018</dateIssued>
      </originInfo>
      <identifier type="issn">1061-8600</identifier>
    </relatedItem>
    <identifier type="uri">https://www.documentation.ird.fr/hor/fdi:010074791</identifier>
    <identifier type="doi">10.1080/10618600.2018.1470001</identifier>
    <identifier type="issn">1061-8600</identifier>
    <location>
      <shelfLocator>[F B010074791]</shelfLocator>
      <url usage="primary display" access="object in context">https://www.documentation.ird.fr/hor/fdi:010074791</url>
      <url access="row object">https://www.documentation.ird.fr/intranet/publi/2018/12/010074791.pdf</url>
    </location>
    <accessCondition type="restriction access" displayLabel="Accès réservé">Accès réservé (Intranet de l'IRD)</accessCondition>
    <recordInfo>
      <recordContentSource>IRD - Base Horizon / Pleins textes</recordContentSource>
      <recordCreationDate encoding="w3cdtf">2019-01-10</recordCreationDate>
      <recordChangeDate encoding="w3cdtf">2023-07-11</recordChangeDate>
      <recordIdentifier>fdi:010074791</recordIdentifier>
      <languageOfCataloging>
        <languageTerm authority="iso639-2b">fre</languageTerm>
      </languageOfCataloging>
    </recordInfo>
  </mods>
</modsCollection>
