Reducing borders of k-disjunction free representations of frequent patterns
- Marzena Kryszkiewicz
A number of concise lossless representations of frequent patterns were proposed. Except for closed patterns, all other representations of patterns consist of a main component and a border. Recently, a unifying framework was introduced that treats border representations as particular cases of so called k-disjunction free representations. It was shown that careful splitting of borders into subgroups allows deletion of some of such subgroups without making the representations lossy. In this paper, we propose a new method of border reduction. Our method consists in identifying patterns in the main representation's component that uniquely determine a possibly maximal subset of patterns from the group under reduction. Such itemsets are redundant and can be deleted from border's groups. The performed experiments show that the new method reduces border representations by up to two orders of magnitude.
- Record ID
- Applied Computing 2004, 2004, USA
- DOI:10.1145/967900.968017 Opening in a new tab
- (en) English
- Score (nominal)
- Publication indicators
- = 12; = 9
- Citation count
- Uniform Resource Identifier
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.