2007 | OriginalPaper | Buchkapitel
Extraction of Association Rules Based on Literalsets
verfasst von : Ghada Gasmi, Sadok Ben Yahia, Engelbert Mephu Nguifo, Slim Bouker
Erschienen in: Data Warehousing and Knowledge Discovery
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.