Exploiting complex pattern features for interactive pattern mining
Not on the map. Why?
Abstract (arXiv)
Recent years have seen a shift from a pattern mining process that has users define constraints before-hand, and sift through the results afterwards, to an interactive one. This new framework depends on exploiting user feedback to learn a quality function for patterns. Existing approaches have a weakness in that they use static pre-defined low-level features, and attempt to learn independent weights representing their importance to the user. As an alternative, we propose to work with more complex features that are derived directly from the pattern ranking imposed by the user. Learned weights are then aggregated onto lower-level features and help to drive the quality function in the right direction. We explore the effect of different parameter choices experimentally and find that using higher-complexity features leads to the selection of patterns that are better aligned with a hidden quality function while not adding significantly to the run times of the method. Getting good user feedback requires to quickly present diverse patterns, something that we achieve but pushing an existing diversity constraint into the sampling component of the interactive mining system LetSip. Resulting patterns allow in most cases to converge to a good solution more quickly. Combining the two improvements, finally, leads to an algorithm showing clear advantages over the existing state-of-the-art.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 34 references that are in the map. First posted on arXiv 8 Apr 2022.
Builds on
4 of 34 references.
References · 4
- 2014Distribution-Aware Sampling and Weighted Model Counting for SATcited by 15
- 2016Flexible constrained sampling with guarantees for pattern miningcited by 7
- 2015Constrained Sampling and Counting: Universal Hashing Meets SAT Solvingcited by 6
- 2017Learning what matters - Sampling interesting patternscited by 5
Built on by
Not cited yet.