Geodesic
FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs
Journal of Graph Algorithms and Applications, Tome 15 (2011) no. 6, pp. 753-776.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

In recent years, graph representations have been used extensively for modelling complicated structural information, such as circuits, images, molecular structures, biological networks, weblogs, XML documents and so on. As a result, frequent subgraph mining has become an important subfield of graph mining. This paper presents a novel Frequent Pattern Graph Mining algorithm, FP-GraphMiner, that compactly represents a set of network graphs as a Frequent Pattern Graph (or FP-Graph). This graph can be used to efficiently mine frequent subgraphs including maximal frequent subgraphs and maximum common subgraphs. The algorithm is space and time efficient requiring just one scan of the graph database for the construction of the FP-Graph, and the search space is significantly reduced by clustering the subgraphs based on their frequency of occurrence. A series of experiments performed on sparse, dense and complete graph data sets and a comparison with MARGIN, gSpan and FSMA using real time network data sets confirm the efficiency of the proposed FP-GraphMiner algorithm. Keywords: frequent pattern mining, frequent subgraph, graph database, graph mining, maximal frequent subgraph, maximum common subgraph. 
@article{JGAA_2011_15_6_a2,
     author = {R. Vijayalakshmi and R. Nadarajan and John Roddick and M. Thilaga and P. Nirmala},
     title = {FP-GraphMiner-A {Fast} {Frequent} {Pattern} {Mining} {Algorithm} for {Network} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {753--776},
     publisher = {mathdoc},
     volume = {15},
     number = {6},
     year = {2011},
     doi = {10.7155/jgaa.00247},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00247/}
}
TY  - JOUR
AU  - R. Vijayalakshmi
AU  - R. Nadarajan
AU  - John Roddick
AU  - M. Thilaga
AU  - P. Nirmala
TI  - FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2011
SP  - 753
EP  - 776
VL  - 15
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00247/
DO  - 10.7155/jgaa.00247
LA  - en
ID  - JGAA_2011_15_6_a2
ER  - 
%0 Journal Article
%A R. Vijayalakshmi
%A R. Nadarajan
%A John Roddick
%A M. Thilaga
%A P. Nirmala
%T FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs
%J Journal of Graph Algorithms and Applications
%D 2011
%P 753-776
%V 15
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00247/
%R 10.7155/jgaa.00247
%G en
%F JGAA_2011_15_6_a2
R. Vijayalakshmi; R. Nadarajan; John Roddick; M. Thilaga; P. Nirmala. FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs. Journal of Graph Algorithms and Applications, Tome 15 (2011) no. 6, pp. 753-776. doi : 10.7155/jgaa.00247. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00247/

Cité par Sources :