An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices
•An efficient algorithm is proposed for mining cross and multilevel closed itemsets.•Closed itemset lattice properties are fully exploited in our approach.•Minimal cross and multilevel association rules are generated in effective manner.•Real-life applications and advantages of our approach are disc...
Gespeichert in:
Veröffentlicht in: | Expert systems with applications 2014-05, Vol.41 (6), p.2914-2938 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •An efficient algorithm is proposed for mining cross and multilevel closed itemsets.•Closed itemset lattice properties are fully exploited in our approach.•Minimal cross and multilevel association rules are generated in effective manner.•Real-life applications and advantages of our approach are discussed and analyzed.•Extensive performance study shows the efficiency and scalability of our algorithm.
Multilevel knowledge in transactional databases plays a significant role in our real-life market basket analysis. Many researchers have mined the hierarchical association rules and thus proposed various approaches. However, some of the existing approaches produce many multilevel and cross-level association rules that fail to convey quality information. From these large number of redundant association rules, it is extremely difficult to extract any meaningful information. There also exist some approaches that mine minimal association rules, but these have many shortcomings due to their naïve-based approaches. In this paper, we have focused on the need for generating hierarchical minimal rules that provide maximal information. An algorithm has been proposed to derive minimal multilevel association rules and cross-level association rules. Our work has made significant contributions in mining the minimal cross-level association rules, which express the mixed relationship between the generalized and specialized view of the transaction itemsets. We are the first to design an efficient algorithm using a closed itemset lattice-based approach, which can mine the most relevant minimal cross-level association rules. The parent–child relationship of the lattices has been exploited while mining cross-level closed itemset lattices. We have extensively evaluated our proposed algorithm’s efficiency using a variety of real-life datasets and performing a large number of experiments. The proposed algorithm has outperformed the existing related work significantly during the pervasive performance comparison. |
---|---|
ISSN: | 0957-4174 1873-6793 |
DOI: | 10.1016/j.eswa.2013.09.052 |