<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445331542</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142739.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20111201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10208-011-9103-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10208-011-9103-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Model Selection for Simplicial Approximation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Claire Caillerie, Bertrand Michel]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In the computational geometry field, simplicial complexes have been used to describe an underlying geometric shape knowing a point cloud sampled on it. In this article, an adequate statistical framework is first proposed for the choice of a simplicial complex among a parametrized family. A least-squares penalized criterion is introduced to choose a complex, and a model selection theorem states how to select the &quot;best” model, from a statistical point of view. This result gives the shape of the penalty, and then the &quot;slope heuristics method” is used to calibrate the penalty from the data. Some experimental studies on simulated and real datasets illustrate the method for the selection of graphs and simplicial complexes of dimension two.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">SFoCM, 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Computational geometry</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Geometric inference</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Simplicial complexes</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Model selection</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Penalization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Slope heuristics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Spectral clustering</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Caillerie</subfield>
   <subfield code="D">Claire</subfield>
   <subfield code="u">INRIA Saclay, Parc Club Orsay Université, 2-4 rue Jacques Monod, 91893, Orsay Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Michel</subfield>
   <subfield code="D">Bertrand</subfield>
   <subfield code="u">LSTA UPMC, 4 place Jussieu, 75252, Paris cedex 05, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Foundations of Computational Mathematics</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">11/6(2011-12-01), 707-731</subfield>
   <subfield code="x">1615-3375</subfield>
   <subfield code="q">11:6&lt;707</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">11</subfield>
   <subfield code="o">10208</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10208-011-9103-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10208-011-9103-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Caillerie</subfield>
   <subfield code="D">Claire</subfield>
   <subfield code="u">INRIA Saclay, Parc Club Orsay Université, 2-4 rue Jacques Monod, 91893, Orsay Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Michel</subfield>
   <subfield code="D">Bertrand</subfield>
   <subfield code="u">LSTA UPMC, 4 place Jussieu, 75252, Paris cedex 05, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Foundations of Computational Mathematics</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">11/6(2011-12-01), 707-731</subfield>
   <subfield code="x">1615-3375</subfield>
   <subfield code="q">11:6&lt;707</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">11</subfield>
   <subfield code="o">10208</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
