Fast Enumeration of Pairs of Minimal Generators and Their Closure Itemsets

DOI
  • NABESHIMA Takahiro
    Conputer Science and Engineering Course, Integrated Graduate School of Medicine, Engineering and Agricultural Sciences, University of Yamanashi
  • IWANUMA Koji
    Interdisciplinary Graduate School, University of Yamanashi

Bibliographic Information

Other Title
  • 極小生成子とその閉包アイテム集合のペアの高速列挙法

Description

<p>In this paper, we propose a fast method for enumerating pairs of minimal generators and their closure itensets. A minimal generator is a lossless compressed forms of itemsets. And those set is used to compress negative association rules. The number of negative association rules extracted from a transaction database is extremely large, compared with the one of ordinary positive association rules. Therefore, some compression technique for negative rules is an inevitable and rational solution for efficient negative rule mining. We give a fast method for enumerating pairs of minimal generators and their closure itensets, which takes the form of a depth-first search over a suffix tree consisting of frequent minimal generators only. We also show some preliminary results of evaluation experiments.</p>

Journal

Keywords

Details 詳細情報について

  • CRID
    1390003825189393792
  • NII Article ID
    130007856935
  • DOI
    10.11517/pjsai.jsai2020.0_2n4os17a04
  • ISSN
    27587347
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top