<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605468370</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100316.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00500-014-1450-2</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00500-014-1450-2</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">NestDE: generic parameters tuning for automatic story segmentation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Wei Feng, Xuefei Yin, Yifeng Zhang, Lei Xie]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Parameters tuning is a crucial task in automatic story segmentation. For most previous story segmentation methods, however, the parameters were simply derived from empirical tuning, which may indeed harm the fairness of the evaluation, or even misguide the conclusion. In this paper, we present a general parameters tuning approach, namely nested differential evolution. As a practical general-purpose parameters tuner, our approach itself is parameters-robust and is generic enough to optimize the most usual types of parameters for the given corpus and evaluation criterion. Besides, our approach is able to cooperate with empirical tuning and jointly produce better parameters based on the prior knowledge of experienced users. Extensive experiments on synthetic challenging quadratic pseudo-Boolean optimization and real-world story segmentation tasks validate the superior performance of our approach over traditional empirical tuning and other generic optimizers, such as simulated annealing and classical differential evolution.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Generic parameters tuning</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Nested differential evolution (NestDE)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Automatic story segmentation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Quadratic pseudo-Boolean optimization (QPBO)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Feng</subfield>
   <subfield code="D">Wei</subfield>
   <subfield code="u">Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yin</subfield>
   <subfield code="D">Xuefei</subfield>
   <subfield code="u">Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zhang</subfield>
   <subfield code="D">Yifeng</subfield>
   <subfield code="u">Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Xie</subfield>
   <subfield code="D">Lei</subfield>
   <subfield code="u">School of Computer Science, Northwestern Polytechnical University, Xi'an, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/1(2015-01-01), 61-70</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:1&lt;61</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00500-014-1450-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s00500-014-1450-2</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">Feng</subfield>
   <subfield code="D">Wei</subfield>
   <subfield code="u">Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, China</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">Yin</subfield>
   <subfield code="D">Xuefei</subfield>
   <subfield code="u">Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, China</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">Zhang</subfield>
   <subfield code="D">Yifeng</subfield>
   <subfield code="u">Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, China</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">Xie</subfield>
   <subfield code="D">Lei</subfield>
   <subfield code="u">School of Computer Science, Northwestern Polytechnical University, Xi'an, China</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">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/1(2015-01-01), 61-70</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:1&lt;61</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
 </record>
</collection>
