.png){kind=icon}
Return
An improved association rules mining method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.08.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Association rule
Maximal frequent itemsets
Directed itemsets graph
Trifurcate linked list storage structure
Mining algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more