Complete and Incomplete Approaches for Graph Mining - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Complete and Incomplete Approaches for Graph Mining

Résumé

In this paper, we revisit approaches for graph mining where a set of simple encodings is proposed. Complete approaches are those using an encoding allowing to get all the frequent subgraphs. Whereas incomplete approaches do not guarantee to nd all the frequent sub- graphs. Our objective is also to highlight the critical points in the process of extracting the frequent subgraphs with complete and incomplete ap- proaches. Current canonical encodings have a complexity which is of exponential nature, motivating this paper to propose a relaxation of canonicity of the encoding leading to complete and incomplete encod- ings with a linear complexity. These techniques are implemented within our graph miner GGM (Generic Graph Miner) and then evaluated on a set of graph databases, showing the behavior of both complete and incomplete approaches.
Fichier principal
Vignette du fichier
hal-01022850.pdf (2.63 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01022850 , version 1 (15-07-2014)

Identifiants

  • HAL Id : hal-01022850 , version 1

Citer

Amina Kemmar, Yahia Lebbah, Mohammed Ouali, Samir Loudni. Complete and Incomplete Approaches for Graph Mining. Proceedings of the 4th International Conference on Web and Information Technologies (ICWIT 2012), Apr 2012, Sidi Bel-Abbes, Algeria. pp.312-317. ⟨hal-01022850⟩
117 Consultations
27 Téléchargements

Partager

Gmail Facebook X LinkedIn More