(2021) Differentiable Pattern Set Mining.
|
Text
3447548.3467348.pdf Download (1MB) | Preview |
Abstract
Pattern set mining has been successful in discovering small sets of highly informative and useful patterns from data. To find good models, existing methods heuristically explore the twice-exponential search space over all possible pattern sets in a combinatorial way, by which they are limited to data over at most hundreds of features, as well as likely to get stuck in local minima. Here, we propose a gradient based optimization approach that allows us to efficiently discover high-quality pattern sets from data of millions of rows and hundreds of thousands of features. In particular, we propose a novel type of neural autoencoder called BinaPs, using binary activations and binarizing weights in each forward pass, which are directly interpretable as conjunctive patterns. For training, optimizing a data-sparsity aware reconstruction loss, continuous versions of the weights are learned in small, noisy steps. Hence, this formulation of our problem provides a link between the discrete search space and continuous optimization, thus allowing for a gradient based strategy to discover sets of high-quality and noise-robust patterns. Through extensive experiments on both synthetic and real world data, we show that BinaPs discovers high quality and noise robust patterns, and unique among all competitors, easily scales to real supermarket transaction and biological variant call data.
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Divisions: | Jilles Vreeken (Exploratory Data Analysis) |
| Conference: | KDD ACM International Conference on Knowledge Discovery and Data Mining |
| Depositing User: | Osman Ali Mian |
| Date Deposited: | 16 Dec 2021 11:01 |
| Last Modified: | 28 Mar 2022 11:45 |
| Primary Research Area: | NRA5: Empirical & Behavioral Security |
| URI: | https://publications.cispa.saarland/id/eprint/3546 |
Actions
Actions (login required)
 |
View Item |