Paper Unlock

Authors: Belaïd Benhamou 1 ; Saïd Jabbour 2 ; Lakhdar Sais 2 and Yakoub Salhi 2

Affiliations: 1 Aix-Marseille Université and Université d’Artois, France ; 2 Université d’Artois, France

ISBN: 978-989-758-048-2

Keyword(s): Data Mining, Itemset Mining, Symmetry, Satisfiability, Constraint Programming.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Foundations of Knowledge Discovery in Databases ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mining Text and Semi-Structured Data ; Symbolic Systems

Abstract: The concept of symmetry has been extensively studied in the field of constraint programming and in propositional satisfiability. Several methods for detection and removal of these symmetries have been developed, and their integration in known solvers of these domain improved dramatically their effectiveness on a large variety of problems considered difficult to solve. The concept of symmetry may be exported to other domains where some structures can be exploited effectively. Particularly in data mining where some tasks can be expressed as constraints. In this paper, we are interested in the detection and elimination of symmetries in the problem of finding frequent itemsets of a transaction database and its variants. Recent works have provided effective encodings as Boolean constraints for these data mining tasks and some recent works on symmetry detection and elimination in itemset mining problems have been proposed. In this work we propose a generic framework that could be used to el iminate symmetries for data mining task expressed in a declarative constraint language. We show how symmetries between the items of the transactions are detected and eliminated by adding symmetry-breaking predicate (SBP) to the Boolean encoding of the data mining task. (More)

PDF ImageFull Text


Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Benhamou, B.; Benhamou, B.; Jabbour, S.; Sais, L. and Salhi, Y. (2014). Symmetry Breaking in Itemset Mining.In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014) ISBN 978-989-758-048-2, pages 86-96. DOI: 10.5220/0005078200860096

author={Belaïd Benhamou. and Belaïd Benhamou. and Saïd Jabbour. and Lakhdar Sais. and Yakoub Salhi.},
title={Symmetry Breaking in Itemset Mining},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014)},


JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014)
TI - Symmetry Breaking in Itemset Mining
SN - 978-989-758-048-2
AU - Benhamou, B.
AU - Benhamou, B.
AU - Jabbour, S.
AU - Sais, L.
AU - Salhi, Y.
PY - 2014
SP - 86
EP - 96
DO - 10.5220/0005078200860096

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.