.png){kind=icon}
Return
Scalable algorithms for association mining
.png){kind=icon}
PRE
AI
DOI：10.1109/69.846291.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets and then, forming conditional implication rules among them. In this paper. we present efficient algorithms for the discovery of frequent itemsets which forms the compute intensive phase of the task. The algorithms utilize the structural properties of frequent itemsets to facilitate fast discovery. The items are organized into a subset lattice search space, which is decomposed into small independent chunks or sublattices, which can be solved in memory. Efficient lattice traversal techniques are presented which quickly identify all the long frequent itemsets and their subsets if required. We also present the effect of using different database layout schemes combined with the proposed decomposition and traversal techniques. We experimentally compare the new algorithms against the previous approaches, obtaining improvements of more than an order of magnitude for our test databases.
Keywords:
association rules
frequent itemsets
equivalence classes
maximal cliques
lattices
data mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
No organization information available
Cited Papers
Point-of-Care Prostate Specific Antigen Testing: Examining Translational Progress toward Clinical Implementation.png)
ACS Sensors
OAAI
ACS SensorsIF0
OAAIShareSaveShareSaveSemi-analytic contact technique in a non-linear parametric model order reduction method for gear simulationsMeccanica
MeccanicaIF0
PREAI
ShareSave
View more