<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475834089</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123849.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/PL00009895</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/PL00009895</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Assessing the Impact of Input Features in a Feedforward Neural Network</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[W. Wang, P. Jones, D. Partridge]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">For a variety of reasons, the relative impacts of neural-net inputs on the output of a network's computation is valuable information to obtain. In particular, it is desirable to identify the significant features, or inputs, of a data-defined problem before the data is sufficiently preprocessed to enable high performance neural-net training. We have defined and tested a technique for assessing such input impacts, which will be compared with a method described in a paper published earlier in this journal. The new approach, known as the ‘clamping' technique, offers efficient impact assessment of the input features of the problem. Results of the clamping technique prove to be robust under a variety of different network configurations. Differences in architecture, training parameter values and subsets of the data all deliver much the same impact rankings, which supports the notion that the technique ranks an inherent property of the available data rather than a property of any particular feedforward neural network. The success, stability and efficiency of the clamping technique are shown to hold for a number of different real-world problems. In addition, we subject the previously published technique, which we will call the ‘weight product' technique, to the same tests in order to provide directly comparable information.:</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag London Limited, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Keywords:Clamping</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Feature salience ranking</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Input impact</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Neural networks</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wang</subfield>
   <subfield code="D">W.</subfield>
   <subfield code="u">Department of Computer Science, School of Engineering and Computer Science, University of Exeter, Exeter, UK, GB</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Jones</subfield>
   <subfield code="D">P.</subfield>
   <subfield code="u">Department of Computer Science, School of Engineering and Computer Science, University of Exeter, Exeter, UK, GB</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Partridge</subfield>
   <subfield code="D">D.</subfield>
   <subfield code="u">Department of Computer Science, School of Engineering and Computer Science, University of Exeter, Exeter, UK, GB</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/PL00009895</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/PL00009895</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">Wang</subfield>
   <subfield code="D">W.</subfield>
   <subfield code="u">Department of Computer Science, School of Engineering and Computer Science, University of Exeter, Exeter, UK, GB</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">Jones</subfield>
   <subfield code="D">P.</subfield>
   <subfield code="u">Department of Computer Science, School of Engineering and Computer Science, University of Exeter, Exeter, UK, GB</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">Partridge</subfield>
   <subfield code="D">D.</subfield>
   <subfield code="u">Department of Computer Science, School of Engineering and Computer Science, University of Exeter, Exeter, UK, GB</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>
