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

文章基本信息

  • 标题:Discovering Non-Redundant Association Rules using MinMax Approximation Rules
  • 本地全文:下载
  • 作者:R. Vijaya Prakash ; Dr.A. Govardhan ; Prof. SSVN. Sarma
  • 期刊名称:Indian Journal of Computer Science and Engineering
  • 印刷版ISSN:2231-3850
  • 电子版ISSN:0976-5166
  • 出版年度:2012
  • 卷号:3
  • 期号:6
  • 页码:796-802
  • 出版社:Engg Journals Publications
  • 摘要:Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redundant. Mining Non-Redundant Frequent patterns is a big concern in the area of Association rule mining. In this paper we proposed a method to eliminate the redundant Frequent patterns using MinMax rule approach, to generate the quality Association Rules.
  • 关键词:Frequent Pattern; Association Rule Mining (ARM); Non-Redundant Frequent Pattern; MinMaxExact; MinMaxApproax Rules
国家哲学社会科学文献中心版权所有