Skip to Main content Skip to Navigation
New interface
Conference papers

An Efficient Method for Mining Informative Association Rules in Knowledge Extraction

Abstract : Mining association rules is an important problem in Knowledge Extraction (KE). This paper proposes an efficient method for mining simultaneously informative positive and negative association rules, using a new selective pair support-$$M_{GK}$$. For this, we define four new bases of positive and negative association rules, based on Galois connection semantics. These bases are characterized by frequent closed itemsets, maximal frequent itemsets, and their generator itemsets; it consists of the non-redundant exact and approximate association rules having minimal premise and maximal conclusion, i.e. the informative association rules. We introduce Nonred algorithm allowing to generate these bases and all valid informative association rules. Results experiments carried out on reference datasets show the usefulness of this approach.
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, November 4, 2021 - 3:57:58 PM
Last modification on : Thursday, August 11, 2022 - 1:14:06 PM
Long-term archiving on: : Saturday, February 5, 2022 - 7:09:37 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2023-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Parfait Bemarisika, André Totohasina. An Efficient Method for Mining Informative Association Rules in Knowledge Extraction. 4th International Cross-Domain Conference for Machine Learning and Knowledge Extraction (CD-MAKE), Aug 2020, Dublin, Ireland. pp.227-247, ⟨10.1007/978-3-030-57321-8_13⟩. ⟨hal-03414741⟩



Record views