<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05547037</id>
  <dt>a</dt>
  <an>05547037</an>
  <augroup>
    <au>Suzuki, Einoshin</au>
  </augroup>
  <ti>Negative encoding length as a subjective interestingness measure for groups of rules.</ti>
  <so>Theeramunkong, Thanaruk (ed.) et al., Advances in knowledge discovery and data mining. 13th Pacific-Asia conference, PAKDD 2009, Bangkok, Thailand, April 27--30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-01306-5/pbk). Lecture Notes in Computer Science 5476. Lecture Notes in Artificial Intelligence, 220-231 (2009).</so>
  <py>2009</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-01307-2_22</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We propose an interestingness measure for groups of classification rules which are mutually related based on the Minimum Description Length Principle. Unlike conventional methods, our interestingness measure is based on a theoretical background, has no parameter, is applicable to a group of any number of rules, and can exploit an initial hypothesis. We have integrated the interestingness measure with practical heuristic search and built a rule-group discovery method CLARDEM (Classification Rule Discovery method based on an Extended-Mdlp). Extensive experiments using both real and artificial data confirm that CLARDEM can discover the correct concept from a small noisy data set and an approximate initial concept with high ``discovery accuracy''.</ab>
    <rv></rv>
  </abgroup>
</item>