Delta-Closure Structure for Studying Data Distribution
Not on the map. Why?
Abstract (arXiv)
In this paper, we revisit pattern mining and study the distribution underlying a binary dataset thanks to the closure structure which is based on passkeys, i.e., minimum generators in equivalence classes robust to noise. We introduce Delta-closedness, a generalization of the closure operator, where Delta measures how a closed set differs from its upper neighbors in the partial order induced by closure. A Delta-class of equivalence includes minimum and maximum elements and allows us to characterize the distribution underlying the data. Moreover, the set of Delta-classes of equivalence can be partitioned into the so-called Delta-closure structure. In particular, a Delta-class of equivalence with a high level demonstrates correlations among many attributes, which are supported by more observations when Delta is large. In the experiments, we study the Delta-closure structure of several real-world datasets and show that this structure is very stable for large Delta and does not substantially depend on the data sampling used for the analysis.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 13 Oct 2022.
Builds on
3 of 20 references.
References · 3
- 2016On interestingness measures of formal conceptscited by 9
- 2016Flexible constrained sampling with guarantees for pattern miningcited by 7
- 2013Finding the True Frequent Itemsetscited by 1
Built on by
Not cited yet.