Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Frequent subgraph mining in outerplanar graphs

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


Ungar, L. ; Association for Computing Machinery -ACM-, Special Interest Group on Knowledge Discovery and Data Mining -SIGKDD-:
12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006. Proceedings : August 20-23, 2006, Philadelphia, PA, USA
New York: ACM, 2006
ISBN: 1-59593-339-5
International Conference on Knowledge Discovery and Data Mining (KDD) <12, 2006, Philadelphia/Pa.>
Fraunhofer IAIS ()

In recent years there has been an increased interest in algorithms that can perform 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 generalization 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.