Exploitation des techniques de fouille de données pour la compression de contraintes tables

National audienc

New Methods for Compressing Table Constraints

International audienc

Exploiting Data Mining Techniques for Compressing Table Constraints

International audienceIn 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

New Methods for Compressing Table Constraints

International audienc

An Efficient Heuristic Approach Combining Maximal Itemsets and Area Measure for Compressing Voluminous Table Constraints

International audienc

An Efficient Heuristic Approach Combining Maximal Itemsets and Area Measure for Compressing Voluminous Table Constraints

International audienc

An Efficient Heuristic Approach Combining Maximal Itemsets and Area Measure for Compressing Voluminous Table Constraints

International audienc