@InProceedings{Supelec377,
author = {Frederic Pennerath and Amedeo Napoli},
title = {{Mining Frequent Most Informative Subgraphs}},
year = {2007},
booktitle = {{Mining And Learning With Graphs (MLG)}},
month = {aug},
address = {Florence, Italie},
url = {http://mlg07.dsi.unifi.it/pdf/19_Pennerath.pdf},
abstract = {The main practical problem encountered with frequent subgraph
search methods is the tens of thousands of returned graph
patterns that make their visual analysis impossible. In order to
face this problem, are introduced a very restricted family of
relevant graph patterns called the most informative patterns
along with an algorithm to mine them and associated experimental
results.}
}