Publisher
Springer Nature Singapore
Reference13 articles.
1. Borgelt, C.: Frequent item set mining. Wiley Interdisc. Rev. Data-Min. Knowl. Discov. 2(6), 437–456 (2012)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Databases, VLDB. Citeseer (1994)
3. Han, J., et al.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)
4. Aryabarzan, N., Minaei-Bidgoli, B., Teshnehlab, M.: NegFIN: an efficient algorithm for fast mining frequent itemsets. Expert Syst. Appl. 105, 129–143 (2018)
5. Qu, J.-F., et al.: Efficient mining of frequent itemsets using only one dynamic prefix tree. IEEE Access 8, 183722–183735 (2020)