Abstract
The frequent subgraph mining has widespread applications in many different domains such as social network analysis and bioinformatics. Generally, the frequent subgraph mining refers to graph matching. Many research works dealt with structural graph matching, but a little attention is paid to semantic matching when graph vertices and/or edges are attributed. Therefore, the discovered frequent subgraphs should become more pruned by applying a new semantic filter instead of using only structural similarity in the graph matching process. In this paper, we present POSGRAMI, a new hybrid approach for frequent subgraph mining based principally on approximate graph matching. To this end, POSGRAMI first uses an approximate structural similarity function based on graph edit distance function. POSGRAMI then uses a semantic vertices similarity function based on possibilistic information affinity function. In fact, our proposed approach is a new possibilistic version of existing approach in literature named GRAMI. This paper had shown the effectiveness of POSGRAMI on some real datasets. In particular, it achieved a better performance than GRAMI in terms of processing time, number and quality of discovered subgraphs.