Mine 'Em All: A Note on Mining All Graphs

Ondřej Kuželka 1 Jan Ramon 2, 1
2 MAGNET - Machine Learning in Information Networks
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : We study the complexity of the problem of enumerating all graphs with frequency at least 1 and computing their support. We show that there are hereditary classes of graphs for which the complexity of this problem depends on the order in which the graphs should be enumerated (e.g. from frequent to infrequent or from small to large). For instance, the problem can be solved with polynomial delay for databases of planar graphs when the enumerated graphs should be output from large to small but it cannot be solved even in incremental-polynomial time when the enumerated graphs should be output from most frequent to least frequent (unless P=NP).
Keywords : graphs pattern mining
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

Contributor : Jan Ramon <>
Submitted on : Wednesday, May 25, 2016 - 4:19:55 PM
Last modification on : Friday, March 22, 2019 - 1:33:43 AM
Long-term archiving on : Friday, August 26, 2016 - 11:00:12 AM


Files produced by the author(s)


  • HAL Id : hal-01321448, version 1


Ondřej Kuželka, Jan Ramon. Mine 'Em All: A Note on Mining All Graphs. 25th International Conference on Inductive Logic Programming, Katsumi Inoue, Hayato Ohwada, Akihiro Yamamoto, Aug 2015, Kyoto, Japan. ⟨hal-01321448⟩



Record views


Files downloads