HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, March 7, 2019 - 10:36:30 AM
Last modification on : Friday, January 21, 2022 - 3:36:02 AM
Long-term archiving on: : Saturday, June 8, 2019 - 1:37:19 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads