An Efficient Approach for Extraction Positive and Negative Association Rules from Big Data - Machine Learning and Knowledge Extraction Access content directly
Conference Papers Year : 2018

An Efficient Approach for Extraction Positive and Negative Association Rules from Big Data

Abstract

Mining association rules is an significant research area in Knowledge Extraction. Although the negative association rules have notable advantages, but they are less explored in comparaison with the positive association rules. In this paper, we propose a new approach allowing the mining of positive and negative rules. We define an efficient method of support counting, called reduction-access-database. Moreover, all the frequent itemsets can be obtained in a single scan over the whole database. As for the generating of interesting association rules, we introduce a new efficient technique, called reduction-rules-space. Therefore, only half of the candidate rules have to be studied. Some experiments will be conducted into such reference databases to complete our study.
Fichier principal
Vignette du fichier
472936_1_En_6_Chapter.pdf (552.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02060042 , version 1 (07-03-2019)

Licence

Attribution

Identifiers

Cite

Bemarisika Parfait, Ramanantsoa Harrimann, Totohasina André. An Efficient Approach for Extraction Positive and Negative Association Rules from Big Data. 2nd International Cross-Domain Conference for Machine Learning and Knowledge Extraction (CD-MAKE), Aug 2018, Hamburg, Germany. pp.79-97, ⟨10.1007/978-3-319-99740-7_6⟩. ⟨hal-02060042⟩
173 View
101 Download

Altmetric

Share

Gmail Facebook X LinkedIn More