An Efficient Method for Mining Informative Association Rules in Knowledge Extraction - Machine Learning and Knowledge Extraction Access content directly
Conference Papers Year : 2020

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.
Fichier principal
Vignette du fichier
497121_1_En_13_Chapter.pdf (624.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03414741 , version 1 (04-11-2021)

Licence

Attribution

Identifiers

Cite

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⟩
32 View
10 Download

Altmetric

Share

Gmail Facebook X LinkedIn More