首页    期刊浏览 2024年12月12日 星期四
登录注册

文章基本信息

  • 标题:利得の最適連想規則を求める線形時間アルゴリズムの導出
  • 本地全文:下载
  • 作者:篠埜 功 ; 胡 振江 ; 武市 正人
  • 期刊名称:コンピュータ ソフトウェア
  • 印刷版ISSN:0289-6540
  • 出版年度:2002
  • 卷号:19
  • 期号:4
  • 页码:283-288
  • DOI:10.11309/jssst.19.283
  • 出版社:Japan Society for Software Science and Technology
  • 摘要:

    Data mining, which is a technology for obtaining useful knowledge from large database, has been gradually recognized as an important subject. Algorithms for data mining have to be efficient since target database is often huge, and various kinds of efficient algorithms for data mining are individually investigated. This paper shows that an efficient linear time algorithm for mining optimized gain association rules can be systematically derived from a simple specification by reducing it to an instance of the maximum marking problem. Our approach not only automatically guarantees the correctness of the derived algorithm, but also is easy to derive new algorithms for modification of the problem.

国家哲学社会科学文献中心版权所有