Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Frequent subgraph mining in outerplanar graphs

: Horváth, T.; Ramon, J.; Wrobel, S.

Volltext ()

Schobbens, P.-Y.; Vanhoof, V.; Schwanen, G.:
BNAIC’06, Proceedings of the 18th Belgium-Netherlands Conference on Artificial Intelligence : University of Namur 5-6 October, 2006
Namur: University of Namur, 2006
ISSN: 1568-7805
Belgium-Netherlands Conference on Artificial Intelligence (BNAIC) <18, 2006, Namur>
Konferenzbeitrag, Elektronische Publikation
Fraunhofer IAIS ()

In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it becomes intractable for arbitrary graph databases. Existing approaches have therefore resorted to various heuristic strategies and restrictions of the search space, but have not identified a practically relevant tractable graph class beyond trees. In this paper, we define the class of so called tenuous outerplanar graphs, a strict general-ization of trees, develop a frequent subgraph mining algorithm for tenuous outerplanar graphs that works in incremental polynomial time, and evaluate the algorithm empirically on the NCI molecular graph dataset.