International Conference Papers

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/4

Browse

Author: search.filters.author.Bendjoudi, AhcèneSubject: search.filters.subject.Association rules mining

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Parallel BSO Algorithm for Association Rules Mining Using Master/Worker Paradigm
    (2015-09-06) Djenouri, Youcef; Bendjoudi, Ahcène; Djenouri, Djamel; Habbas, Zineb
    The extraction of association rules from large transactional databases is considered in the paper using cluster architecture parallel computing. Motivated by both the successful sequential BSO-ARM algorithm, and the strong matching between this algorithm and the structure of the cluster architectures, we present in this paper a new parallel ARM algorithm that we call MW-BSO-ARM for Master/Workers version of BSO-ARM. The goal is to deal with large databases by minimizing the communication and synchronization costs, which represent the main challenges that faces any cluster architecture. The experimental results are very promising and show clear improvement that reaches 300% for large instances. For examples, in big transactional database such as WebDocs, the proposed approach generates 107 satisfied rules in only 22 minutes, while a previous GPU-based approach cannot generate more than 103 satisfied rules into 10 hours. The results also reveal that MWBSO-ARM outperforms the PGARM cluster-based approach in terms of computation time.
  • Thumbnail Image
    Item
    Association rules mining using evolutionary algorithms
    (LNCS, 2014-10-16) Djenouri, Youcef; Bendjoudi, Ahcène; Nouali-Taboudjemat, Nadia
    This paper deals with association rules mining using evolutionary algorithms. All previous bio-inspired based association rules mining approaches generate non admissible rules which the end-user can not exploit them. In this paper, we propose two approaches permit to avoid non admissible rules by developing new strategy called delete and decomposition strategy. If an item is appeared in the antecedent and the consequent parts of given rule, this rule is composed on two admissible rules. Then, we delete such item to the antecedent part of the first rule and we delete the same item to the consequent part of the second rule. We also proposed two approaches (IARMGA and IARMMA), the first approach uses a classical genetic algorithm in the search process. However, the second one employs a mimetic algorithm to improve the quality of returned rules. To demonstrate the suggested approaches, several experiments have been carried out using both synthetic and reals instances. The results reveal that it has a compromise between the execution time and the quality of output rules. Indeed, IARMGA is faster than IARMMA whereas the last one outperforms IARMGA in terms of rules quality.
  • Thumbnail Image
    Item
    An Efficient Measure for Evaluating Association Rules
    (2014-08) Djenouri, Youcef; Gheraibai, Youcef; Mehdi, Malika; Bendjoudi, Ahcène
    Association rules mining (ARM) has attracted a lot of attention in the last decade. It aims to extract a set of relevant rules from a given database. In order to evaluate the quality of the resulting rules, existing measures, such as support and confidence, allow to evaluate the resulted rules of ARM process separately, missing the different dependencies between the rules. This paper addresses the problem of evaluating rules by taking into account two aspects: (1) The accuracy of the returned rules on the input data and (2) the distance between the returned rules. The rules set that covers the maximum of rules space is considered. To analyze the behavior of the proposed measure, it has been tested on two recent ARM algorithms BSO-ARM and HBSO-TS.