 |
Conference papers
Exploiting Data Mining Techniques for Compressing Table Constraints
Abstract : In this paper, we propose an improvement of the compression step of sliced table method proposed by Gharbi et al. [1] for compressing and solving table constraints. We consider only n-ary CSP defined in extensional form. More precisely, we propose to use the cover of an itemset in the FP-tree instead of its frequency to improve the construction step of the resulting compressed tables. Moreover, we propose to exploit the compression rate metric instead of savings to compute frequent itemsets relevant for compression. This allows higher compression and leads to an efficient resolution of compressed tables by identifying more accurate frequent itemsets necessary for compression. Experimental results show the effectiveness and efficiency of our approach.
Cited literature [10 references]
https://hal-normandie-univ.archives-ouvertes.fr/hal-02463468
Contributor : Samir Loudni <>
Submitted on : Wednesday, February 5, 2020 - 4:24:45 AM
Last modification on : Friday, February 7, 2020 - 1:43:51 AM
Long-term archiving on: : Wednesday, May 6, 2020 - 2:51:49 PM
Contributor : Samir Loudni <>
Submitted on : Wednesday, February 5, 2020 - 4:24:45 AM
Last modification on : Friday, February 7, 2020 - 1:43:51 AM
Long-term archiving on: : Wednesday, May 6, 2020 - 2:51:49 PM
