%0 Journal Article %1 horvath08 %A Horváth, Tamás %A Ramon, Jan %D 2008 %J Machine Learning and Knowledge Discovery in Databases %K dataMining listing patternMining seminar %P 520--535 %T Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth %U http://dx.doi.org/10.1007/978-3-540-87479-9_52 %X The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a database, cannot be solved in output polynomial time in the generalcase. If, however, the transaction graphs are restricted to forests then the problem becomes tractable. In this paper we generalizethe positive result on forests to graphs of bounded treewidth. In particular, we show that for this class of transaction graphs, frequent connected subgraphs can be listed in incremental polynomial time. Since subgraph isomorphism remains NP-complete for bounded treewidth graphs, the positive complexity result of this papershows that efficient frequent pattern mining is possible even for computationally hard pattern matching operators.

@article{horvath08, abstract = {The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a database, cannot be solved in output polynomial time in the generalcase. If, however, the transaction graphs are restricted to forests then the problem becomes tractable. In this paper we generalizethe positive result on forests to graphs of bounded treewidth. In particular, we show that for this class of transaction graphs, frequent connected subgraphs can be listed in incremental polynomial time. Since subgraph isomorphism remains NP-complete for bounded treewidth graphs, the positive complexity result of this papershows that efficient frequent pattern mining is possible even for computationally hard pattern matching operators.}, added-at = {2009-03-26T12:43:16.000+0100}, author = {Horváth, Tamás and Ramon, Jan}, biburl = {https://www.bibsonomy.org/bibtex/2215af8706ca953113630a229dab40110/mboley}, description = {SpringerLink - Buchkapitel}, interhash = {7f0909ea800fa4a4a6ffeb1fee199418}, intrahash = {215af8706ca953113630a229dab40110}, journal = {Machine Learning and Knowledge Discovery in Databases}, keywords = {dataMining listing patternMining seminar}, pages = {520--535}, timestamp = {2009-03-26T12:43:16.000+0100}, title = {Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth}, url = {http://dx.doi.org/10.1007/978-3-540-87479-9_52}, year = 2008 }