返回
Mining association rules with multi-dimensional constraints
DOI:10.1016/j.jss.2005.03.005.png)
摘要
En 中文
To improve the effectiveness and efficiency of mining tasks, constraint-based mining enables users to concentrate on mining their interested association rules instead of the complete set of association rules. Previously proposed methods are mainly contributed to handling a single constraint and only consider the constraints which are characterized by a single attribute value. In this paper, we propose an approach to mine association rules with multiple constraints constructed by multi-dimensional attribute values. Our proposed approach basically consists of three phases. First, we collect the frequent items and prune infrequent items according to the Apriori property. Second, we exploit the properties of the given constraints to prune search space or save constraint checking in the conditional databases. Third, for each itemset possible to satisfy the constraint, we generate its conditional database and perform the three phases in the conditional database recursively. Our proposed algorithms can exploit the properties of constraints to prune search space or save constraint checking. Therefore, our proposed algorithm is more efficient than the revised FP-growth and FIC algorithms. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
data mining
association rule
constraint-based mining
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
The over-expression of survivin enhances the chemotherapeutic efficacy of YM155 in human hepatocellular carcinoma
Oncotarget
IF0
Regional differences in the effect of guanine nucleotides on agonist and antagonist binding to adenosine A1-receptors in rat brain, as revealed by autoradiography
Neuroscience
IF0
没有更多内容

