期刊文献+

关联规则的分层表达 被引量:1

Presenting association rules by hierarchy
下载PDF
导出
摘要 关联规则通常以规则列表形式表达,而许多关联规则挖掘算法往往产生大量规则,这给用户理解规则和从中找出感兴趣的规则带来了极大困难。为了标识重要的规则,而又保持挖掘结果的完整性,提出了根据规则的通用性,按照由概括—具体的方式分层表达关联规则。先用挖掘结果的最概括规则集表达出最通用、最基本的领域知识,再根据用户要求分层查看概括规则下面更具体的规则。这种表达方式可以在不同层次上查看关联规则,使挖掘结果更容易管理和被人理解。 Association rules are always presented as a list of rules with no further organization. Because many existing associations mining algorithms often produce a large number of rules, it is very difficult for the user to analyze them manually. In order to highlight the important rules and not suffer from being incomplete, a technique was proposed to intuitively present the discovered association rules in a hierarchical fashion. The discovered association rules were shown at different levels according rule's generality. The technique first found a subset of the association rules called the most-general rules set to give the user a general relationship or a big picture of the original rules set. Then, the user could selectively view more specific rules bellow the general rule that were interesting to him/her. Presented in such a way, rules could be easily comprehended by users.
作者 戴敏 黄亚楼
出处 《计算机应用》 CSCD 北大核心 2006年第1期207-209,共3页 journal of Computer Applications
关键词 数据挖掘 关联规则 层次 概括规则 具体规则 data mining association rules hierarchy more-general rules more-specific rules
  • 相关文献

参考文献12

  • 1AGRAWAL R , IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases[A]. Proceedings ofthe 1993 ACM SIGMOD International Conference on Management of Data[C]. Washington, DC, 1993.
  • 2LIU B, HSU W, MA YM. Pruning and Summarizing the Discovered Associations[C]. ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD1999)[C]. San Diego, CA,USA, 1999.15 - 18.
  • 3BRIJS T, VANHOOF K, WETS G. Reducing redundancy in characteristic rule discovery by using integer programming techniques[J]. Journal of intelligent data analysis, 2000, (4) : 229 - 240.
  • 4TOIVONEN H, KLEMETINEN M, RONKAINEN P, et al. Pruning and grouping discovered association roles[A]. ECML Workshop on Statistics, Machine Learning, and Discovery in Databases[C].1995.47 - 52.
  • 5LIU B, HU MQ, HSU W. Multi-Level Organization and Summarization of the Discovered Rules[A]. KDD2000[C].2000.91 - 100.
  • 6TUZHILIN A, LIU B. Querying Multiple Sets of Discovered Rules[A]. KDD2002[C]. 2000.52 -60.
  • 7KLEMETINEN M, MANNILA H, RONKAINEN P, et al. Finding interesting rules from large sets of discovered association rules[A].Third International Conference on Information and Knowledge Management (CIKM'94)[C]. Gaithersburg, USA, 1994. 401 - 407.
  • 8LIU B, HSU W. Post-analysis of learned rules[A]. AAAI-96[C].1996. 828 - 834.
  • 9SILBERSCHATZ A, TUZHILIN A. What makes patterns interesting in knowledge discovery systems[J]. IEEE Trans. on Know and Data Eng, 1996, 8(6) : 970 -974.
  • 10ZAKI MJ. Generating non-redundant association rules[A]. KDD 2000[C]. 2000.

同被引文献11

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部