<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475788532</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123705.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/PL00008176</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/PL00008176</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Dunn</subfield>
   <subfield code="D">John C.</subfield>
   <subfield code="u">Department of Psychiatry and Behavioural Science, University of Western Australia, WA, Australia, 6907; Tel.: +618 9346 2251; Fax: +618 9346 3828 E-mail: jdunn@cyllene.uwa.edu.au;, AU</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Model complexity: The fit to random data reconsidered</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[John C. Dunn]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A recent controversy in the field of depth perception has highlighted an important aspect of model testing concerning a model's complexity, defined as the prior propensity of the model to fit arbitrary data sets. The present article introduces an index of complexity, called the mean minimum distance, defined as the average squared distance between an arbitrary data point and the prediction range of the model. It may also be expressed as a dimensionless quantity called the scaled mean minimum distance. For linear models, theoretical values for the scaled mean minimum distance and the variance of the scaled minimum distance can be readily obtained and compared against empirical estimates obtained from fits to random data. The approach is applied to resolving the question of the relative complexity of the Linear Integration model and the Fuzzy Logic of Perception model, both of which have been the subject of controversy in the field of depth perception. It is concluded that the two models are equally complex.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2000</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/PL00008176</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/PL00008176</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dunn</subfield>
   <subfield code="D">John C.</subfield>
   <subfield code="u">Department of Psychiatry and Behavioural Science, University of Western Australia, WA, Australia, 6907; Tel.: +618 9346 2251; Fax: +618 9346 3828 E-mail: jdunn@cyllene.uwa.edu.au;, AU</subfield>
   <subfield code="4">aut</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>
