In association rules mining, current trend is witnessing the emergence of a growing number of works toward bringing negative items to light in the mined knowledge. However, the amount of the extracted rules is huge, thus not feasible in practice. In this paper, we propose to extract a subset of generalized association rules (i.e., association rules with negation) from which we can retrieve the whole set of generalized association rules. Results of experiments carried out on benchmark databases showed important profits in terms of compactness of the introduced generic basis. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Gasmi, G., Ben Yahia, S., Nguifo, E. M., & Bouker, S. (2007). Extraction of association rules based on literalsets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4654, pp. 293–302). Springer Verlag. https://doi.org/10.1007/978-3-540-74553-2_27
Mendeley helps you to discover research relevant for your work.