Using Answer Set Programming for pattern mining
Texte intégral
Documents relatifs
We also propose a discussion and characterization of the search space of closed sequences and, through the notion of sequence alignments, provide an intuitive implementation of
A pattern mining algorithm explores a very large space (exponential in the number of items) and can return long patterns (the lower the support threshold, the longer the patterns).
Another challenge is to be able to answer complex queries that require appropriate integration of relevant knowledge from different knowledge resources and/or that require
The domain ontology of the pattern defines specific concepts of the domain and their relations and notations based on the core ontologies of the pattern Figure 4.. involving
In this paper we propose a generic formulation of the contextual fre- quent pattern mining problem and provide the CFPM algorithm to mine frequent patterns that are representative of
[11] work, on declarative sequential pattern mining with Answer Set Programming by proposing ecient encoding of rare patterns.. It shows the versatility of declarative approach to
Number of frequent patterns in function of the frequency threshold in the real database (plain line), in the associated simple Bernoulli model (dashed) and in the associated
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des