.png){kind=icon}
返回
An improved association rules mining method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.08.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mining maximal frequent itemsets is of paramount relevance in many of data mining applications. The traditional algorithms address this problem through scanning databases many times. The latest research has already focused on reducing the number of scanning times of databases and then decreasing the number of accessing times of I/O resources in order to improve the overall mining efficiency of maximal frequent itemsets of association rules. In this paper, we present a form of the directed itemsets graph to store the information of frequent itemsets of transaction databases, and give the trifurcate linked list storage structure of directed itemsets graph. Furthermore, we develop the mining algorithm of maximal frequent itemsets based on this structure. As a result, one realizes scanning a database only once, and improves storage efficiency of data structure and time efficiency of mining algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Association rule
Maximal frequent itemsets
Directed itemsets graph
Trifurcate linked list storage structure
Mining algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
查看更多内容