ALPINE: Anytime Mining with Definite Guarantees
Qiong Hu, Tomasz Imielinski

TL;DR
ALPINE is an innovative anytime algorithm for mining frequent itemsets that guarantees complete results above a support threshold at each checkpoint, making it suitable for high-dimensional, long mining tasks without predefining minimum support.
Contribution
It introduces the first anytime algorithm for frequent itemset mining with definite guarantees, eliminating the need for a pre-set minimum support value.
Findings
Provides intermediate complete results during mining
Offers guarantees on itemsets with support above current checkpoint
Suitable for high-dimensional, long mining tasks
Abstract
ALPINE is to our knowledge the first anytime algorithm to mine frequent itemsets and closed frequent itemsets. It guarantees that all itemsets with support exceeding the current checkpoint's support have been found before it proceeds further. Thus, it is very attractive for extremely long mining tasks with very high dimensional data (for example in genetics) because it can offer intermediate meaningful and complete results. This ANYTIME feature is the most important contribution of ALPINE, which is also fast but not necessarily the fastest algorithm around. Another critical advantage of ALPINE is that it does not require the apriori decided minimum support value.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Rough Sets and Fuzzy Logic · Data Management and Algorithms
