<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05806519</id>
  <dt>a</dt>
  <an>05806519</an>
  <augroup>
    <au>Krone, Martin</au>
    <au>Klawonn, Frank</au>
  </augroup>
  <ti>Rank correlation coefficient correction by removing worst cases.</ti>
  <so>H\"ullermeier, Eyke (ed.) et al., Information processing and management of uncertainty in knowledge-based systems. Theory and methods. 13th international conference, IPMU 2010, Dortmund, Germany, June 28--July 2, 2010. Proceedings. Part I. Berlin: Springer (ISBN 978-3-642-14054-9/pbk; 978-3-642-14055-6/ebook). Communications in Computer and Information Science 80, 356-364 (2010).</so>
  <py>2010</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>rank correlation coefficient</ut>
    <ut>greedy algorithm</ut>
    <ut>graph algorithms</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-14055-6_37</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Rank correlation can be used to compare two linearly ordered rankings. If the rankings include noise values, the rank correlation coefficient will yield lower values than it actually should. In this paper, we propose an algorithm to remove pairs of values from rankings in order to increase Kendall's tau rank correlation coefficient. The problem itself is motivated from real data in bioinformatics context.</ab>
    <rv></rv>
  </abgroup>
</item>