A novel MapReduce-based approach for distributed frequent subgraph mining - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A novel MapReduce-based approach for distributed frequent subgraph mining

Résumé

Recently, graph mining approaches have become very popular, especially in certain domains such as bioinformatics, chemoinformatics and social networks. One of the most challenging tasks is frequent subgraph discovery. This task has been highly motivated by the tremendously increasing size of existing graph databases. Due to this fact, there is an urgent need of efficient and scaling approaches for frequent subgraph discovery. In this paper, we propose a novel approach to approximate large-scale subgraph mining by means of a density-based partitioning technique, using the MapReduce framework. Our partitioning aims to balance computational load on a collection of machines. We experimentally show that our approach decreases significantly the execution time and scales the subgraph discovery process to large graph databases.
Fichier principal
Vignette du fichier
rfia2014_submission_113.pdf (646.18 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00989200 , version 1 (09-05-2014)

Identifiants

  • HAL Id : hal-00989200 , version 1

Citer

Sabeur Aridhi, Laurent d'Orazio, Monder Maddouri, Engelbert Mephu. A novel MapReduce-based approach for distributed frequent subgraph mining. Reconnaissance de Formes et Intelligence Artificielle (RFIA) 2014, Jun 2014, France. ⟨hal-00989200⟩
280 Consultations
887 Téléchargements

Partager

Gmail Facebook X LinkedIn More