<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">60554123X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100915.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150501xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00371-014-0991-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00371-014-0991-9</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Efficient kernel discriminative common vectors for classification</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Jianwei Zheng, Qiongfang Huang, Shengyong Chen, Wanliang Wang]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Kernel discriminant analysis (KDA) which operates in the reproducing kernel Hilbert space (RKHS) is a very popular approach to dimensionality reduction. Kernel discriminative common vectors (KDCV) shares the same modified Fisher linear discriminant criterion with KDA and guarantees a 100% recognition rate for the training set samples as well as favorable generalization performance. However, KDCV has the disadvantage of high computational complexity in both the training and the testing stage. This paper attempts to improve the computation efficiency of KDCV by two strategies. First, the Cholesky decomposition is introduced to obtain the projection matrix instead of eigen-decomposition. Second, we replace the matrix operation with vector operation in the testing process which reduces the computational complexity. Extensive experiments on COIL images dataset, ORL faces dataset, PIE faces dataset, and USPS handwritten digits dataset demonstrate that the proposed algorithm is more efficient than the traditional KDCV algorithm without loss of accuracy.</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">Feature extraction</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Kernel discriminative common vector</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cholesky decomposition</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Kernel trick</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zheng</subfield>
   <subfield code="D">Jianwei</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Huang</subfield>
   <subfield code="D">Qiongfang</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Chen</subfield>
   <subfield code="D">Shengyong</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wang</subfield>
   <subfield code="D">Wanliang</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">The Visual Computer</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">31/5(2015-05-01), 643-655</subfield>
   <subfield code="x">0178-2789</subfield>
   <subfield code="q">31:5&lt;643</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">371</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00371-014-0991-9</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/s00371-014-0991-9</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">Zheng</subfield>
   <subfield code="D">Jianwei</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, 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">Huang</subfield>
   <subfield code="D">Qiongfang</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, 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">Chen</subfield>
   <subfield code="D">Shengyong</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, 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">Wang</subfield>
   <subfield code="D">Wanliang</subfield>
   <subfield code="u">College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, 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">The Visual Computer</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">31/5(2015-05-01), 643-655</subfield>
   <subfield code="x">0178-2789</subfield>
   <subfield code="q">31:5&lt;643</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">371</subfield>
  </datafield>
 </record>
</collection>
