<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">465750222</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323111832.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170327e19900301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF01889702</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF01889702</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Sriram</subfield>
   <subfield code="D">N.</subfield>
   <subfield code="u">Department of Psychology, University of Oregon, 97403, Eugene, OR, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Clique optimization: A method to construct parsimonious ultrametric trees from similarity data</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[N. Sriram]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Clique optimization (CLOPT) is a clustering procedure that reduces similarity data,S, to a hierarchy of nested partitions modeled as an ordered sequence of clique sets. In the model,M, clique sets represent partitions in the hierarchy and are strictly ordered by a parameter, α. Applied as a threshold toM, α abstracts the corresponding clique set. Cliques, or completely connected components ofM, are the elements of these sets. The clique sets and their α's are determined by incrementally minimizing Σ(s ij − m ij )2 by a combination of divisive and agglomerative operations. Both operations search for optimal solutions in a restricted, 2-dimensional space of partitions. The first clique set abstracted by CLOPT is the single partition that is closest toS. CLOPT constructs models that compare favorably with HCS and it does so using fewer parameters.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag New York Inc, 1990</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Graph clustering</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Hierarchical classification</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Heuristic search</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">NP-complete</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Classification</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">7/1(1990-03-01), 33-52</subfield>
   <subfield code="x">0176-4268</subfield>
   <subfield code="q">7:1&lt;33</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">357</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF01889702</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/BF01889702</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">Sriram</subfield>
   <subfield code="D">N.</subfield>
   <subfield code="u">Department of Psychology, University of Oregon, 97403, Eugene, OR, USA</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">Journal of Classification</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">7/1(1990-03-01), 33-52</subfield>
   <subfield code="x">0176-4268</subfield>
   <subfield code="q">7:1&lt;33</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">357</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>
