A CP-based approach for mining sequential patterns with quantities

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<rdf:Description>
<dc:creator>Kemmar, Amina </dc:creator>
<dc:creator>Touati, Chahira</dc:creator>
<dc:creator>Lebbah, Yahia</dc:creator>
<dc:date>2023</dc:date>
<dc:description xml:lang="es">Sumario: This paper addresses the problem of mining sequential patterns (SPM) from data represented as a set of sequences. In this work, we are interested in sequences of items in which each item is associated with its quantity. To the best of our knowledge, existing approaches don't allow to handle this kind of sequences under constraints. In the other hand, several proposals show the efficiency of constraint programming (CP) to solve SPM problem dealing with several kind of constraints</dc:description>
<dc:identifier>https://documentacion.fundacionmapfre.org/documentacion/publico/es/bib/182985.do</dc:identifier>
<dc:language>eng</dc:language>
<dc:rights xml:lang="es">InC - http://rightsstatements.org/vocab/InC/1.0/</dc:rights>
<dc:subject xml:lang="es">Programación</dc:subject>
<dc:subject xml:lang="es">Inteligencia artificial</dc:subject>
<dc:subject xml:lang="es">Análisis de datos</dc:subject>
<dc:type xml:lang="es">Artículos y capítulos</dc:type>
<dc:title xml:lang="es">A CP-based approach for mining sequential patterns with quantities</dc:title>
<dc:relation xml:lang="es">En: Revista Iberoamericana de Inteligencia Artificial. -  : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018- = ISSN 1988-3064. - 13/03/2023 Volumen 26 Número 71 - marzo 2023 , 12 p.</dc:relation>
</rdf:Description>
</rdf:RDF>