loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

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

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 e liminate 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)

CC BY-NC-ND 4.0

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 18.190.156.80

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.; 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 (IC3K 2014) - KDIR; ISBN 978-989-758-048-2; ISSN 2184-3228, SciTePress, pages 86-96. DOI: 10.5220/0005078200860096

@conference{kdir14,
author={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 (IC3K 2014) - KDIR},
year={2014},
pages={86-96},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005078200860096},
isbn={978-989-758-048-2},
issn={2184-3228},
}

TY - CONF

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

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic