<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06106080</id>
  <dt>a</dt>
  <an>06106080</an>
  <augroup>
    <au>D'yakonov, Alexander</au>
  </augroup>
  <ti>A blending of simple algorithms for topical classification.</ti>
  <so>Yao, JingTao (ed.) et al., Rough sets and current trends in computing. 8th international conference, RSCTC 2012, Chengdu, China, August 17--20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32114-6/pbk). Lecture Notes in Computer Science 7413. Lecture Notes in Artificial Intelligence, 432-438 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>topical classification</ut>
    <ut>blending</ut>
    <ut>simple algorithms</ut>
    <ut>text classification</ut>
    <ut>SVD</ut>
    <ut>SVM</ut>
    <ut>k-NN</ut>
    <ut>linear classifier</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-32115-3_51</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Algorithm which has taken the third place in ``JRS 2012 Data Mining Competition'' among 126 participants is described. The competition was related to the problem of predicting topical classification of scientific publications in a field of biomedicine. The presented algorithm is a combination (blend) of simple classification algorithms: a linear classifier, a k-NN classifier and two SVMs. We build the combination using special estimation matrices. It proves again that combinations have significantly better performance compared to their individual members.</ab>
    <rv></rv>
  </abgroup>
</item>